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…
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.
168,694 papers · 148 categories
Trend · papers per month
48 results for “hierarchical algorithms”
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.
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.
Novel online algorithm for hierarchical imitation learning.
problem Scalability issue in reinforcement learning and options discovery.
method Online Baum-Welch algorithm for hierarchical imitation learning.
result The online algorithm outperforms the batch version in both discrete and continuous environments.
Proves EM algorithm guarantees for hierarchical imitation learning.
problem Learning hierarchical policies from expert demonstrations.
method Converts hierarchical imitation learning to latent variable model inference, analyzes EM algorithm.
result Proves EM algorithm converges to true parameter under regular conditions.
Two new Hie-TAN and Hie-TAN-Lite algorithms improve TAN for hierarchical feature spaces.
problem Learning dependencies in hierarchical feature spaces.
method Exploits hierarchical parent-child relationships as constraints to learn a dependency tree.
result Hie-TAN-Lite outperforms Hie-TAN and other methods in predictive accuracy.
Bottom-up algorithms outperform top-down in hierarchical community detection at intermediate levels.
problem Finding the optimal hierarchical community structure in networks.
method A bottom-up algorithm for hierarchical clustering of networks.
result Bottom-up algorithms achieve the information-theoretic threshold for exact recovery at intermediate levels of the hierarchy.
Branching embedding: A heuristic dimensionality reduction algorithm based on hierarchical clusteringstat.ML
This paper proposes a new dimensionality reduction algorithm named branching embedding (BE). It converts a dendrogram to a two-dimensional scatter plot, and visualizes the inherent structures of the original high-dimensional data. Since the conversion part is not computationally demanding, the BE algorithm would be ben…
The paper develops a decision support system for hierarchical text classification of conference proceedings.
problem Classifying documents with a fixed hierarchical structure of topics.
method Developed a weighted hierarchical similarity function to calculate topic relevance, using entropy of words to estimate weights.
result The weighted hierarchical similarity function improves ranking accuracy compared to other methods.
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.
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.
A new method for efficient portfolio optimization using graph structures.
problem Optimizing portfolio weights while reducing computational complexity.
method Hierarchical graph structures and Schur complement method.
result Optimal portfolio weights can be computed efficiently by inverting small submatrices.
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.
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirectedMarkov chains tomodel complex hierarchical, nestedMarkov processes. It is parameterised in a discriminative framework and has polynomial time algorit…
Conformal Prediction in Hierarchical Classification with Constrained Representation Complexitystat.ML
New algorithms for hierarchical classification using conformal prediction.
problem Valid prediction sets in hierarchical classification tasks.
method Extended split conformal prediction framework with two inference algorithms.
result Empirical evaluations show effectiveness in achieving nominal coverage.
Algorithm refines matrix ratings using hierarchical graph clustering.
problem Matrix completion with side information from social graphs.
method Hierarchical graph clustering followed by iterative refinement of matrix ratings.
result Achieves optimal sample complexity for matrix completion.
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.
An Objective for Hierarchical Clustering in Euclidean Space and its Connection to Bisecting K-meanscs.LG
Paper develops a new objective for hierarchical clustering in Euclidean space.
problem Hierarchical clustering in Euclidean space with dissimilarity scores.
method Develops a new global objective and connects it to bisecting k-means.
result Optimal 2-means solution approximates the new objective, proving bisecting k-means optimizes a natural global objective.
Bagging and boosting are proved to be the best methods of building multiple classifiers in classification combination problems. In the area of "flat clustering" problems, it is also recognized that multi-clustering methods based on boosting provide clusterings of an improved quality. In this paper, we introduce a novel…
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…
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.
Proposes EM-HRNN model for better hierarchical language representation.
problem Learning hierarchical representations in natural language processing.
method Introduces latent indicator layer and EM algorithm for training.
result EM-HRNN model outperforms other RNN-based models in document classification.
This paper improves hierarchical community detection efficiency using local structural properties.
problem Efficiency of hierarchical community detection methods in large networks.
method Use of local structural network properties as proxies to improve efficiency.
result Achieves competitive results in modularity with improved efficiency.
New algorithm B++&C improves hierarchical clustering on large deep embedding datasets.
problem Scaling up hierarchical clustering to massive datasets of deep embeddings.
method Proposes B++&C algorithm for practical hierarchical clustering, introduces B2SAT&C for theoretical approximation.
result Achieves 5%/20% improvement on MW/CKMM objectives compared to classic methods.
Paper learns latent and hierarchical structures in CDMs from data.
problem Jointly learning latent and hierarchical structures in CDMs from observed data.
method Penalized likelihood approach for selecting attributes and estimating structures; EM and latent structure recovery algorithms.
result Good performance demonstrated by simulation and real data applications.
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.
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.
Novel graph network learns hierarchical network structure.
problem Lack of information in hierarchical network topology.
method Hierarchical clustering for multiscale decomposition, graph convolutional layers.
result Competitive performance on citation network benchmark.
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 …
The impressive performance of neural networks on natural language processing tasks attributes to their ability to model complicated word and phrase compositions. To explain how the model handles semantic compositions, we study hierarchical explanation of neural network predictions. We identify non-additivity and contex…
The Baire metric induces an ultrametric on a dataset and is of linear computational complexity, contrasted with the standard quadratic time agglomerative hierarchical clustering algorithm. In this work we evaluate empirically this new approach to hierarchical clustering. We compare hierarchical clustering based on the …
We present an accelerated algorithm for hierarchical density based clustering. Our new algorithm improves upon HDBSCAN*, which itself provided a significant qualitative improvement over the popular DBSCAN algorithm. The accelerated HDBSCAN* algorithm provides comparable performance to DBSCAN, while supporting variable …
Bayesian algorithm improves word representations using semantic taxonomy.
problem Improving word representations in semantic taxonomy.
method Bayesian Hierarchical Words Representation (BHWR) learning algorithm combining Variational Bayes and semantic taxonomy modeling.
result BHWR produces better representations for rare words.
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…
Hierarchical clustering is a widely used approach for clustering datasets at multiple levels of granularity. Despite its popularity, existing algorithms such as hierarchical agglomerative clustering (HAC) are limited to the offline setting, and thus require the entire dataset to be available. This prohibits their use o…
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.
A novel hierarchical Bayesian approach to Federated Learning reduces data exposure and improves convergence rates.
problem Data privacy and convergence in Federated Learning.
method Hierarchical Bayesian modeling and block-coordinate descent optimization.
result The proposed algorithm converges to an optimal solution with a rate of and guarantees vanishing generalization error.
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.
Extends online linear regression to handle multivariate data.
problem Hierarchical forecasting with multivariate responses.
method Introduces MultiVAW, extending Vovk-Azoury-Warmuth algorithm to multivariate setting.
result Achieves logarithmic regret in time for multivariate online linear regression.
We propose an algorithm, HPREF (Hierarchical Partitioning by Repeated Features), that produces a hierarchical partition of a set of clusterings of a fixed dataset, such as sets of clusterings produced by running a clustering algorithm with a range of parameters. This gives geometric structure to such sets of clustering…
We introduce a novel algorithm of community detection that maintains dynamically a community structure of a large network that evolves with time. The algorithm maximizes the modularity index thanks to the construction of a randomized hierarchical clustering based on a Monte Carlo Markov Chain (MCMC) method. Interesting…
New MMM captures hierarchical marketing effects and sign restrictions.
problem Measuring effectiveness of marketing activities with hierarchical structure and sign constraints.
method Proposes a constrained maximum likelihood approach using Hamiltonian Monte Carlo algorithm.
result Demonstrates superior performance on real datasets compared to multi-stage methods.
New Bayesian method for joint sparse parameter inference.
problem Inference of jointly sparse parameter vectors from multiple measurements.
method Hierarchical Bayesian learning with joint sparsity-promoting priors.
result New algorithms consistently outperform existing methods in numerical experiments.
Reduces high granularity and dimensionality in hierarchical categorical variables.
problem Overfitting and estimation issues in predictive models due to high granularity and dimensionality.
method Entity embedding and top-down clustering algorithm to reduce granularity and dimensionality.
result The reduced hierarchy improves model fit and complexity balance.
This work proposes optimal decision rules for hierarchical classifiers to better align with evaluation metrics.
problem Heuristic decision rules in hierarchical classification do not align with evaluation metrics.
method Derives optimal decision rules for various prediction settings, focusing on hierarchical scores.
result Optimal decision rules enhance the performance and reliability of hierarchical classifiers.
In this paper, we consider the problem of low-rank phase retrieval whose objective is to estimate a complex low-rank matrix from magnitude-only measurements. We propose a hierarchical prior model for low-rank phase retrieval, in which a Gaussian-Wishart hierarchical prior is placed on the underlying low-rank matrix to …
Paper develops federated GLMM algorithms for analyzing hierarchical data.
problem Analyzing hierarchical data with non-independent observations in a federated setting.
method Developed two federated GLMM algorithms using Laplace and Gaussian Hermite approximations.
result Federated GLMM can handle hierarchical data and achieve comparable or superior performance.
This work analyzes Gibbs samplers for Bayesian hierarchical models without dimensionality constraints.
problem Analyzing convergence properties of Gibbs samplers for Bayesian hierarchical models.
method Using Bayesian asymptotics and total variation mixing times, the study provides dimension-free convergence results.
result Dimension-free convergence results for Gibbs samplers targeting hierarchical models under random data-generating assumptions.