DBScholar

Back to papers

Clustering via Matrix Powering

Summary: Proposes a clustering algorithm that uses only matrix powering (viewed as random walks) to partition points from pairwise similarity matrices. Under a planted-mixture model, a single squaring suffices for provable recovery and larger exponents provably degrade performance. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1315
Venue
PODS
Year
2004
Pagerank
5.9728946e-05
Overall Rank
6,110 | 58.09%
DOI
10.1145/1055558.1055579

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhou_pods04,
        address = {New York, NY, USA},
        series = {{PODS} '04},
        title = {{Clustering via Matrix Powering}},
        url = {https://dl.acm.org/doi/10.1145/1055558.1055579},
        doi = {10.1145/1055558.1055579},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Zhou, Hanson and Woodruff, David},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,402 Approximation Algorithms for Co-Clustering 2008 PODS 5.2755515e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,119 Latent Semantic Indexing: A Probabilistic Analysis 1998 PODS 0.00012097985
Previous Page 1 / 1 Next

Semantically Similar Papers