A compressed sensing based least squares approach to semi-supervised local cluster extraction
DOI10.1007/s10915-022-02052-xarXiv2202.02904OpenAlexW4318771067MaRDI QIDQ6158985
Publication date: 20 June 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.02904
least squarescompressed sensinggraph clusteringgraph Laplaciansemi-supervised clusteringlocal clustering
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Auction dynamics: a volume constrained MBO scheme
- An effective region force for some variational models for learning and clustering
- A proof of the block model threshold conjecture
- Graph-based Natural Language Processing and Information Retrieval
- Empirical Analysis of an Evolving Social Network
- Using PageRank to Locally Partition a Graph
- Linear Inversion of Band-Limited Reflection Seismograms
- Community Detection and Stochastic Block Models
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Compressive Sensing for Cut Improvement and Local Clustering
This page was built for publication: A compressed sensing based least squares approach to semi-supervised local cluster extraction