Semi-Supervised Hyperbolic Hierarchical Clustering with Set-Level Structural Priors

• URL: http://arxiv.org/abs/2606.01525v1
• Date: Mon, 01 Jun 2026 01:14:00 GMT
• Title: Semi-Supervised Hyperbolic Hierarchical Clustering with Set-Level Structural Priors
• Abstract summary: Semi-supervised hierarchical clustering aims to learn a tree structure consistent with data patterns and user-provided supervision.<n>We propose a semi-supervised hyperbolic hierarchical clustering method with set-level structural priors.<n>Experiments show that the proposed method consistently improves label consistency over representative hierarchical clustering baselines.
• Score: 6.266139801172993
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Semi-supervised hierarchical clustering aims to learn a tree structure consistent with data patterns and user-provided supervision. Supervision is usually given as leaf-level relations, such as pairwise must-link/cannot-link constraints or triplet-wise must-link-before constraints. Although useful for regulating local sample relations, such supervision does not directly indicate which samples should form coherent subtrees. Consequently, the non-leaf structure of the learned tree may deviate from the hierarchical organization preferred by ground-truth labels. To address this limitation, we propose a semi-supervised hyperbolic hierarchical clustering method with set-level structural priors. The main contribution is to introduce sets as basic modeling units for hierarchy learning. Each set denotes samples expected to cohere within a subtree and is induced from leaf-level supervision together with a learned constraint-consistent similarity structure. These sets act as soft structural priors for subtree-level supervision, allowing supervision to guide non-leaf hierarchy formation beyond local leaf-level relations. Specifically, we first learn constraint-consistent embeddings to obtain a reliable set partition, then construct constraint-induced sets and estimate inter-set similarities to form set-level structural priors. Finally, these priors are incorporated into a hyperbolic hierarchy objective for continuous tree optimization. Experiments on eleven benchmark datasets and ablation studies show that the proposed method consistently improves label consistency over representative hierarchical clustering baselines while also enhancing similarity-based tree quality.

Related papers

• SPARROW: Scalable Taxonomy Induction via Structure-Preserving Partitioning and Constraint-Guided Merging [16.319023057139173]
  Recent methods can induce directly from flat term lists, avoiding the need for corpora, but degrade sharply as concept sets scale up.<n>We propose SPARROW, a scalable taxonomy induction framework that combines structure-preserving spectral partitioning to retain hierarchical connectivity within each block.<n> Experiments on large-scale benchmarks show that SPARROW consistently achieves the strongest global structural quality across backbones.
  arXiv  Detail & Related papers  (2026-09-07T10:23:09Z)
• Learning Auditable Classifier Models: Source-Disjoint Tree Ensembles [0.0]
  Predictive models in clinical and regulated settings must be accurate and fully auditable.<n>We introduce Residual Pattern Tree Ensemble (RPTE), a three-stage learning approach.<n>RPTE builds on three key principles: bounded feature budget, source disjointness, and separate coefficient estimation.
  arXiv  Detail & Related papers  (2026-08-16T12:56:49Z)
• Trajectory Forcing: Structure-First Generation with Controllable Semantic Trajectories [62.54876287800644]
  Diffusion and flow-based generative models produce strong images, yet their controllability remains largely endpoint-centric.<n>Recent methods have begun to exploit generation order and process decomposition to improve sample quality, but still treat intermediate states as internal computation rather than objects for interaction.<n>We propose Trajectory Forcing (TF), a trajectory-centric framework that makes the generation path explicit, semantic, and editable.
  arXiv  Detail & Related papers  (2026-06-21T14:25:50Z)
• Online Continual Learning with Dynamic Label Hierarchies [72.33335166136045]
  We introduce a new problem setting, DHOCL, where severity evolve across granularities and each sample provides supervision at a single hierarchical level.<n>In this setting, we find two fundamental issues: (i) partial supervision under mixed granularities provides only point-wise signals over an evolving path-wise hierarchy, which constrains plasticity and undermines cross-level semantic consistency.<n>We propose HALO, which adaptively combines complementary classification heads, regularized by organized learnable hierarchical prototypes, enabling rapid adaptation, hierarchical consistency, and structured knowledge consolidation as the taxonomy evolves.
  arXiv  Detail & Related papers  (2026-05-12T08:20:23Z)
• HCRE: LLM-based Hierarchical Classification for Cross-Document Relation Extraction with a Prediction-then-Verification Strategy [54.91468501159335]
  Cross-document relation extraction (RE) aims to identify relations between the head tail entities located in different documents.<n>We propose an inference strategy that improves reliability through multi-view verification at each level.
  arXiv  Detail & Related papers  (2026-04-09T07:55:27Z)
• Learning Order Forest for Qualitative-Attribute Data Clustering [52.612779710298526]
  This paper discovers a tree-like distance structure to flexibly represent the local order relationship among intra-attribute qualitative values.<n>A joint learning mechanism is proposed to iteratively obtain more appropriate tree structures and clusters.<n>Experiments demonstrate that the joint learning adapts the forest to the clustering task to yield accurate results.
  arXiv  Detail & Related papers  (2026-03-03T07:49:50Z)
• Learning Consistent Taxonomic Classification through Hierarchical Reasoning [61.372270953201955]
  We propose a two-stage, hierarchy-based reasoning framework designed to improve leaf-level accuracy and hierarchical consistency in taxonomic classification.<n>Our framework, implemented on the Qwen2.5-VL-7B model, outperforms its original 72B counterpart by over 10% in both leaf-level and hierarchical consistency accuracy.
  arXiv  Detail & Related papers  (2026-01-21T03:00:00Z)
• Hierarchical Linkage Clustering Beyond Binary Trees and Ultrametrics [11.198418635553976]
  This paper introduces the notion of a valid hierarchy and defines a partial order over the set of valid hierarchies.<n>We prove the existence of a finest valid hierarchy, that is, the hierarchy that encodes the maximum information consistent with the similarity structure of the data set.<n>We propose a simple two-step algorithm that first constructs a binary tree via a linkage method and then prunes it to enforce validity.
  arXiv  Detail & Related papers  (2025-11-22T13:20:34Z)
• LH-Mix: Local Hierarchy Correlation Guided Mixup over Hierarchical Prompt Tuning [26.98015572633289]
  Hierarchical text classification (HTC) aims to assign one or more labels in the hierarchy for each text.<n>To address this, incorporating a text-specific local hierarchy is essential.<n>We first integrate local hierarchies into a manual depth-level prompt to capture parent-child relationships.<n>We then apply Mixup to this hierarchical prompt tuning scheme to improve the latent correlation within sibling/peer relationships.
  arXiv  Detail & Related papers  (2024-12-22T10:47:18Z)
• Graph-based Time Series Clustering for End-to-End Hierarchical Forecasting [18.069747511100132]
  Relationships among time series can be exploited as inductive biases in learning effective forecasting models. We propose a graph-based methodology to unify relational and hierarchical inductive biases.
  arXiv  Detail & Related papers  (2023-05-30T16:27:25Z)
• Hierarchical clustering with dot products recovers hidden tree structure [53.68551192799585]
  In this paper we offer a new perspective on the well established agglomerative clustering algorithm, focusing on recovery of hierarchical structure. We recommend a simple variant of the standard algorithm, in which clusters are merged by maximum average dot product and not, for example, by minimum distance or within-cluster variance. We demonstrate that the tree output by this algorithm provides a bona fide estimate of generative hierarchical structure in data, under a generic probabilistic graphical model.
  arXiv  Detail & Related papers  (2023-05-24T11:05:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.