Full metadata record
DC FieldValueLanguage
dc.contributor.authorYIN, PYen_US
dc.contributor.authorCHEN, LHen_US
dc.date.accessioned2014-12-08T15:04:08Z-
dc.date.available2014-12-08T15:04:08Z-
dc.date.issued1994-02-01en_US
dc.identifier.issn0167-8655en_US
dc.identifier.urihttp://hdl.handle.net/11536/2642-
dc.description.abstractIn this paper, a new non-iterative clustering method is proposed. It consists of two passes. In the first pass, the mean distance from one object to its nearest neighbor is estimated. Based on this distance, those noises far away from objects are extracted and removed. In the second pass, the mean distance from the remaining objects to their nearest neighbors is computed. Based on the distance, all the intrinsic clusters are then found. The proposed method is non-iterative and can automatically determine the number of clusters. Experimental results also show that the partition generated by the proposed method is more reasonable than that of the well-known c-means algorithm in many complicated object distributions.en_US
dc.language.isoen_USen_US
dc.subjectCLUSTERINGen_US
dc.subjectC-MEANS ALGORITHMen_US
dc.subjectFIXED-RADIUSen_US
dc.subjectMEAN MINIMUM DISTANCEen_US
dc.subjectNOISE CLUSTERen_US
dc.titleA NEW NONITERATIVE APPROACH FOR CLUSTERINGen_US
dc.typeArticleen_US
dc.identifier.journalPATTERN RECOGNITION LETTERSen_US
dc.citation.volume15en_US
dc.citation.issue2en_US
dc.citation.spage125en_US
dc.citation.epage133en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1994MV78400003-
dc.citation.woscount22-
Appears in Collections:Articles