The Star Clustering Algorithm for Static and Dynamic Information Organization
From MaRDI portal
Publication:4679084
DOI10.7155/jgaa.00084zbMath1068.68098OpenAlexW2064244056MaRDI QIDQ4679084
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)
Full work available at URL: https://eudml.org/doc/51529
Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Concept lattice simplification with fuzzy linguistic information based on three-way clustering ⋮ Fast layout computation of clustered networks: algorithmic advances and experimental analysis ⋮ An incremental nested partition method for data clustering ⋮ Variance based three-way clustering approaches for handling overlapping clustering
This page was built for publication: The Star Clustering Algorithm for Static and Dynamic Information Organization