A multiple k-means cluster ensemble framework for clustering citation trajectories

• URL: http://arxiv.org/abs/2309.04949v1
• Date: Sun, 10 Sep 2023 07:10:31 GMT
• Title: A multiple k-means cluster ensemble framework for clustering citation trajectories
• Abstract summary: This paper proposes a feature based multiple k means cluster ensemble framework. 1,95,783 and 41,732 well cited articles from the Microsoft Academic Graph data are considered. Individual trajectory differences for two different spans are studied.
• Score: 0.11951741880981505
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Citation maturity time varies for different articles. However, the impact of all articles is measured in a fixed window. Clustering their citation trajectories helps understand the knowledge diffusion process and reveals that not all articles gain immediate success after publication. Moreover, clustering trajectories is necessary for paper impact recommendation algorithms. It is a challenging problem because citation time series exhibit significant variability due to non linear and non stationary characteristics. Prior works propose a set of arbitrary thresholds and a fixed rule based approach. All methods are primarily parameter dependent. Consequently, it leads to inconsistencies while defining similar trajectories and ambiguities regarding their specific number. Most studies only capture extreme trajectories. Thus, a generalised clustering framework is required. This paper proposes a feature based multiple k means cluster ensemble framework. 1,95,783 and 41,732 well cited articles from the Microsoft Academic Graph data are considered for clustering short term (10 year) and long term (30 year) trajectories, respectively. It has linear run time. Four distinct trajectories are obtained Early Rise Rapid Decline (2.2%), Early Rise Slow Decline (45%), Delayed Rise No Decline (53%), and Delayed Rise Slow Decline (0.8%). Individual trajectory differences for two different spans are studied. Most papers exhibit Early Rise Slow Decline and Delayed Rise No Decline patterns. The growth and decay times, cumulative citation distribution, and peak characteristics of individual trajectories are redefined empirically. A detailed comparative study reveals our proposed methodology can detect all distinct trajectory classes.

Related papers

• From Concentration to Differentiation and Back: Routing Effective Rank in MoE Reasoning Cohorts [61.695980784491475]
  Test-time scaling produces cohorts of reasoning rollouts, yet there is no standard label-free account of how their internal computation reorganizes as inference unfolds.<n>We introduce routing effective rank deff, the entropy-effective dimensionality of a cross-rollout graph built from MoE expert-routing similarity.
  arXiv  Detail & Related papers  (2026-09-06T05:43:22Z)
• The Horizon Gap: Planning, Memory, Execution, Training, and Evaluation for Long-Horizon LLM Agents [7.159691098846351]
  We survey 1,547 arXiv papers collected via systematic seed harvest with a disclosed 26.8% bleed filter.<n>We disambiguate three routinely conflated properties: long-horizon, long-context, and long-term memory.<n>Across all categories, we find the same pattern: outcome-only signals grow uninformative as horizons lengthen.
  arXiv  Detail & Related papers  (2026-08-07T00:19:48Z)
• Learning Gaussian Graphical Models from a Glauber Trajectory Without Mixing [13.453178572042125]
  We study the task of learning the structure of a $d$-sparse Gaussian graphical model on $n$ variables from a single trajectory of Glauber dynamics.<n>Motivated in part by this gap, we give a conditional-time algorithm that recovers the trajectory-length guarantee from a single Glauber trajectory.
  arXiv  Detail & Related papers  (2026-06-30T07:07:57Z)
• Prototype-Guided Classification Sub-Task Decoupling Framework: Enhancing Generalization and Interpretability for Multivariate Time Series [17.242128977027246]
  Time Series Classification (TSC) is a long-standing research problem that has gained increasing attention in recent years.<n>We propose PDFTime, a prototype-guided framework that reformulates time series classification as a multi-stage decision process.<n>To our knowledge, PDFTime is the first framework to reformulate time series classification as a decoupled, multi-stage similarity-based reasoning process.
  arXiv  Detail & Related papers  (2026-05-21T06:45:50Z)
• On the Role of Reasoning Patterns in the Generalization Discrepancy of Long Chain-of-Thought Supervised Fine-Tuning [63.41902113656453]
  Supervised Fine-Tuning (SFT) on long Chain-of-Thought (CoT) trajectories has become a pivotal phase in building large reasoning models.<n>We conduct a comparative study using two sources of verified CoT trajectories generated by two competing models.<n>We find that SFT on textttDeepSeek-R1-0528 data achieves remarkably lower training loss, yet exhibits significantly worse generalization performance.
  arXiv  Detail & Related papers  (2026-04-02T07:00:54Z)
• Test-Time Scaling with Diffusion Language Models via Reward-Guided Stitching [66.39914384073145]
  We propose a self-consistency framework that turns cheap diffusion-sampled reasoning into a reusable pool of step-level candidates.<n>We find that step-level recombination is most beneficial on harder problems.<n>Our training-free framework improves average accuracy by up to 2 across six math and coding tasks.
  arXiv  Detail & Related papers  (2026-02-26T11:08:39Z)
• Length-Aware Adversarial Training for Variable-Length Trajectories: Digital Twins for Mall Shopper Paths [4.841565047500658]
  We study generative modeling of emphvariable-length trajectories -- sequences of visited locations/items with associated timestamps.<n>Standard mini-batch training can be unstable when trajectory lengths are highly heterogeneous.<n>We propose bflength-aware sampling (LAS), a simple strategy that groups trajectories by length and samples batches from a single length bucket.
  arXiv  Detail & Related papers  (2026-01-04T20:52:07Z)
• Time-RA: Towards Time Series Reasoning for Anomaly with LLM Feedback [55.284574165467525]
  Time-series Reasoning for Anomaly (Time-RA) transforms classical time series anomaly detection into a generative, reasoning-intensive task.<n>Also, we introduce the first real-world multimodal benchmark dataset, RATs40K, explicitly annotated for anomaly reasoning.
  arXiv  Detail & Related papers  (2025-07-20T18:02:50Z)
• Multiple data-driven missing imputation [0.0]
  KZImputer is a novel adaptive imputation method designed for short to medium-sized missed points (gaps) (1-5 points and beyond)<n>Its core mechanism differentiates between gaps at the beginning, middle, or end of the series, applying tailored techniques at each position to optimize imputation accuracy.<n>The performance of KZImputer has been systematically evaluated against established imputation techniques, demonstrating its potential to enhance data quality for subsequent time series analysis.
  arXiv  Detail & Related papers  (2025-07-03T16:27:12Z)
• Deep Reinforcement Learning based Triggering Function for Early Classifiers of Time Series [0.5399800035598185]
  Early Classification of Time Series (ECTS) has been recognized as an important problem in many areas where decisions have to be taken soon. Numerous approaches have been proposed, based on different triggering functions, each taking into account various pieces of information related to the incoming time series. Experiments show that the system we describe, called scAlert, significantly outperforms its state-of-theart competitors.
  arXiv  Detail & Related papers  (2025-02-10T15:52:55Z)
• TimeFilter: Patch-Specific Spatial-Temporal Graph Filtration for Time Series Forecasting [87.71846357354384]
  We propose TimeFilter, a graph-based framework for adaptive and fine-grained dependency modeling. TimeFilter filters out irrelevant correlations and preserves the most critical ones through patch-specific filtering.
  arXiv  Detail & Related papers  (2025-01-22T17:40:17Z)
• Rethinking k-means from manifold learning perspective [122.38667613245151]
  We present a new clustering algorithm which directly detects clusters of data without mean estimation. Specifically, we construct distance matrix between data points by Butterworth filter. To well exploit the complementary information embedded in different views, we leverage the tensor Schatten p-norm regularization.
  arXiv  Detail & Related papers  (2023-05-12T03:01:41Z)
• Generalized Representations Learning for Time Series Classification [28.230863650758447]
  We argue that the temporal complexity attributes to the unknown latent distributions within time series classification. We present experiments on gesture recognition, speech commands recognition, wearable stress and affect detection, and sensor-based human activity recognition.
  arXiv  Detail & Related papers  (2022-09-15T03:36:31Z)
• Beyond Duplicates: Towards Understanding and Predicting Link Types in Issue Tracking Systems [8.916420423563478]
  We studied 607,208 links connecting 698,790 issues in 15 public repositories. General Relation links have a significantly higher transitivity score than Duplication and Temporal / Causal links.
  arXiv  Detail & Related papers  (2022-04-27T12:57:12Z)
• Time to Focus: A Comprehensive Benchmark Using Time Series Attribution Methods [4.9449660544238085]
  The paper focuses on time series analysis and benchmark several state-of-the-art attribution methods. The presented experiments involve gradient-based and perturbation-based attribution methods. The findings accentuate that choosing the best-suited attribution method is strongly correlated with the desired use case.
  arXiv  Detail & Related papers  (2022-02-08T10:06:13Z)
• Relieving Long-tailed Instance Segmentation via Pairwise Class Balance [85.53585498649252]
  Long-tailed instance segmentation is a challenging task due to the extreme imbalance of training samples among classes. It causes severe biases of the head classes (with majority samples) against the tailed ones. We propose a novel Pairwise Class Balance (PCB) method, built upon a confusion matrix which is updated during training to accumulate the ongoing prediction preferences.
  arXiv  Detail & Related papers  (2022-01-08T07:48:36Z)
• Anomaly Clustering: Grouping Images into Coherent Clusters of Anomaly Types [60.45942774425782]
  We introduce anomaly clustering, whose goal is to group data into coherent clusters of anomaly types. This is different from anomaly detection, whose goal is to divide anomalies from normal data. We present a simple yet effective clustering framework using a patch-based pretrained deep embeddings and off-the-shelf clustering methods.
  arXiv  Detail & Related papers  (2021-12-21T23:11:33Z)
• Uncertain Time Series Classification With Shapelet Transform [1.4467794332678539]
  Time series classification is a task that aims at classifying chronological data. We propose a new uncertain dissimilarity measure based on Euclidean distance. We then propose the uncertain shapelet transform algorithm for the classification of uncertain time series.
  arXiv  Detail & Related papers  (2021-02-03T14:46:01Z)
• Unification of HDP and LDA Models for Optimal Topic Clustering of Subject Specific Question Banks [55.41644538483948]
  An increase in the popularity of online courses would result in an increase in the number of course-related queries for academics. In order to reduce the time spent on answering each individual question, clustering them is an ideal choice. We use the Hierarchical Dirichlet Process to determine an optimal topic number input for our LDA model runs.
  arXiv  Detail & Related papers  (2020-10-04T18:21:20Z)
• Solving Long-tailed Recognition with Deep Realistic Taxonomic Classifier [68.38233199030908]
  Long-tail recognition tackles the natural non-uniformly distributed data in realworld scenarios. While moderns perform well on populated classes, its performance degrades significantly on tail classes. Deep-RTC is proposed as a new solution to the long-tail problem, combining realism with hierarchical predictions.
  arXiv  Detail & Related papers  (2020-07-20T05:57:42Z)
• Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks [91.65637773358347]
  We propose a general graph neural network framework designed specifically for multivariate time series data. Our approach automatically extracts the uni-directed relations among variables through a graph learning module. Our proposed model outperforms the state-of-the-art baseline methods on 3 of 4 benchmark datasets.
  arXiv  Detail & Related papers  (2020-05-24T04:02:18Z)
• Complexity Measures and Features for Times Series classification [0.0]
  We propose a set of characteristics capable of extracting information on the structure of the time series to face time series classification problems. The experimental results of our proposal show no statistically significant differences from the second and third best models of the state-of-the-art.
  arXiv  Detail & Related papers  (2020-02-27T11:08:08Z)

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.