Fast clustering algorithm for information organization

DOI10.1007/3-540-36456-0_69MaRDI QIDQ4414158zbMATH OpenFDO

Authors Kwangcheol Shin, Sangyong Han

Publication date 23 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2588/25880619.htm

Mathematics Subject Classification ID

Database theory (68P15) Natural language processing (68T50) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• The Star Clustering Algorithm for Static and Dynamic Information Organization
• scientific article; zbMATH DE number 1305391
• Nonhierarchical document clustering based on a tolerance rough set model
• The new k-windows algorithm for improving the k-means clustering algorithm
• Structural, Syntactic, and Statistical Pattern Recognition

Cited in

(2)

• scientific article; zbMATH DE number 1305391 (Why is no real title available?)
• Fast agglomerative clustering using information of \(k\)-nearest neighbors

This page was built for publication: Fast clustering algorithm for information organization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414158)