2018
DOI: 10.1088/1757-899x/288/1/012058
|View full text |Cite
|
Sign up to set email alerts
|

Plant Leaf Recognition Using Competitive Based Learning Algorithm

Abstract: Abstract. Plant recognition based on digital leaf image has received as particular attention in computer vision and intelligence system, due its important implication in automatic plant identification. Plant species have the unique leaf characteristics such as the shape, texture, margin, and colour, which different each other. This study presents a novel method for automation plant recognition using Generalized Relevance Learning Vector Quantization (GRLVQ). GRLVQ is a competitive based learning algorithm whic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2
2
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…REP tree classi er is a fast DT learner that builds a tree based on information gain with entropy and prunes it using reducederror pruning [63]. RT is a DT that it's nodes are constructed using randomly chosen attributes and the class probabilities on each node are based on back tting with no pruning [64].…”
Section: Decision Tree (Dt)mentioning
confidence: 99%
“…REP tree classi er is a fast DT learner that builds a tree based on information gain with entropy and prunes it using reducederror pruning [63]. RT is a DT that it's nodes are constructed using randomly chosen attributes and the class probabilities on each node are based on back tting with no pruning [64].…”
Section: Decision Tree (Dt)mentioning
confidence: 99%
“…REP tree classifier is a fast DT learner that builds a tree based on information gain with entropy and prunes it using reduced-error pruning [63]. RT is a DT that it's nodes are constructed using randomly chosen attributes and the class probabilities on each node are based on back fitting with no pruning [64].…”
Section: Decision Tree (Dt)mentioning
confidence: 99%
“…REP tree classi er is a fast DT learner that builds a tree based on information gain with entropy and prunes it using reducederror pruning [58]. RT is a DT that it's nodes are constructed using randomly chosen attributes and the class probabilities on each node are based on back tting with no pruning [59].…”
Section: Decision Tree (Dt)mentioning
confidence: 99%