Clustering on trees

DOI10.1016/S0167-9473(96)00062-XzbMath0900.62327MaRDI QIDQ1392041

Bruno Simeone, Maurizio Maravalle, Rosella Naldini

Publication date: 23 July 1998

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

zbMATH Keywords

HeuristicsComputational complexityTreesSubmodular functionsContiguity-constrained clusteringDistricting

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Complexity and performance of numerical algorithms (65Y20)

Related Items

Non-stationary spatial covariance structure estimation in oversampled domains by cluster differences scaling with spatial constraints, An overview of graph covering and partitioning, Approximation algorithms for the maximum bounded connected bipartition problem, Unnamed Item, An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters, Max-min weight balanced connected partition, Improved algorithms for path partition and related problems, Approximation and parameterized algorithms for balanced connected partition problems, Approximation algorithm for the balanced 2-connected \(k\)-partition problem, Balanced connected partitions of graphs: approximation, parameterization and lower bounds, Connected graph partitioning with aggregated and non‐aggregated gap objective functions, Uniform and most uniform partitions of trees, Star partitions on graphs, Dense and sparse graph partition, On finding connected balanced partitions of trees, Partitioning a graph into balanced connected classes: formulations, separation and experiments, A constrained \(k\)-means clustering algorithm for classifying spatial units, Approximation algorithms for maximally balanced connected graph partition, Computing sharp bounds for hard clustering problems on trees, Partitioning of trees for minimizing height and cardinality, Unnamed Item, Path equipartition in the Chebyshev norm

Uses Software

• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving capacitated clustering problems
• Edge and vertex intersection of paths in a tree
• Clustering with relational constraint
• Maximum split clustering under connectivity constraints
• Cluster Analysis: An Application of Lagrangian Relaxation
• On Grouping for Maximum Homogeneity
• Contextual Template Matching: A Distance Measure for Patterns with Hierarchically Dependent Features
• Conditional Clustering
• Bicriterion Cluster Analysis
• Finding Groups in Data
• Partition Regression
• An analysis of approximations for maximizing submodular set functions—I
• A spanning tree heuristic for regional clustering
• Cluster Analysis and Mathematical Programming