A clustering algorithm based on maximal -distant subtrees

DOI10.1016/J.PATCOG.2006.10.003zbMATH Open1112.68115OpenAlexW1972291553MaRDI QIDQ869022FDOQ869022

Authors: Li Yujian 

Publication date: 26 February 2007

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.10.003

Recommendations

• Adaptive clustering algorithm based on minimal spanning tree cutting
• Hierarchical subtrees agglomerative clustering algorithms
• scientific article; zbMATH DE number 1912000
• A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
• Clustering and outlier detection using isoperimetric number of trees

zbMATH Keywords

number of clustersminimal spanning treeclustering algorithmmaximal \(\Theta\)-distant subtreethreshold cutting

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Cure: An efficient clustering algorithm for large databases
• Hidden Markov Models for Speech Recognition
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Title not available (Why is that?)
• A clustering algorithm based on graph connectivity
• A hierarchical clustering algorithm for categorical sequence data

Cited In (11)

• Data clustering based on maximization of outlier factor
• Clustering with prim's sequential representation of minimum spanning tree
• Adaptive clustering algorithm based on minimal spanning tree cutting
• Handwritten chinese text line segmentation by clustering with distance metric learning
• A sweep-line algorithm for spatial clustering
• Title not available (Why is that?)
• Clustering in trees: Optimizing cluster sizes and number of subtrees
• A local computing-based hierarchical clustering algorithm building density trees
• On the intercluster distance of a tree metric
• A graph-theoretical clustering method based on two rounds of minimum spanning trees
• Clustering and outlier detection using isoperimetric number of trees

This page was built for publication: A clustering algorithm based on maximal \(\varTheta\)-distant subtrees

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