Please use this identifier to cite or link to this item:
http://148.72.244.84/xmlui/handle/xmlui/4090
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sarah Saadoon Jasim | - |
dc.contributor.author | Ali Adel Mahmood Al-Taei | - |
dc.date.accessioned | 2023-10-17T09:02:37Z | - |
dc.date.available | 2023-10-17T09:02:37Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | http://dx.doi.org/10.24237/djps.1402.383B | en_US |
dc.identifier.issn | 2222-8373 | - |
dc.identifier.uri | http://148.72.244.84:8080/xmlui/handle/xmlui/4090 | - |
dc.description.abstract | Vegetable crops differ in size, shape, and color and which its suffer from this many leaf batches according to a particular reason. As a result of the plant, pathogens happen for Leaf batches. In agriculture whole fructification, it is essential to learn the origin of plant disease bundles early to be prepared for suitable timing control. In this regard, uses Support Vector Machine (SVM) and K- Nearest Neighbor to classify the plant's symptoms according to their appropriate classifications. These typesare (YS) Yellow Spotted class, (WS) White Spottedclass, (RS) Red Spotted class, and (D) tarnishedclass. Results obtained using SVM algorithm was compared with results obtained by a K-NN algorithm. Specifically, the overall accuracy of SVM model is about 88.17% and 85.61% for the k -NN model (with k = 1) | en_US |
dc.description.sponsorship | https://djps.uodiyala.edu.iq/ | en_US |
dc.language.iso | en | en_US |
dc.publisher | university of Diyala | en_US |
dc.subject | Classification, Support Vector Machine (SVM), k- Nearest Neighbor (k-NN). | en_US |
dc.title | A Comparison Between SVM and K-NN for classification of Plant Diseases | en_US |
dc.type | Article | en_US |
Appears in Collections: | مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
8e-P1(383).pdf | 882.06 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.