Clustering on trees

DOI10.1016/S0167-9473(96)00062-XMaRDI QIDQ1392041zbMATH OpenFDO

Authors Maurizio Maravalle, Bruno Simeone, Rosella Naldini

Publication date 23 July 1998

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

zbMATH Keywords

Computational complexityHeuristicsSubmodular functionsTreesContiguity-constrained clusteringDistricting

Mathematics Subject Classification ID

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

Recommendations

• Computing sharp bounds for hard clustering problems on trees
• Clustering in trees: Optimizing cluster sizes and number of subtrees
• Maximum split clustering under connectivity constraints
• NP-hard problems in hierarchical-tree clustering

Cites work

• scientific article; zbMATH DE number 4007498 (Why is no real title available?)
• scientific article; zbMATH DE number 3678973 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3504320 (Why is no real title available?)
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1107550 (Why is no real title available?)
• scientific article; zbMATH DE number 3800808 (Why is no real title available?)
• scientific article; zbMATH DE number 3395637 (Why is no real title available?)
• A spanning tree heuristic for regional clustering
• An analysis of approximations for maximizing submodular set functions—I
• Bicriterion Cluster Analysis
• Cluster Analysis and Mathematical Programming
• Cluster Analysis: An Application of Lagrangian Relaxation
• Clustering with relational constraint
• Conditional Clustering
• Contextual Template Matching: A Distance Measure for Patterns with Hierarchically Dependent Features
• Edge and vertex intersection of paths in a tree
• Finding Groups in Data
• Maximum split clustering under connectivity constraints
• On Grouping for Maximum Homogeneity
• Partition Regression
• Solving capacitated clustering problems

Cited in

(36)

• An overview of graph covering and partitioning
• Improved algorithms for path partition and related problems
• Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
• On cluster tree for nested and multi-density data clustering
• scientific article; zbMATH DE number 2230227 (Why is no real title available?)
• A constrained \(k\)-means clustering algorithm for classifying spatial units
• Dense and sparse graph partition
• Non-stationary spatial covariance structure estimation in oversampled domains by cluster differences scaling with spatial constraints
• NP-hard problems in hierarchical-tree clustering
• A structured family of clustering and tree construction methods
• Uniform and most uniform partitions of trees
• Path equipartition in the Chebyshev norm
• On finding connected balanced partitions of trees
• Partitioning a graph into balanced connected classes: formulations, separation and experiments
• Connected graph partitioning with aggregated and non‐aggregated gap objective functions
• A ``maximum node clustering problem
• On the complexity of graph tree partition problems.
• An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters
• Partitioning of trees for minimizing height and cardinality
• Approximation algorithm for the balanced 2-connected k-partition problem
• Clustering in trees: Optimizing cluster sizes and number of subtrees
• Clumping in multitype-branching trees
• Computing sharp bounds for hard clustering problems on trees
• Maximum split clustering under connectivity constraints
• A spanning tree heuristic for regional clustering
• Recovering Trees with Convex Clustering
• Bayesian contiguity constrained clustering
• Star partitions on graphs
• Approximation algorithms for maximally balanced connected graph partition
• scientific article; zbMATH DE number 1895642 (Why is no real title available?)
• Approximation algorithms for the maximum bounded connected bipartition problem
• Approximation and parameterized algorithms for balanced connected partition problems
• A minimal spanning tree algorithm applied to spatial cluster analysis
• Balanced connected partitions of graphs: approximation, parameterization and lower bounds
• On clustering tree structured data with categorical nature
• Max-min weight balanced connected partition

Describes a project that uses

Uses Software

• clusfind

This page was built for publication: Clustering on trees

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