A clustering algorithm based on maximal \(\varTheta\)-distant subtrees

DOI10.1016/J.PATCOG.2006.10.003zbMath1112.68115OpenAlexW1972291553MaRDI QIDQ869022

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

zbMATH Keywords

clustering algorithmnumber of clustersminimal spanning treemaximal \(\Theta\)-distant subtreethreshold cutting

Mathematics Subject Classification ID

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

Related Items (4)

Clustering with prim's sequential representation of minimum spanning tree ⋮ A graph-theoretical clustering method based on two rounds of minimum spanning trees ⋮ Handwritten chinese text line segmentation by clustering with distance metric learning ⋮ A sweep-line algorithm for spatial clustering

Cites Work

• A clustering algorithm based on graph connectivity
• Cure: An efficient clustering algorithm for large databases
• A hierarchical clustering algorithm for categorical sequence data
• Hidden Markov Models for Speech Recognition
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Unnamed Item
• Unnamed Item
• Unnamed Item

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