There has been a surge in the number of large and flat data sets - data sets containing a large number of features and a relatively small number of observations - due to the growing ability to collect and store information in medical research and other fields. Hierarchical clustering is a widely used clustering tool. I…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,341 papers · 148 categories
Trend · papers per month
48 results for “hierarchically clustered data”
t-NEB clusters high-dimensional data hierarchically with density paths.
problem Hierarchical clustering struggles with high-dimensional data.
method t-NEB uses density estimation, maximum density paths, and probabilistic merging.
result t-NEB yields state-of-the-art clustering performance on high-dimensional data.
Interactive steering improves hierarchical clustering for diverse user needs.
problem Existing hierarchical clustering methods fail to meet diverse user needs.
method Knowledge-driven and data-driven constraints, interactive steering through a visual interface.
result Facilitates the building of customized clustering trees efficiently and effectively.
Tree-SNE combines t-SNE and hierarchical clustering for data visualization.
problem Data visualization and clustering in complex datasets.
method Stacked one-dimensional t-SNE embeddings and alpha-clustering.
result Effective hierarchical clustering and visualization of various datasets.
A hierarchical clustering algorithm for data clouds without structure assumptions.
problem Exploring data clouds without making structure assumptions.
method Hierarchical topological clustering algorithm that infers persistence of outliers and clusters of arbitrary shape from data hierarchy.
result The algorithm can provide meaningful clusters in complex datasets.
CCMM efficiently solves large-scale convex clustering problems.
problem Scalability and hierarchical structure in convex clustering.
method Majorization-minimization algorithm with cluster fusions and efficient updating.
result CCMM achieves efficient solutions for large datasets.
Method preserves order in hierarchical clustering of ordered data.
problem Order preserving hierarchical clustering of directed acyclic graphs.
method Combination of classical hierarchical clustering and ultrametric fitting.
result Optimal clustering preserves both cluster quality and order.
The paper extends fairness to hierarchical clustering, finding efficient algorithms with minimal loss.
problem Ensuring fairness in hierarchical clustering where data is recursively partitioned.
method Extending fairness to hierarchical clustering, developing simple, efficient algorithms for various objectives.
result Simple, efficient algorithms for fair hierarchical clustering with only a negligible loss in objective.
New clustering method recovers hidden tree structure from data.
problem Recovering hidden hierarchical structure in data.
method Maximum average dot product for merging clusters in hierarchical clustering.
result The algorithm produces a tree that accurately represents the underlying generative hierarchical structure.
Hybrid clustering merges -means and hierarchical methods for diverse group shapes.
problem Clustering homogeneous spherical groups in large datasets.
method First, -means partitions the dataset into spherical groups. Then, hierarchical clustering merges these groups with a data-driven distance measure.
result Hybrid approach reveals general-shaped groups in datasets.
Randomized hierarchical clustering tests for stability and detects clusters.
problem Greedy hierarchical clustering's sensitivity to data perturbations.
method Randomization scheme and p-values at each node.
result Valid hypothesis testing procedures for clustering results.
FISHDBC clusters arbitrary data with flexible, scalable, and hierarchical features.
problem Clustering arbitrary data with arbitrary distance functions efficiently.
method Flexible, incremental, scalable, hierarchical density-based clustering algorithm.
result Flexible clustering of arbitrary data without feature extraction.
A new hierarchical clustering method selects representative points from sub-minimum-spanning-trees.
problem Selecting representative points for hierarchical clustering to improve robustness and reliability.
method Identify representative points using reciprocal nearest data points in sub-minimum-spanning-trees.
result The proposed algorithm outperforms other methods in accuracy and efficiency.
HCRL learns hierarchical embeddings from deep embeddings of hierarchy components.
problem Flat clustering limits cohesive instance relations in hierarchical data.
method Simultaneously optimizes representation learning and hierarchical clustering in the embedding space.
result HCRL achieves best hierarchical clustering and data reconstruction.
Extends clustering method to cost-based hierarchies.
problem Guaranteeing near-optimality in hierarchical clustering.
method Optimization-based Sublevel Set method extended to cost-based hierarchies.
result Ensures clustering is nearly optimal without distributional assumptions.
HiPart offers an efficient, interactive tool for hierarchical clustering.
problem Efficient and interpretable hierarchical clustering for Big Data.
method Divisive hierarchical clustering algorithms with interactive visualizations.
result High computational efficiency and interpretability in Big Data applications.
Exact hierarchical clustering algorithms for data analysis.
problem Finding meaningful structures in data like phylogenetic trees.
method Novel dynamic-programming algorithms based on a trellis data structure.
result Exact computation of partition function, maximum likelihood hierarchy, and marginal probabilities.
Method learns graph from data clusters using FCA.
problem Learning graph representation from multivariate data.
method Uses formal concept analysis (FCA) to extract hierarchical relationships between clusters.
result Empirically shows superior hierarchical structure extraction compared to baseline.
Proposes a method to incorporate prior domain knowledge into hierarchical clustering.
problem Hierarchical clustering results depend on similarity measures and algorithm choices.
method Uses ultrametric distance function to encode external ontological information and adds it as a penalty term to the original pairwise distance.
result Popular linkage-based algorithms can faithfully recover the encoded structure.
Paper tackles online hierarchical clustering, offering efficient algorithms with good quality clusters.
problem Offline hierarchical clustering algorithms require full dataset, limiting their use on large datasets.
method Proposes two online algorithms (OTD and OHAC) to optimize Moseley and Wang revenue function.
result OTD achieves 1/3-approximation to MW revenue under data separation assumption.
Extends convex clustering to graph-structured data.
problem Handling graph-structured data with convex clustering.
method Formulates a convex objective and uses a proximal dual algorithm for efficient recovery.
result Demonstrates the effectiveness of the method on real-life datasets.
Bayesian nonparametric method for hierarchical clustering.
problem Hierarchical non-overlapping clustering of a dataset.
method Combining nCRP and HDP for complex latent mixture features.
result Solid empirical results compared to existing algorithms.
Stable density-based clustering via multiparameter persistence.
problem Density-based clustering stability to data perturbations.
method Degree-Rips construction, correspondence-interleaving distance, multiparameter stability analysis.
result Persistable pipeline yields stable, consistent density-based clustering.
Estimates hierarchical clustering structure from noisy data.
problem Uncertainty in data measurements affects hierarchical clustering.
method Maximum likelihood estimation for dendrogram structure.
result Approximate MLE outperforms standard SLHC in noisy data.
A novel multi-clustering method based on boosting improves hierarchical clustering quality.
problem Improving hierarchical clustering quality in flat clustering problems.
method A boosting iteration with weighted random sampling of elements from the original dataset, followed by hierarchical clustering on each subsample and consensus combination.
result The proposed method provides superior quality solutions compared to standard hierarchical clustering methods.
Kernel Treeletsstat.ML
KT combines treelets with kernel functions for hierarchical clustering.
problem Hierarchical clustering of non-numeric data.
method Combines treelets and kernel functions to handle non-numeric data.
result KT effectively clusters non-numeric data.
Grinch efficiently clusters large datasets with complex structures.
problem Large-scale hierarchical clustering with complex linkage functions.
method Rotate and graft subroutines for efficient reconfiguration.
result Grinch guarantees accurate cluster trees for consistent models.
The paper tackles hierarchical clustering with structural constraints, providing approximation guarantees and improving upon current techniques.
problem Exploiting prior information in hierarchical clustering for real-world applications.
method Top-down algorithms with provable approximation guarantees, using optimization viewpoint and constraint-based regularization.
result Improved solutions for hierarchical clustering with conflicting prior information.
Proposes a hierarchical clustering method for positive and negative dissimilarities.
problem Clustering dissimilarities, especially positive and negative.
method Hierarchical correlation clustering followed by tree preserving embedding.
result Performance on various datasets.
PERCH efficiently clusters large datasets with many clusters.
problem Clustering large datasets with many clusters.
method Online hierarchical algorithm that routes new data points to tree leaves and performs tree rotations for enhanced purity and balancedness.
result PERCH constructs more accurate trees than other algorithms and scales well with both N and K.
Unified clustering comparison framework for overlapping and hierarchical structures.
problem Critical biases in existing clustering comparison measures.
method Element-centric framework comparing relationships induced by cluster structure.
result Framework does not suffer from biases and provides unique insights.
Data aggregation improves HAC for resource-constrained systems.
problem Resource constraints in embedded systems limit HAC's applicability.
method Data aggregation with BETULA algorithm reduces memory and runtime requirements.
result HAC can be applied to large datasets on resource-constrained systems.
We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based clustering, focusing on hierarchical density-based approaches. Finally we descr…
Posterior regularization enhances Bayesian hierarchical mixture clustering by improving node separation.
problem High nodal variance in BHMC trees, leading to weak separation between nodes at higher levels.
method Employing Posterior Regularization to impose max-margin constraints on nodes at every level.
result Improves cluster separation in BHMC models, enhancing overall model performance.
Fair HAC algorithms ensure clustering fairness across protected groups.
problem Ensuring clustering fairness in HAC algorithms when datasets contain biases.
method Proposes fair algorithms for HAC that enforce fairness constraints regardless of distance linkage criteria.
result Our fair HAC algorithms find fairer clusterings compared to vanilla HAC and other fair clustering approaches.
Proposes HypCSE for enhanced hierarchical clustering.
problem Challenges in existing hierarchical clustering methods.
method Hyperbolic Continuous Structural Entropy (HypCSE) neural networks.
result Superior performance on seven datasets.
A-Ward p{eta} improves hierarchical clustering with faster convergence and better recovery.
problem Hierarchical clustering's slow convergence and limited cluster variety.
method Anomalous pattern initialisation and extension of Ward and Ward p algorithms.
result A-Ward p{eta} provides better cluster recovery than Ward and Ward p.
Improves hierarchical clustering in Euclidean space using autoencoders.
problem Lack of unsupervised methods for learning hierarchical structure in Euclidean space.
method Variational autoencoder with Gaussian mixture prior, rescaling latent space, and Ward's linkage.
result Improved dendrogram purity and Moseley-Wang cost function results.
A clustering algorithm for natural hierarchical clusters with near-linear time complexity.
problem Hierarchical clustering with near-linear time complexity.
method Nearest neighbor based clustering algorithm that defines clusters naturally.
result Near-linear time and space complexity for certain datasets.
VLAC clusters data hierarchically, outperforming GMM.
problem Clustering with multiple attributes or hierarchies.
method Disentangled latent representations for hierarchical clustering.
result VLAC outperforms Gaussian Mixture Models in clustering accuracy.
The Ward error sum of squares hierarchical clustering method has been very widely used since its first description by Ward in a 1963 publication. It has also been generalized in various ways. However there are different interpretations in the literature and there are different implementations of the Ward agglomerative …
MultiDendrograms is a Java-written application that computes agglomerative hierarchical clusterings of data. Starting from a distances (or weights) matrix, MultiDendrograms is able to calculate its dendrograms using the most common agglomerative hierarchical clustering methods. The application implements a variable-gro…
Bayesian Rose Treescs.LG
Hierarchical structure is ubiquitous in data across many domains. There are many hierarchical clustering methods, frequently used by domain experts, which strive to discover this structure. However, most of these methods limit discoverable hierarchies to those with binary branching structure. This limitation, while com…
Branching embedding: A heuristic dimensionality reduction algorithm based on hierarchical clusteringstat.ML
A new algorithm BE converts dendrograms to 2D scatter plots.
problem Preserving hierarchical structures in high-dimensional data.
method Converts a dendrogram to a 2D scatter plot.
result Moderately preserves the original hierarchical structures.
This paper introduces hierarchical quasi-clustering methods, a generalization of hierarchical clustering for asymmetric networks where the output structure preserves the asymmetry of the input data. We show that this output structure is equivalent to a finite quasi-ultrametric space and study admissibility with respect…
New A* algorithm improves hierarchical clustering quality.
problem Improving hierarchical clustering quality in large search spaces.
method Combining A* search with a trellis data structure.
result Achieves higher quality results than baselines in particle physics and other benchmarks.
We introduce in this paper a new way of optimizing the natural extension of the quantization error using in k-means clustering to dissimilarity data. The proposed method is based on hierarchical clustering analysis combined with multi-level heuristic refinement. The method is computationally efficient and achieves bett…
A Group-Theoretic Approach to Computational Abstraction: Symmetry-Driven Hierarchical Clusteringcs.LG
This paper uses group theory to create data-free, feature-free clustering.
problem Creating data-free, feature-free hierarchical clustering.
method Symmetry-driven hierarchical clustering using group theory.
result A new clustering framework that is globally hierarchical and data-free.