A grid clustering technique based on minimal spanning trees

MaRDI QIDQ3098736zbMATH OpenFDO

Authors Xiyu Liu, Wenping Wang, Feng Qi, Wenxing Sun

Publication date 18 November 2011

Full work available at URL http://online.watsci.org/abstract_pdf/2011v18/v18n3b-pdf/7.pdf

zbMATH Keywords

cluster analysisgrid clusteringminimum spanning tree

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• A minimal spanning tree algorithm applied to spatial cluster analysis
• Adaptive clustering algorithm based on minimal spanning tree cutting
• An improved clustering algorithm for minimum spanning trees in multidimensional data
• A grid density-based clustering algorithm for large databases
• Mountain clustering on non-uniform grids using \(p\)-trees

Cited in

(8)

• Spatial cluster analysis by the bin-packing problem and DNA computing technique
• A graph-theoretical clustering method based on two rounds of minimum spanning trees
• A minimal spanning tree algorithm applied to spatial cluster analysis
• Clustering with prim's sequential representation of minimum spanning tree
• A clustering algorithm for machine cell formation in group technology using minimum spanning trees
• An application of the minimal spanning tree approach to the cluster stability problem
• Spatial cluster analysis by the Adleman-Lipton DNA computing model and flexible grids
• Mountain clustering on non-uniform grids using \(p\)-trees

This page was built for publication: A grid clustering technique based on minimal spanning trees

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