Parameter-Free Minimum Spanning Tree (PFMST) Based Clustering Algorithm

B. H. V. S. Ramakrishnam Raju; V. Valli Kumari

doi:10.1007/978-3-642-24037-9_55

ScienceGate Book Chapters

BOOK-CHAPTER

Parameter-Free Minimum Spanning Tree (PFMST) Based Clustering Algorithm

B. H. V. S. Ramakrishnam Raju V. Valli Kumari

Year: 2011 Communications in computer and information science Pages: 552-560 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-642-24037-9_55

Get Full-Text PDF Get Analytical Report

Keywords:

Cluster analysis Computer science CURE data clustering algorithm Correlation clustering Minimum spanning tree Determining the number of clusters in a data set Algorithm Canopy clustering algorithm Cluster (spacecraft) Single-linkage clustering Tree (set theory) Data mining Data stream clustering Mathematics Artificial intelligence Combinatorics

Metrics

Cited By

0.38

FWCI (Field Weighted Citation Impact)

Refs

0.60

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Advanced Clustering Algorithms Research

Physical Sciences → Computer Science → Artificial Intelligence

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Data Mining Algorithms and Applications

Physical Sciences → Computer Science → Information Systems

Parameter-Free Minimum Spanning Tree (PFMST) Based Clustering Algorithm

Metrics

Topics

Related Documents

Clustering based minimum spanning tree algorithm

An efficient minimum spanning tree based clustering algorithm

Fast approximate minimum spanning tree based clustering algorithm

Uneven clustering routing algorithm based on minimum spanning tree

A Minimum Spanning Tree Clustering Algorithm Based on Density