Search Results - (( leaf classification clustering algorithm ) OR ( java segmentation using algorithm ))

  • Showing 1 - 8 results of 8
Refine Results
  1. 1

    Effective k-Means Clustering in Greedy Prepruned Tree-based Classification for Obstructive Sleep Apnea by Sim, Doreen Ying Ying, Ahmad I., Ismail, Chee Siong, Teh

    Published 2022
    “…GPrTC algorithm showed better classification accuracies than k-means clustering in almost all the assigned datasets. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Classification of capsicum leaf disease from a complex cluster of leaves using an improved multiple layers ShuffleNet CNN model by Chyntia Jaby, Entuni, Tengku Mohd Afendi, Zulcaffle, Kismet, Hong Ping

    Published 2023
    “…These models have achieved an average accuracy of classification. However, classifying diseases becomes relatively challenging when a diseased leaf grows alongside a cluster of other leaves. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  3. 3
  4. 4
  5. 5

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…Finally, the algorithm found, which would solve the image segmentation problem.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…On the other hand, the traditional algorithm using template matching only obtained 83.65% recognition rate with 0.97 second processing time. …”
    Get full text
    Get full text
    Get full text
    Book
  7. 7
  8. 8

    Data Analysis and Rating Prediction on Google Play Store Using Data-Mining Techniques by Kayalvily, Tabianan, Denis, Arputharaj, Mohd Norshahriel, Abd Rani, Sarasvathi, Nahalingham

    Published 2022
    “…This method classifies a population into branch-like segments that construct an inverted tree with a root node, internal nodes, and leaf nodes. The algorithm is non-parametric and can efficiently deal with large, complicated datasets without imposing a complicated parametric structure. …”
    Get full text
    Get full text
    Get full text
    Article