Kun-Hsing Yu — accepted AI-conference papers

2025

Multi-View Unsupervised Column Subset Selection via Combinatorial Search (Student Abstract)

Guihong Wan, Ninghui Hao, Crystal Maung, Haim Schweitzer, Chen Zhao, Kun-Hsing Yu +1

AAAI 2025technical

Given a data matrix, unsupervised column subset selection refers to the problem of identifying a subset of columns that can be used to linearly approximate the original data matrix. This problem has many applications, such as feature selection and representative selection, but solving it optimally i…

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

Pass-Efficient Algorithms for Graph Spectral Clustering (Student Abstract)

Boshen Yan, Guihong Wan, Haim Schweitzer, Zoltan Maliga, Sara Khattab, Kun-Hsing Yu +2

AAAI 2024technical

Graph spectral clustering is a fundamental technique in data analysis, which utilizes eigenpairs of the Laplacian matrix to partition graph vertices into clusters. However, classical spectral clustering algorithms require eigendecomposition of the Laplacian matrix, which has cubic time complexity. I…

Cited by 0 Source ↗PDF ↗Scholar ↗