完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, JCen_US
dc.date.accessioned2014-12-08T15:02:38Z-
dc.date.available2014-12-08T15:02:38Z-
dc.date.issued1996-06-01en_US
dc.identifier.issn0218-0014en_US
dc.identifier.urihttp://hdl.handle.net/11536/1283-
dc.description.abstractThis paper proposes a new clustering method based on the hierarchical use of the analytical two-class clustering tool introduced by Lin and Tsai.(1) The method comprises two phases. In the first phase, called the splitting phase, the data set is hierarchically decomposed into some subsets. In the second phase, called the merging phase, the set-to-set distances between these subsets are checked so that some subsets can be merged back together to obtain better clustering results. We use the idea of the so-called dense cut to determine when to stop the splitting phase. We also use a trace-following technique for the so-called boundary data to reduce significantly the computational load involved in the merging phase. Two algorithms are provided, and many experiments are included to show that the data being processed are not required to be linearly separable, noiseless, or formed of spherical clusters.en_US
dc.language.isoen_USen_US
dc.subjectanalytical two-class clustering toolen_US
dc.subjectsplitting phaseen_US
dc.subjectmerging phaseen_US
dc.subjectsplitting treeen_US
dc.subjectboundary dataen_US
dc.subjectdense cutsen_US
dc.subjectnumber of clustersen_US
dc.titleMulti-class clustering by analytical two-class formulasen_US
dc.typeArticleen_US
dc.identifier.journalINTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCEen_US
dc.citation.volume10en_US
dc.citation.issue4en_US
dc.citation.spage307en_US
dc.citation.epage323en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1996VA94000003-
dc.citation.woscount1-
顯示於類別:期刊論文