- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The manuscript proposes EAA (evidence-adaptive acquisition), a fully unsupervised framework for acquisition-aware incomplete multi-view clustering. It first evaluates whether the available observations in each view are sufficient to support reliable entry-level probabilistic modeling. Then it quantifies the acquisition value of each missing entry through its conditional information gain. The paper expect that EAA work well under a strict acquisition budget.
Critical strengths
It seems that several methods are compared by experiments.
Critical weaknesses
The manuscript has the following drawbacks. The method requires known ground-truth cluster number K. Actually, in the practical applications, K is almost always unknown. Moreover, for clustering algorithms, it is basic that K is unknown. If this is not obeyed and ignored, the algorithm is indeed unacceptable. Under the condition that K is known the experimental evaluation is unfair. 2. It also assumes that the acquired observations are noisefree. 3. Feature type must be given. In summary these drawbacks are serious and the corresponding assumptions are very improperly and even violates basic principles. In addition, it is claimed that the authors used generative AI tools to assist with code implementation, manuscript language editing and polishing, and table formatting. In my opinion, the reliance on the AI tools is too much.
Questions for authors
I hope that the authors comply by basic and important points. And my following concers are also provided for you: if limited budgets for clustering are significant and is a serious academic toptic, more informative analyses and demonstrations should be offered. Moreover, more convincing evidences to support the conclusions of the paper are expected.
3 comments
Acquisition Noise, Feature Types, and AI Use
Q2. Noisy acquisitions
Response. The main experiments simulate acquisition by revealing the original feature values hidden by the observation mask. To examine additional measurement error, we added zero-mean Gaussian noise to newly acquired features. For each feature, the noise standard deviation is times the standard deviation of its initially observed values, with .
For a given seed, the same candidate entry has the same noisy feature values across policies. Once acquired, these noisy features are used in subsequent model updates, acquisition decisions, and final clustering. We use a 50% initial missing rate and a budget equal to 30% of the initially missing entries, allocated over three rounds. Each setting is evaluated over five seeds.
We compare EAA with Random, View-rate, and Uncertainty on Mfeat, COIL20, Caltech101-20, and scene15.
Table R3.2. Clustering performance with noisy acquisitions
NMI (%), reported as mean sample standard deviation over five fixed seeds. Bold indicates the highest mean NMI in each row.
\hline \text{Dataset}&\sigma&\text{EAA}&\text{Random}&\text{View-rate}&\text{Uncertainty}\\\\ \hline \text{Mfeat}&0.00&\mathbf{87.29\pm0.61}&84.24\pm1.39&85.46\pm1.20&84.92\pm0.88\\\\ &0.05&\mathbf{86.70\pm1.11}&84.96\pm0.39&85.62\pm1.25&83.90\pm0.80\\\\ &0.10&\mathbf{86.83\pm1.08}&84.83\pm2.05&85.00\pm0.96&84.57\pm0.43\\\\ &0.20&\mathbf{86.63\pm1.38}&84.53\pm1.39&84.84\pm0.81&84.39\pm0.55\\\\ \text{COIL20}&0.00&\mathbf{83.43\pm0.85}&81.29\pm0.84&81.54\pm0.39&82.38\pm0.44\\\\ &0.05&\mathbf{83.64\pm1.17}&81.03\pm1.11&81.32\pm0.52&82.39\pm0.47\\\\ &0.10&\mathbf{83.40\pm0.78}&81.54\pm0.60&81.29\pm0.35&82.35\pm0.42\\\\ &0.20&\mathbf{83.67\pm1.33}&81.80\pm0.63&81.70\pm0.54&82.22\pm0.34\\\\ \text{Caltech101-20}&0.00&\mathbf{59.12\pm0.97}&56.70\pm0.56&56.42\pm1.44&55.90\pm0.52\\\\ &0.05&\mathbf{58.66\pm0.72}&56.11\pm1.38&56.33\pm1.53&55.54\pm1.06\\\\ &0.10&\mathbf{58.43\pm1.07}&55.96\pm0.68&55.77\pm1.84&56.05\pm0.72\\\\ &0.20&\mathbf{58.85\pm0.98}&56.71\pm0.95&56.03\pm1.61&56.39\pm0.96\\\\ \text{scene15}&0.00&\mathbf{42.08\pm0.43}&38.92\pm0.81&38.23\pm1.81&37.86\pm0.58\\\\ &0.05&\mathbf{41.62\pm0.70}&38.57\pm1.58&38.25\pm0.88&37.90\pm0.61\\\\ &0.10&\mathbf{41.69\pm0.61}&38.61\pm0.81&38.06\pm1.29&37.82\pm0.66\\\\ &0.20&\mathbf{41.37\pm1.01}&38.25\pm1.03&38.57\pm0.71&37.73\pm0.51\\\\ \hline \end{array}$$ EAA has the highest mean NMI among the four acquisition policies in all 16 dataset–noise settings. Across the tested noise levels, its NMI ranges from 86.63% to 87.29% on Mfeat, 83.40% to 83.67% on COIL20, 58.43% to 59.12% on Caltech101-20, and 41.37% to 42.08% on scene15. These results support the effectiveness of EAA under the tested levels of acquisition noise on these four datasets. Q3. Feature-type information Response. We thank the reviewer for raising this concern. In multi-view clustering, the feature representation of each view is part of the problem input. In our experiments, the compared methods operate on the same feature representations. EAA uses known properties of these representations, obtained from the feature-construction process, to specify the observation model for acquisition scoring. This model choice makes the representation assumptions explicit and does not require additional class annotations or access to evaluation scores. Our focus is how to allocate a limited acquisition budget across missing sample–view pairs given these feature representations. The observation models allow EAA to evaluate potential acquisitions, while the observed data determine their acquisition priorities. The required type information concerns how the features are represented and modeled; it supplies no supervision about sample class membership. We will clarify its source and role in the revised manuscript. Q4. AI assistance Response. We have disclosed our use of generative AI to assist with code implementation, language editing and polishing, and table formatting in the paper’s AI use statement. The authors are responsible for reviewing AI-assisted outputs and take responsibility for the methods, implementation, experimental results, and conclusions reported in the paper.Thank you again for your time and careful review. We would be grateful for your feedback on whether our explanations have clarified the points you raised and if any concerns remain. We would be happy to provide further clarification.
Assumption of a Known K
Dear Reviewer EhxX,
Thank you for your careful review and suggestions.
Q1. Number of clusters
Response. We thank the reviewer for raising this important concern. We acknowledge that the number of clusters is generally unknown in real-world applications, and estimating the cluster number is indeed an important issue in clustering.
However, we would like to clarify that the primary objective of this work is to investigate budget-constrained multi-view clustering, particularly how to effectively select informative view-instance pairs under a limited acquisition budget, rather than to address the additional problem of automatically estimating the number of clusters. Therefore, we treat the number of clusters K as a given task parameter to focus on the central research problem of budget-aware view acquisition.
Furthermore, using the ground-truth cluster number as the input K is a commonly adopted experimental protocol in clustering research. More importantly, all compared methods are evaluated under the same setting, ensuring a consistent basis for performance comparison. Although this setting does not fully reflect scenarios where the cluster number is completely unknown, it does not invalidate the evaluation of the proposed budget-constrained acquisition strategy.
We agree that extending the proposed framework to automatically estimate K would further improve its applicability to real-world scenarios. However, this involves an additional research problem beyond the primary scope of this work. We will clarify the assumption and its implications in the revised manuscript and explicitly acknowledge unknown cluster-number estimation as an important direction for future research.
To examine sensitivity to a misspecified cluster count, we evaluated EAA on Mfeat, COIL20, Caltech101-20, and scene15 with K set to approximately 0.75, 1.00, and 1.25 times the ground-truth class count, rounded to the nearest integer. The acquisition model and final clustering use the same working K within each setting. The initial missing rate is 50%, and the acquisition budget is 30% of the initially missing entries, allocated over three rounds; all other experimental conditions are held fixed.
Table R3.1. Sensitivity to the working number of clusters
NMI (%), reported as mean ± sample standard deviation over five fixed seeds. The ground-truth class counts are 10, 20, 20, and 15 for Mfeat, COIL20, Caltech101-20, and scene15, respectively.
\hline \text{Dataset}&K\\ \text{(low/base/high)}&\text{Lower }K&\text{Original }K&\text{Higher }K\\\\ \hline \text{Mfeat}&8/10/13&85.63\pm0.56&87.29\pm0.61&83.10\pm1.18\\\\ \text{COIL20}&15/20/25&80.01\pm0.98&83.43\pm0.85&79.40\pm0.55\\\\ \text{Caltech101-20}&15/20/25&58.37\pm1.52&59.12\pm0.97&59.71\pm0.76\\\\ \text{scene15}&11/15/19&42.49\pm1.04&42.08\pm0.43&42.08\pm0.79\\\\ \hline \end{array}$$ Across the tested cluster counts, EAA achieves NMI values of 83.10–87.29% on Mfeat, 79.40–83.43% on COIL20, 58.37–59.71% on Caltech101-20, and 42.08–42.49% on scene15. Caltech101-20 and scene15 show relatively small changes, while Mfeat and COIL20 have maximum decreases of 4.20 and 4.03 percentage points from their respective ground-truth-K settings. These results indicate a degree of tolerance to moderate changes in $K$ on these four datasets, with the extent varying by dataset.