A novel dynamic minimum spanning tree based clustering method for image mining

DOI10.1080/09720529.2011.10698345MaRDI QIDQ2895977zbMATH OpenOpenAlexFDO

Authors S. John Peter

Publication date 13 July 2012

Published in Journal of Discrete Mathematical Sciences \& Cryptography (Search for Journal in Brave)

Full work available at URL http://www.connectjournals.com/file_html_pdf/1266705H_01_JDMSC_T25_14-5_pp405-419a.pdf

zbMATH Keywords

cluster separationclusteringimage miningimage segmentationweighted Euclidean minimum spanning tree

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10)

Recommendations

• Structural, Syntactic, and Statistical Pattern Recognition
• CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
• Clustering with prim's sequential representation of minimum spanning tree
• scientific article; zbMATH DE number 5904848
• A minimum spanning tree based image segmentation algorithm with closed-form solution

Cites work

• A randomized linear-time algorithm to find minimum spanning trees
• Diameter partitioning
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Finding the Number of Clusters in a Dataset
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• How Many Clusters? An Information-Theoretic Perspective
• On the number of clusters
• The NP-completeness column: An ongoing guide

Cited in

(1)

• Incorporating domain knowledge into medical image clustering

This page was built for publication: A novel dynamic minimum spanning tree based clustering method for image mining

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