A novel construction of connectivity graphs for clustering and visualization
Explore this paper's citation graph
Summary
This paper shows how a novel similarity function can be integrated into one of the authors' algorithms as a method of performing clustering and shows that the resulting method is superior to existing methods in that it can be shown to reliably find a globally optimal clustering rather than local optima which other methods often find.
- Type
- article
- Published
- 2008-05-01
- Cited by
- 5
- References
- 33
- OpenAlex
- https://openalex.org/W37408155
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:73550954
Keywords
Cluster analysis, Computer science, Visualization, Current (fluid), Similarity (geometry)
References
- Self-organization and associative memory: 3rd edition
- Clustering with alternative similarity functions
- Principal Manifolds for Data Visualization and Dimension Reduction
- Local vs global interactions in clustering algorithms: Advances over K-means
- Self-Organizing Maps
- A k-means clustering algorithm
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
- Magnification factors for the GTM algorithm
- Two topographic maps for data visualisation
- Developments of the generative topographic mapping
- k-means++: the advantages of careful seeding
- Multivariate Statistics: A Practical Approach
- GTM: The Generative Topographic Mapping
- Some methods for classification and analysis of multivariate observations
- A tutorial on spectral clustering
- Quantization errors in the harmonic topographic mapping
- Normalized cuts and image segmentation
- The global k-means clustering algorithm
- Least squares quantization in PCM
- Hierarchical GTM: Constructing Localized Nonlinear Projection Manifolds in a Principled Way
Cited by
- Better learning of supervised neural networks based on functional graph: an experimental approach
- Hierarchical Clustering Based Automatic Refactorings Detection
- Identifying Crosscutting Concerns Using Partitional Clustering
- Clustering based adaptive refactoring
- 3 A Clustering Approach for Refac-torings Determination-CARD
Related papers
- Effective and Efficient Clustering Methods for Correlated Probabilistic Graphs
- Local search for constrained graph clustering in biological networks
- Efficient Distributed Clustering Algorithms on Star-Schema Heterogeneous Graphs
- Survey of Correlated Probabilistic Graph
- GBAGC: A General Bayesian Framework for Attributed Graph Clustering
- A Novel Scalable Clustering Method for Distributed Networks
- Clustering Large Probabilistic Graphs
- Efficient Structural Clustering on Probabilistic Graphs
- High-Order Structure Exploration on Massive Graphs