Agglomerative likelihood clustering
Lionel Yelibi, Tim Gebbie
No strong AI-core implementation/artifact signals were detected from current providers.
Abstract We consider the problem of fast time-series data clustering. Building on previous work modeling, the correlation-based Hamiltonian of spin variables we present an updated fast non-expensive agglomerative likelihood clustering algorithm (ALC). The method replaces the optimized genetic algorithm based approach (f-SPC) with an agglomerative recursive merging framework inspired by previous work in econophysics a ...
nd community detection. The method is tested on noisy synthetic correlated time-series datasets with a built-in cluster structure to demonstrate that the algorithm produces meaningful non-trivial results. We apply it to time-series datasets as large as 20 000 assets and we argue that ALC can reduce computation time costs and resource usage costs for large scale clustering for time-series applications while being serialized, and hence has no obvious parallelization requirement. The algorithm can be an effective choice for state-detection for online learning in a fast non-linear data environment, because the algorithm requires no prior information about the number of clusters.
Results & Benchmarks
No concrete benchmark grounding is available yet. Treat the page as context or an implementation starting point only.
Abstract We consider the problem of fast time-series data clustering.
Implementation Evidence Summary
Recommendation evidence is currently too limited for a maintained-repo choice. Use Implementation Status and Reproduction Path for a practical baseline plan.
Reproduction Risks
- Estimate is based on paper-only reproduction flow
Hardware Notes
Expect multi-day setup/compute for meaningful reproduction based on current guidance.
Evidence disclosure
Evidence graph: 2 refs, 1 links.
Utility signals: depth 45/100, grounding 58/100, status medium.
Implementation Status
There is no verified maintained implementation yet. Use this baseline plan to decide whether to prototype now or defer.
- No direct maintained implementation was found. Use the paper PDF and citation graph to design a baseline reproduction.
- Start from related paper: Agglomerative Fast Super-Paramagnetic Clustering.
- Start from this likely method family: Algorithm.
Reproduction readiness
Hardware requirements
- Expect multi-day setup/compute for meaningful reproduction based on current guidance.
No verified implementation available
- · No maintained repository has been identified for this paper. Check adjacent implementations or HF artifacts below.
No benchmark numbers could be verified. You will not be able to validate reproduction correctness against published numbers.
Hugging Face artifacts
No trustworthy direct or curated related Hugging Face artifacts were found yet.
Continue with targeted Hugging Face searches derived from the paper title and method context:
Tip: start with models, then check datasets/spaces if you need evaluation data or demos.
Direct artifact matches are currently sparse. Use targeted Hugging Face searches to quickly locate candidate models, datasets, and demos.
Research context
0
Citations
56
References
Tasks
Cluster analysis, Computer science, Series (stratigraphy), Hierarchical clustering, Data mining, Signal Processing, Physical Sciences
Methods
Algorithm
Domains
Artificial intelligence
Evaluation & Human Feedback Data
Open this paper in HFEPX to review benchmark signals, evaluation modes, and human-feedback protocol context.
Open in HFEPXExplore Similar Papers
Jump to Paper2Code search queries derived from this paper's research context.
Related papers
-
Search on Paper2Code
Agglomerative Fast Super-Paramagnetic Clustering (2019) Semantic similarity
-
Search on Paper2Code
Time series clustering via community detection in networks (2015) Semantic similarity
-
Search on Paper2Code
An Efficient Method for Boundary Points Detection Based on Data Expression (2019) Semantic similarity
-
Search on Paper2Code
Sparse Self-Represented Network Map: A fast representative-based clustering method for large dataset and data stream (2017) Semantic similarity
-
Search on Paper2Code
A clustering ensemble framework based on elite selection of weighted clusters (2013) Semantic similarity
-
Search on Paper2Code
A density-based noisy graph partitioning algorithm (2015) Semantic similarity
Need human evaluators for your AI research? Scale annotation with expert AI Trainers.