Clustering with a minimum spanning tree of scale-free-like structure

Authors:
Niina Päivinen
Affiliations:
Department of Computer Science, University of Kuopio, P.O. Box 1627, FIN-70211 Kuopio, Finland
Venue:
Pattern Recognition Letters
Year:
2005

Citing 0
Cited 11

Revealing Hidden Community Structures and Identifying Bridges in Complex Networks: An Application to Analyzing Contents of Web Pages for Browsing

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
A graph-theoretical clustering method based on two rounds of minimum spanning trees

Pattern Recognition
Identifying Modules in Complex Networks by a Graph-Theoretical Method and Its Application in Protein Interaction Networks

ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
A clustering system for data sequence partitioning

Expert Systems with Applications: An International Journal
The optimal approximation of fuzzy tolerance relation

RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Tactic analysis based on real-world ball trajectory in soccer video

Pattern Recognition
Hybrid minimal spanning tree and mixture of gaussians based clustering algorithm

FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Clustering biological data using voronoi diagram

ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Parameter-lite clustering algorithm based on MST and fuzzy similarity merging

Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Clustering and outlier detection using isoperimetric number of trees

Pattern Recognition
Sketched symbol recognition using Latent-Dynamic Conditional Random Fields and distance-based clustering

Pattern Recognition

Quantified Score

Hi-index	0.10

Visualization

Abstract

In this study a novel approach to graph-theoretic clustering is presented. A clustering algorithm which uses a structure called scale-free minimum spanning tree is presented and its performance is compared with standard minimum spanning tree clustering and k-means methods. The results show that the proposed method is a potential clustering procedure after some further analysis is done.