6 citations · 9 across the 5 of their papers we have counts for
5 papers
Impossibility of Depth Reduction in Explainable Clustering
Chengyuan Deng, Surya Teja Gavva, Karthik C. S. +2
Over the last few years Explainable Clustering has gathered a lot of attention. Dasgupta et al. [ICML'20] initiated the study of explainable -means and -median clustering pro…
Clustering via Boundary Erosion
Cheng-Hao Deng, Wan-Lei Zhao
Clustering analysis identifies samples as groups based on either their mutual closeness or homogeneity. In order to detect clusters in arbitrary shapes, a novel and generic solutio…
Fast k-means based on KNN Graph
Cheng-Hao Deng, Wan-Lei Zhao
In the era of big data, k-means clustering has been widely adopted as a basic processing tool in various contexts. However, its computational cost could be prohibitively high as th…
Scalable Nearest Neighbor Search based on kNN Graph
Wan-Lei Zhao, Jie Yang, Cheng-Hao Deng
Nearest neighbor search is known as a challenging issue that has been studied for several decades. Recently, this issue becomes more and more imminent in viewing that the big data…
Boost K-Means
Wan-Lei Zhao, Cheng-Hao Deng, Chong-Wah Ngo
Due to its simplicity and versatility, k-means remains popular since it was proposed three decades ago. The performance of k-means has been enhanced from different perspectives ove…