TriTopic: Tri-Modal Graph-Based Topic Modeling with Iterative Refinement and Archetypes

• URL: http://arxiv.org/abs/2602.19079v1
• Date: Sun, 22 Feb 2026 07:29:53 GMT
• Title: TriTopic: Tri-Modal Graph-Based Topic Modeling with Iterative Refinement and Archetypes
• Abstract summary: We present TriTopic, a framework that addresses these weaknesses through a tri-modal graph fusing semantic embeddings, TF-IDF, and metadata.<n>TriTopic replaces the "average document" concept with archetype-based topic representations defined by boundary cases rather than centers alone.<n>In benchmarks across 20 Newsgroups, BBC News, AG News, and Arxiv, TriTopic achieves the highest NMI on every dataset.
• Score: 0.40611352512781873
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Topic modeling extracts latent themes from large text collections, but leading approaches like BERTopic face critical limitations: stochastic instability, loss of lexical precision ("Embedding Blur"), and reliance on a single data perspective. We present TriTopic, a framework that addresses these weaknesses through a tri-modal graph fusing semantic embeddings, TF-IDF, and metadata. Three core innovations drive its performance: hybrid graph construction via Mutual kNN and Shared Nearest Neighbors to eliminate noise and combat the curse of dimensionality; Consensus Leiden Clustering for reproducible, stable partitions; and Iterative Refinement that sharpens embeddings through dynamic centroid-pulling. TriTopic also replaces the "average document" concept with archetype-based topic representations defined by boundary cases rather than centers alone. In benchmarks across 20 Newsgroups, BBC News, AG News, and Arxiv, TriTopic achieves the highest NMI on every dataset (mean NMI 0.575 vs. 0.513 for BERTopic, 0.416 for NMF, 0.299 for LDA), guarantees 100% corpus coverage with 0% outliers, and is available as an open-source PyPI library.

Related papers

• FPicker: Topology-Guided Evolution for Filament Tracing in Low-SNR Microscopy [14.980713248913732]
  FPicker is a topology-guided framework for 3D filament tracing in Cryo-Electron Microscopy.<n>It unifies perception via a center-endpoint representation and an open-curve evolution module to explicitly model non-cyclic connectivity.<n>Its zero-shot performance on the real-world EMPIAR dataset exhibits robust topological resistance, achieving a state-of-the-art 82.9% mSAP upon fine-tuning.
  arXiv  Detail & Related papers  (2026-09-08T06:25:44Z)
• BATS: Resource-Efficient Volumetric Segmentation with Boundary-Aware Mixed-Resolution Tokens [14.29921504001782]
  We present BATS, a 3D medical image segmentation architecture that concentrates fine-resolution processing near predicted class boundaries.<n>A dense boundary predictor identifies where additional resolution is needed, while a fine-first context constructs an input-dependent mixed-resolution hierarchy.<n>Inference is up to 30% faster on KiTS and LiTS, which retain fewer tokens, but slower on the more token-dense BraTS.
  arXiv  Detail & Related papers  (2026-07-29T12:21:40Z)
• Team DACTYL at PAN 2026: Bayesian Data Mixing and Empirical X-risk Minimization for AI-text Detection [0.33842793760651557]
  Existing research shows that AI-generated text detection classifiers achieve strong in-distribution (ID) performance but do not maintain the same performance on out-of-distribution (OOD) texts.<n>We fine-tune BERT-tiny models with Bayesian classification heads to select texts across three different datasets to use as a consolidated training set.<n>Our results highlight that careful dataset curation can lead to strong OOD performance.
  arXiv  Detail & Related papers  (2026-07-19T18:48:59Z)
• Provable Sparse Inversion and Token Relabel Enhanced One-shot Federated Learning with ViTs [77.42033827176806]
  One-Shot Federated Learning, where a central server learns a global model in a single communication round, has emerged as a promising paradigm.<n>We propose a novel Federated Model Inversion and Token Relabel framework, which trains the global model by fully exploiting all patches of synthetic images.
  arXiv  Detail & Related papers  (2026-05-11T15:49:08Z)
• An Instance-Centric Panoptic Occupancy Prediction Benchmark for Autonomous Driving [25.37985701473846]
  This paper presents an instance-centric benchmark for the 3D panoptic occupancy prediction task.<n>Specifically, we introduce ADMesh, the first unified 3D mesh library tailored for autonomous driving.<n>We construct CarlaOcc, a large-scale, physically consistent panoptic occupancy dataset.
  arXiv  Detail & Related papers  (2026-03-28T11:22:31Z)
• COVTrack++: Learning Open-Vocabulary Multi-Object Tracking from Continuous Videos via a Synergistic Paradigm [59.26203051651017]
  C-TAO is the first continuously annotated training set for Open-Vocabulary Multi-Object Tracking (OVMOT)<n>For the framework bottleneck, we propose COVTrack++, a synergistic framework that achieves a bidirectional reciprocal mechanism between detection and association through three modules.<n>Experiments on TAO demonstrate state-of-the-art performance, with novel TETA reaching 35.4% and 30.5% on validation and test sets, improving novel AssocA by 4.8% and novel LocA by 5.8% over previous methods.
  arXiv  Detail & Related papers  (2026-03-25T07:20:27Z)
• From Feature Interaction to Feature Generation: A Generative Paradigm of CTR Prediction Models [81.43473418572567]
  Click-Through Rate (CTR) prediction is a core task in recommendation systems.<n>We propose a novel generative framework to address embedding dimensional collapse and information redundancy.<n>We show that SFG consistently mitigates embedding collapse and reduces information redundancy, while yielding substantial performance gains.
  arXiv  Detail & Related papers  (2025-12-16T03:17:18Z)
• Learning Hyperspectral Images with Curated Text Prompts for Efficient Multimodal Alignment [1.7188280334580195]
  We make an attempt to optimize a Vision-Language Model (VLM) for hyperspectral scene understanding by exploiting a CLIP-style contrastive training framework.<n>Our framework maps voxel-level embeddings from a vision backbone onto the latent space of a frozen large embedding model.<n>It is seen that the proposed method updates only 0.07 percent of the total parameters, yet yields state-of-the-art performance.
  arXiv  Detail & Related papers  (2025-09-20T23:23:04Z)
• Tri-Learn Graph Fusion Network for Attributed Graph Clustering [5.2044462428583875]
  This study proposes a novel deep clustering framework that comprises GCN, Autoencoder (AE), and Graph Transformer.<n>The framework enhances the differentiation and consistency of global and local information through a unique tri-learning mechanism and feature fusion strategy.<n>It surpasses many state-of-the-art methods, achieving an accuracy improvement of approximately 0.87% on the ACM dataset, 14.14 % on the Reuters dataset, and 7.58 % on the USPS dataset.
  arXiv  Detail & Related papers  (2025-07-18T03:25:07Z)
• From Codicology to Code: A Comparative Study of Transformer and YOLO-based Detectors for Layout Analysis in Historical Documents [0.0]
  This paper benchmarks five state-of-the-art object detection architectures on three annotated datasets.<n>We evaluate two Transformer-based models (Co-DETR, Grounding DINO) against three YOLO variants.<n>We conclude that a key trade-off exists between the global context awareness of Transformers, ideal for structured layouts, and the superior generalization of CNN-OBB models for visually diverse and complex documents.
  arXiv  Detail & Related papers  (2025-06-25T11:14:04Z)
• UNCA: A Neutrosophic-Based Framework for Robust Clustering and Enhanced Data Interpretation [1.2582887633807602]
  We propose a Unified Neutrosophic Clustering Algorithm (UNCA)<n>UNCA combines a multifaceted strategy with Neutrosophic logic to improve clustering accuracy.<n>UNCA outperforms conventional approaches in several metrics.
  arXiv  Detail & Related papers  (2025-02-23T14:08:59Z)
• Efficient Masked AutoEncoder for Video Object Counting and A Large-Scale Benchmark [52.339936954958034]
  The dynamic imbalance of the fore-background is a major challenge in video object counting.<n>We propose a density-embedded Efficient Masked Autoencoder Counting (E-MAC) framework in this paper.<n>In addition, we first propose a large video bird counting dataset, DroneBird, in natural scenarios for migratory bird protection.
  arXiv  Detail & Related papers  (2024-11-20T06:08:21Z)
• MMScan: A Multi-Modal 3D Scene Dataset with Hierarchical Grounded Language Annotations [55.022519020409405]
  This paper builds the first largest ever multi-modal 3D scene dataset and benchmark with hierarchical grounded language annotations, MMScan.<n>The resulting multi-modal 3D dataset encompasses 1.4M meta-annotated captions on 109k objects and 7.7k regions as well as over 3.04M diverse samples for 3D visual grounding and question-answering benchmarks.
  arXiv  Detail & Related papers  (2024-06-13T17:59:30Z)
• Federated Learning Resilient to Byzantine Attacks and Data Heterogeneity [59.17297282373628]
  This paper addresses Gradient learning (FL) in the context of malicious attacks on data.<n>We introduce a novel Average Robust Algorithm (RAGA) which uses the median for both convergence analysis and loss functions.
  arXiv  Detail & Related papers  (2024-03-20T08:15:08Z)
• Temporal Action Localization with Enhanced Instant Discriminability [66.76095239972094]
  Temporal action detection (TAD) aims to detect all action boundaries and their corresponding categories in an untrimmed video. We propose a one-stage framework named TriDet to resolve imprecise predictions of action boundaries by existing methods. Experimental results demonstrate the robustness of TriDet and its state-of-the-art performance on multiple TAD datasets.
  arXiv  Detail & Related papers  (2023-09-11T16:17:50Z)
• Multi-View Clustering via Semi-non-negative Tensor Factorization [120.87318230985653]
  We develop a novel multi-view clustering based on semi-non-negative tensor factorization (Semi-NTF) Our model directly considers the between-view relationship and exploits the between-view complementary information. In addition, we provide an optimization algorithm for the proposed method and prove mathematically that the algorithm always converges to the stationary KKT point.
  arXiv  Detail & Related papers  (2023-03-29T14:54:19Z)
• An Efficient Multi-Scale Fusion Network for 3D Organ at Risk (OAR) Segmentation [2.6770199357488242]
  We propose a new OAR segmentation framework called OARFocalFuseNet. It fuses multi-scale features and employs focal modulation for capturing global-local context across multiple scales. Our best performing method (OARFocalFuseNet) obtained a dice coefficient of 0.7995 and hausdorff distance of 5.1435 on OpenKBP datasets.
  arXiv  Detail & Related papers  (2022-08-15T19:40:18Z)

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.