The Star Clustering Algorithm for Static and Dynamic Information Organization

DOI10.7155/JGAA.00084MaRDI QIDQ4679084zbMATH OpenOpenAlexFDO

Authors Javed A. Aslam, Ekaterina Pelekhov, Daniela Rus

Publication date 25 May 2005

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/51529

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 1305391
• scientific article; zbMATH DE number 1559578
• Incremental Clustering and Dynamic Information Retrieval
• scientific article; zbMATH DE number 1903396
• Information-based clustering

Cited in

(8)

• Variance based three-way clustering approaches for handling overlapping clustering
• scientific article; zbMATH DE number 1305391 (Why is no real title available?)
• scientific article; zbMATH DE number 1952732 (Why is no real title available?)
• scientific article; zbMATH DE number 1559578 (Why is no real title available?)
• Concept lattice simplification with fuzzy linguistic information based on three-way clustering
• Algorithms for the boundary selection problem
• Fast layout computation of clustered networks: algorithmic advances and experimental analysis
• An incremental nested partition method for data clustering

This page was built for publication: The Star Clustering Algorithm for Static and Dynamic Information Organization

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