Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1763
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Radha N | - |
dc.contributor.author | Rehana Banu H | - |
dc.date.accessioned | 2020-09-28T05:11:26Z | - |
dc.date.available | 2020-09-28T05:11:26Z | - |
dc.date.issued | 2019-07-11 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/1763 | - |
dc.description.abstract | Plants play an important role to equalize the carbon-oxygen cycle in the earth. Without knowing the importance of valuable plants, the plants are at the extinction. To help the naïve user to know about plants and it is important there is demand to develop a system to classify the plants based on the leaves. Due to the boon of ICT and machine learning algorithms, the leaves can be easily classified. Plant Leaf images are collected in Coimbatore. The main aim of this paper is to classify the leaves using Support Vector Machine (SVM) using KBF kernel, K-Nearest Neighbor, AdaBoost classifiers and also the accuracy obtained in these classifiers are compared. The performance of the models is evaluated using 10-fold cross validation method and the results are discussed. The classifier using SVM and KNN outperforms well than Adaboost classifiers | en_US |
dc.language.iso | en | en_US |
dc.publisher | In association with IBM,AICTE,CSIR with Sri Ramakrishna Engineering College, Coimbatore | en_US |
dc.subject | Leaf Classification | en_US |
dc.subject | Support Vector Machine | en_US |
dc.subject | Adaboost | en_US |
dc.subject | K-NN Introduction | en_US |
dc.title | LEAF IDENTIFICATION USING MACHINE LEARNING ALGORITHMS | en_US |
dc.title.alternative | ICIDT 2019 | en_US |
dc.type | Book | en_US |
Appears in Collections: | International Conference |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
LEAF IDENTIFICATION USING MACHINE LEARNING ALGORITHMS.docx | 10.29 kB | Microsoft Word XML | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.