Summary of A Greedy Strategy For Graph Cut, by Feiping Nie et al.
A Greedy Strategy for Graph Cutby Feiping Nie, Shenfei Pei, Zengwei Zheng, Rong Wang, Xuelong…
A Greedy Strategy for Graph Cutby Feiping Nie, Shenfei Pei, Zengwei Zheng, Rong Wang, Xuelong…
Sharper Error Bounds in Late Fusion Multi-view Clustering Using Eigenvalue Proportionby Liang Du, Henghui Jiang,…
Linear Programming based Approximation to Individually Fair k-Clustering with Outliersby Binita Maity, Shrutimoy Das, Anirban…
Analysing Public Transport User Sentiment on Low Resource Multilingual Databy Rozina L. Myoya, Vukosi Marivate,…
SKIM: Any-bit Quantization Pushing The Limits of Post-Training Quantizationby Runsheng Bai, Bo Liu, Qiang LiuFirst…
Enhancing CLIP Conceptual Embedding through Knowledge Distillationby Kuei-Chun KaoFirst submitted to arxiv on: 4 Dec…
On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-meansby Yushuai Ji, Zepeng Liu, Sheng…
An Approach Towards Learning K-means-friendly Deep Latent Representationby Debapriya RoyFirst submitted to arxiv on: 29…
K-means Derived Unsupervised Feature Selection using Improved ADMMby Ziheng Sun, Chris Ding, Jicong FanFirst submitted…
Accelerating spherical K-means clustering for large-scale sparse document databy Kazuo Aoyama, Kazumi SaitoFirst submitted to…