Diagonalizing Affinity Matrix to Identify Clustering Structure
Block diagonal;clustering analysis;affinity matrix
Yes
No ethics review needed.
1. How would DAM perform on datasets with complex, overlapping cluster structures or where the affinity matrix does not naturally exhibit a block-diagonal structure?
2. What is the computational complexity of DAM when applied to large-scale datasets, especially regarding time and memory usage?
1. The paper defines its focus on improving clustering by utilizing the block-diagonal structure of the affinity matrix, which aligns with established clustering challenges.
2. DAM does not rely on manual parameter tuning, which could theoretically simplify its application across datasets with consistent structures.
This paper proposes the Diagonalizing Affinity Matrix (DAM) clustering method, which reorders the affinity matrix into a block-diagonal structure using a density-based traversal algorithm. The method then identifies clusters through a split-and-refine process, purportedly optimizing the clustering structure without needing predefined parameters.
1. The approach essentially repurposes existing block-diagonal concepts with minor adaptations. Both the traversal and split-and-refine strategies lack substantial novelty, building primarily on established affinity-based clustering frameworks. This incremental improvement may not meet the expectations of a top-tier conference seeking fundamentally new insights or methodologies in clustering.
2. Despite claims of computational efficiency, the paper lacks any detailed analysis of DAM's scalability, especially for large datasets. The density-based traversal and iterative refinement are potentially computationally expensive, particularly when dealing with dense affinity matrices. This oversight raises concerns about the practical viability of DAM for large-scale applications. Many anchors based methods have achieved great progress.
3. The paper primarily compares DAM with older clustering methods (Very few papers in 2024, let alone comparative methods.), bypassing recent advances in deep clustering and self-supervised clustering techniques that have demonstrated state-of-the-art performance on high-dimensional and complex datasets. This selective benchmarking weakens the evidence for DAM's claimed superiority and raises questions about its actual competitiveness.
Yes
No ethics review needed.
See Weaknesses.
The motivation of the article is relatively easy to understand, and the paper is supported by a solid theoretical foundation.
In this work, the authors propose a clustering strategy based on an affinity matrix. This strategy uses a traversal algorithm to identify high-density clusters within a graph weighted by the affinity matrix, thereby establishing a traversal sequence. This sequence is then used to reorder the affinity matrix, revealing its inherent block-diagonal structure. Extensive experiments confirm the feasibility and effectiveness of the algorithm.
1.The writing of the article is relatively weak, especially in Section 3.2, where the logic is somewhat lacking.

2.A framework-style diagram illustrating the detailed process of the algorithm is missing and would be beneficial.

3.Since a traversal method is used to uncover the block-diagonal structure, the computational complexity is likely quite high. Please analyze the computational complexity of the proposed algorithm.

4.In the DAM model, the number of clusters is adaptively determined, making it, to some extent, a clustering algorithm for generalized category discovery. However, many comparison algorithms require the number of clusters to be predefined, which makes this comparison somewhat unfair.
Yes
No ethics review needed.
Please see the weaknesses.
The authors have done enough experiments.
This paper proposes a novel clustering method that can directly leverage the block-diagonal form of the affinity matrix to reveal the underlying clustering structure. Specially, first, they use a traversal algorithm to establish a traversal sequence based on the affinity matrix originated from data. Second, this sequence is utilized to permute the affinity matrix to uncover the block-diagonal structure. At lats, they employ a split-and-refine to detect all diagonal blocks within the permuted affinity matrix.

The main contribution of this paper is to propose a new method to detect all diagonal blocks within the matrix.
1.The motivation of this paper is not clear. It is not clear why it is necessary to use the block-diagonal structure of the affinity matrix directly to reveal the underlying clustering structure.

2.The writing of the paper needs to be improved. For example, Section 2.1 does not summarize relevant work and divided it into different categories.

3.In section 4.2 of the paper, the experimental results are only presented, but not analyzed.

4.There are also many works that directly use block-diagonal structure to achieve clustering results, such as [1,2]. It is recommended to compare these algorithms and discuss them in detail.

5.It is suggested that the authors can complete the missing experimental results in Table 1 and Table 2, which may be more convincing.

[1] One-Step Multi-View Spectral Clustering.

[2] Unified one-step multi-view spectral clustering.
Yes
No ethics review needed.
See Weaknesses.
1. Some theoretical analyses are provided.
The paper proposes a strategy for identifying cluster structures from an affinity matrix. This strategy can be divided into two steps: the first step permutes the affinity matrix to form a block-diagonal structure by a density-based traversal algorithm; the second step identifies the cluster structures in the permuted matrix through a split-and-merge approach.
1. The analysis of the algorithm's time complexity and space complexity is lacking.
2. The contribution section mentions that the strategy is "rapid," but no efficiency-related experiments are presented.
3. Although many comparison algorithms are employed, Table 1 contains numerous missing entries, making the experimental results less convincing.
4. Since deep clustering incorporates feature representation learning modules, it typically achieves better performance, especially in image applications. However, according to the tables, DAM, as a traditional algorithm, significantly outperforms various deep learning algorithms. It appears that the performance results of comparison algorithms may come from previous papers, with RGB pixels provided directly as features for algorithms like DEC, while DAM uses newly extracted features. If true, the source of performance should be noted, along with details on how the new features were extracted. More rigorously, the input for each algorithm should be standardized.
5. There is room for improvement in the paper’s writing and organization. For example, Sections 3.1 and 3.2 feel disconnected, making it difficult to understand how the former supports the latter. Additionally, the meanings of $t$, $\tau$, and $\mathcal{C}$ are somewhat confusing.
6. In the experiments, DAM's input relies on the output of BDR-B, which itself learns an approximate block-diagonal structure (not yet permuted). Therefore, I am curious how DAM would perform using Gaussian similarity as input directly, and what the results would be if BDR-B's output were paired with DAM's permutation before applying spectral clustering.
7. Since a block-diagonal structure is already obtained, directly extracting the connected components of the graph should yield cluster divisions. Hence, what is the purpose or advantage of Section 3.2? Even without permutation, Section 3.2 could still be applied, raising questions about the purpose or advantage of Section 3.1 as well.
@inproceedings{
anonymous2024diagonalizing,
title={Diagonalizing Affinity Matrix to Identify Clustering Structure},
author={Anonymous},
booktitle={Submitted to The Thirteenth International Conference on Learning Representations},
year={2024},
url={https://openreview.net/forum?id=81qyvxW9pe},
note={under review}
}
Affinity matrix-based clustering constitutes an eminent approach within the domain of data mining. Nevertheless, prior research overlooked the opportunity to directly exploit the block-diagonal structure of the affinity matrix for the purpose of identifying cluster formations. In this paper, we propose an affinity matrix-based clustering strategy, termed as DAM, which employs a traversal algorithm to discern high-density clusters within the graph weighted by the affinity matrix, thereby establishing a traversal sequence. This sequence is subsequently utilized to permute the affinity matrix, thereby revealing its intrinsic block-diagonal structure. Moreover, we introduce an innovative split-and-refine algorithm that autonomously detects all diagonal blocks within the permuted matrix, ensuring theoretical optimality in the presence of well-separated clusters. Extensive evaluations on six real-world benchmark image clustering datasets demonstrate the superiority of our method over contemporary state-of-the-art clustering techniques.
I certify that there is no URL (e.g., github page) that could be used to find authors’ identity.
I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
Block diagonal clustering analysis affinity matrix
I certify that there is no acknowledgement section in this submission for double blind review.
/pdf/9319fc72ff399fbfd32820038ee8c15a828bc94e.pdf
unsupervised, self-supervised, semi-supervised, and supervised representation learning
I understand the reciprocal reviewing requirement as described on https://iclr.cc/Conferences/2025/CallForPapers. If none of the authors are registered as a reviewer, it may result in a desk rejection at the discretion of the program chairs. To request an exception, please complete this form at https://forms.gle/Huojr6VjkFxiQsUp6.
I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2025/AuthorGuide.
Diagonalizing Affinity Matrix to Identify Clustering Structure
ICLR 2025 Conference Submission
ICLR.cc/2025/Conference/Submission