Fuzzy clustering based on cooccurrence matrix and its application to data retrieval

Citation
K. Inoue et K. Urahama, Fuzzy clustering based on cooccurrence matrix and its application to data retrieval, ELEC C JP 2, 84(8), 2001, pp. 10-19
Citations number
6
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART II-ELECTRONICS
ISSN journal
8756663X → ACNP
Volume
84
Issue
8
Year of publication
2001
Pages
10 - 19
Database
ISI
SICI code
8756-663X(2001)84:8<10:FCBOCM>2.0.ZU;2-Q
Abstract
A fuzzy clustering method is proposed to cluster objects and classes based on the cooccurrence matrix that represents the cooccurrence relationship of the objects and the classes, It is a type of method known as a graph spect ral method that reduces the problem to an eigenvalue problem and successive ly extracts the clusters. A method based on the similarity matrix is applie d to the cooccurrence matrix and is extended to hierarchical fuzzy clusteri ng. This method obtains the cluster information of the class simultaneously with object clustering. As an application example of this clustering metho d, we present data retrieval by key words. Since clustering extracts the ov erall data structure to some degree, the retrieval is robust in noisy data similar to Latent Semantic Indexing. Fuzzy clustering performs object-level retrieval because the detailed information lost in hard clustering is pres erved. (C) 2001 Scripta Technica, Electron Comm Jpn.