Graph Clustering Methods Derived from Column Subset Selection (Student Abstract)
Abstract
Spectral clustering is a powerful clustering technique. It leverages the spectral properties of graphs to partition data points into meaningful clusters. The most common criterion for evaluating multi-way spectral clustering is NCut. Column Subset Selection is an important optimization technique in the domain of feature selection and dimension reduction which aims to identify a subset of columns of a given data matrix that can be used to approximate the entire matrix. We show that column subset selection can be used to compute spectral clustering and use this to obtain new graph clustering algorithms.
Cite
Text
Mao et al. "Graph Clustering Methods Derived from Column Subset Selection (Student Abstract)." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I21.30479Markdown
[Mao et al. "Graph Clustering Methods Derived from Column Subset Selection (Student Abstract)." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/mao2024aaai-graph/) doi:10.1609/AAAI.V38I21.30479BibTeX
@inproceedings{mao2024aaai-graph,
title = {{Graph Clustering Methods Derived from Column Subset Selection (Student Abstract)}},
author = {Mao, Wei and Wan, Guihong and Schweitzer, Haim},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2024},
pages = {23573-23575},
doi = {10.1609/AAAI.V38I21.30479},
url = {https://mlanthology.org/aaai/2024/mao2024aaai-graph/}
}