Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/62973
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWatts, Michael Johnen
dc.date.issued2011en
dc.identifier.citationComputational Ecology and Software, 2011; 1(1):1-13en
dc.identifier.issn2220-721Xen
dc.identifier.urihttp://hdl.handle.net/2440/62973-
dc.description.abstractPrevious work has investigated the use of data clustering of regional species assemblages to estimate the relative risk of establishment of insect crop pest species. This paper describes the use of these techniques to estimate the risk posed by bacterial crop plant diseases. Two widely-used clustering algorithms, the Kohonen Self-Organising Map and the k-means clustering algorithm, were investigated. It describes how a wider variety of SOM architectures than previously used were investigated, and how both of these algorithms reacted to the addition of small amounts of random ‘noise’ to the species assemblages. The results indicate that the k-means clustering algorithm is much more computationally efficient, produces better clusters as determined by an objective measure of cluster quality and is more resistant to noise in the data than equivalent Kohonen SOM. Therefore k-means is considered to be the better algorithm for this problem.en
dc.description.statementofresponsibilityMichael J. Wattsen
dc.publisherIAEESen
dc.rightsCopyright IAEES 2011en
dc.source.urihttp://www.iaees.org/publications/journals/ces/online-version.aspen
dc.subjectbacterial diseases; crop; risk; establishment; data clusteringen
dc.titleUsing data clustering as a method of estimating the risk of establishment of bacterial crop diseasesen
dc.typeJournal articleen
dc.contributor.schoolSchool of Earth and Environmental Sciences : Ecology and Evolutionary Biologyen
Appears in Collections:Earth and Environmental Sciences publications
Environment Institute publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.