Compressive Sensing for Cut Improvement and Local Clustering
From MaRDI portal
Publication:5027032
DOI10.1137/19M1265971MaRDI QIDQ5027032
Publication date: 3 February 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.05780
community detectioncompressive sensinggraph Laplaciansparse solutionsemisupervised clusteringlocal clusteringcluster extractioncut improvement
Learning and adaptive systems in artificial intelligence (68T05) 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)
Related Items
On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications, A compressed sensing based least squares approach to semi-supervised local cluster extraction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Mixing local and global information for community detection in large networks
- A testing based extraction algorithm for identifying significant communities in networks
- On the spectra of general random graphs
- Random walks and local cuts in graphs
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Computing heat kernel PageRank and a local clustering algorithm
- 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
- Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Introduction to Random Graphs
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Using PageRank to Locally Partition a Graph
- Vertices of given degree in a random graph
- Community structure in social and biological networks
- Community Detection and Stochastic Block Models
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Flow-Based Algorithms for Local Graph Clustering
- Quasi‐random graphs with given degree sequences
- Compressed sensing
