Research map / Learning theory and algorithms / Clustering
Maximizing Schatten-p Norm Regularization Toward Balance
Fangfang Li, Quanxue Gao, Yapeng Wang, Yu Duan, Yuzhuo Feng, Qin Li
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| maximize Schatten-p norm instead of squared Frobenius norm (ablation) | anchor graph clustering · ORL | ACC: 0.5050 -> 0.6625 | Improved |
| maximize Schatten-p norm instead of squared Frobenius norm (ablation) | anchor graph clustering · Pendigits | ACC: 0.6104 -> 0.8480 | Improved |
| maximize Schatten-p norm instead of squared Frobenius norm (ablation) | anchor graph clustering · Face-V5 | ACC: 0.6424 -> 0.9712 | Improved |
| maximize Schatten-p norm instead of squared Frobenius norm (ablation) | anchor graph clustering · ORL | normalized entropy (balance): 0.8952 -> 0.9940 | Improved |
| maximize Schatten-p norm instead of squared Frobenius norm (ablation) | anchor graph clustering · Face-V5 | normalized entropy (balance): 0.4534 -> 0.4554 | No clear effect |
| add maximized Schatten-p norm regularizer to K-Means (ablation) | K-Means · Face-V5 | ACC: 0.7248 -> 0.8804 | Improved |
| add maximized Schatten-p norm regularizer to K-Means (ablation) | K-Means · ORL | ACC: 0.5250 -> 0.5450 | No clear effect |
| add maximized Schatten-p norm regularizer to K-Means (ablation) | K-Means · ORL | normalized entropy (balance): 0.9489 -> 0.9991 | Improved |
| add maximized Schatten-p norm regularizer to K-Means (ablation) | K-Means · Pendigits | ACC: 0.6615 -> 0.7291 | Improved |
| use maximized Schatten-p norm anchor method vs best baseline | proposed method · JAFFE | ACC: 0.9671 -> 0.9671 | No clear effect |
| use maximized Schatten-p norm anchor method vs best baseline | proposed method · Pendigits | ACC: 0.8432 -> 0.8480 | No clear effect |
| use maximized Schatten-p norm anchor method vs best baseline | proposed method · AR | ACC: 0.3592 -> 0.4212 | Improved |
Closest papers by meaning
- A Unified Convex Surrogate for the Schatten-p Norm (AAAI 2017 · similarity 0.86)
- Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery (ICML 2017 · similarity 0.86)
- Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm (JMLR 2021 · similarity 0.86)
- Simultaneous Clustering and Model Selection: Algorithm, Theory and Applications (TPAMI 2017 · similarity 0.85)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.83)
- Achieving Optimal Clustering in Gaussian Mixture Models with Anisotropic Covariance Structures (NeurIPS 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
