| CARVIEW |
Select Language
HTTP/2 200
last-modified: Fri, 23 Aug 2024 00:51:38 GMT
content-type: text/html; charset=utf-8
content-security-policy: frame-ancestors 'none'
x-cloud-trace-context: 600d7f7fdf395c84187d3b9ad6e008b9
cache-control: max-age=3600
x-frame-options: SAMEORIGIN
server: Google Frontend
via: 1.1 google, 1.1 varnish, 1.1 varnish, 1.1 varnish
accept-ranges: bytes
age: 0
date: Thu, 01 Jan 2026 20:49:26 GMT
x-served-by: cache-lga21934-LGA, cache-lga21921-LGA, cache-bom-vanm7210068-BOM
x-cache: MISS, MISS, MISS
x-timer: S1767300566.844883,VS0,VE305
content-length: 46970
[2408.12564v1] Factor Adjusted Spectral Clustering for Mixture Models
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors.
Donate
Mathematics > Statistics Theory
arXiv:2408.12564v1 (math)
[Submitted on 22 Aug 2024]
Title:Factor Adjusted Spectral Clustering for Mixture Models
View a PDF of the paper titled Factor Adjusted Spectral Clustering for Mixture Models, by Shange Tang and 1 other authors
View PDF
HTML (experimental)
Abstract:This paper studies a factor modeling-based approach for clustering high-dimensional data generated from a mixture of strongly correlated variables. Statistical modeling with correlated structures pervades modern applications in economics, finance, genomics, wireless sensing, etc., with factor modeling being one of the popular techniques for explaining the common dependence. Standard techniques for clustering high-dimensional data, e.g., naive spectral clustering, often fail to yield insightful results as their performances heavily depend on the mixture components having a weakly correlated structure. To address the clustering problem in the presence of a latent factor model, we propose the Factor Adjusted Spectral Clustering (FASC) algorithm, which uses an additional data denoising step via eliminating the factor component to cope with the data dependency. We prove this method achieves an exponentially low mislabeling rate, with respect to the signal to noise ratio under a general set of assumptions. Our assumption bridges many classical factor models in the literature, such as the pervasive factor model, the weak factor model, and the sparse factor model. The FASC algorithm is also computationally efficient, requiring only near-linear sample complexity with respect to the data dimension. We also show the applicability of the FASC algorithm with real data experiments and numerical studies, and establish that FASC provides significant results in many cases where traditional spectral clustering fails.
| Comments: | 37 pages, 8 figures, 1 table |
| Subjects: | Statistics Theory (math.ST); Methodology (stat.ME); Machine Learning (stat.ML) |
| MSC classes: | 62H30, 62H25 |
| Cite as: | arXiv:2408.12564 [math.ST] |
| (or arXiv:2408.12564v1 [math.ST] for this version) | |
| https://doi.org/10.48550/arXiv.2408.12564
arXiv-issued DOI via DataCite
|
Full-text links:
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
View a PDF of the paper titled Factor Adjusted Spectral Clustering for Mixture Models, by Shange Tang and 1 other authors
Current browse context:
math.ST
References & Citations
export BibTeX citation
Loading...
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.