Research map / Learning theory and algorithms / Clustering
Infinite Plaid Models for Infinite Bi-Clustering
Katsuhiko Ishiguro, Issei Sato, Masahiro Nakano, Akisato Kimura, Naonori Ueda
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 |
|---|---|---|---|
| infinite plaid model instead of fixed-K Bayesian Plaid (K=Ktrue) | Plaid model · Synth 1 | NMI: 0.848 -> 0.970 | Improved |
| infinite plaid model instead of fixed-K Bayesian Plaid (K=Ktrue) | Plaid model · Synth 2 | NMI: 0.782 -> 0.976 | Improved |
| infinite plaid model instead of fixed-K Bayesian Plaid (K=Ktrue) | Plaid model · Synth 4 | NMI: 0.975 -> 0.981 | No clear effect |
| overestimate K and Kinit as 10 | Bayesian Plaid · Synth 3 | NMI: 0.938 -> 0.660 | Hurt |
| overestimate K and Kinit as 10 | Infinite Plaid · Synth 3 | NMI: 0.973 -> 0.971 | No clear effect |
| overestimate Kinit as 10 | Infinite Plaid · Synth 1 | NMI: 0.970 -> 0.791 | Hurt |
| overestimate K and Kinit as 10 | Bayesian Plaid · Synth 4 | NMI: 0.975 -> 0.647 | Hurt |
| infinite plaid instead of Bayesian Plaid at K=10 | Plaid model · Synth 4 | distinctiveness: 0.1 -> 1.4 | Improved |
| infinite plaid instead of Bayesian Plaid at K=10 | Plaid model · Synth 3 | F-measure: 0.79 -> 0.84 | Improved |
| infinite plaid instead of Bayesian Plaid at K=10 | Plaid model · Synth 1 | F-measure: 0.94 -> 0.94 | No clear effect |
| infinite plaid instead of Bayesian Plaid | Plaid model · Enron Oct. | distinctiveness: 0.98 -> 0.96 | No clear effect |
| infinite plaid instead of Bayesian Plaid | Plaid model · Lastfm | distinctiveness: 1.3 -> 0.89 | Hurt |
Closest papers by meaning
- Optimal Bipartite Network Clustering (JMLR 2020 · similarity 0.88)
- Clustering from General Pairwise Observations with Applications to Time-varying Graphs (JMLR 2017 · similarity 0.87)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.86)
- Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability (ICML 2025 · similarity 0.85)
- Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model (ICML 2025 · similarity 0.85)
- Achieving Optimal Clustering in Gaussian Mixture Models with Anisotropic Covariance Structures (NeurIPS 2024 · similarity 0.85)
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.
