- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes FUSE, an attribute-centric self-supervised representation learning framework for mixed-type tabular data clustering. The framework follows a preserve-before-unify principle to accommodate the distinct semantics of numerical, nominal, and ordinal attributes. It consists of two main components: Type-Faithful Attribute Formation (TAF), which preserves type-specific characteristics through tailored perturbation and recovery objectives, and Cross-Attribute Relational Unification (CRU), which captures dependencies among attributes through target-exclusive contextual prediction. Experiments across multiple mixed-type datasets report improvements in clustering performance compared with existing methods.
Critical strengths
The paper addresses an important challenge in clustering mixed-type tabular data by explicitly considering the distinct semantics of numerical, nominal, and ordinal attributes. The preserve-before-unify principle provides a well-motivated foundation for the proposed framework. The combination of type-specific perturbation and recovery objectives with cross-attribute contextual prediction offers a systematic approach to learning unified representations without relying on predefined instance-level similarities. Furthermore, the evaluation across diverse mixed-type datasets suggests the effectiveness and potential applicability of the proposed method.
Critical weaknesses
The novelty of the proposed framework needs further clarification, particularly regarding how the TAF and CRU modules differ from existing type-specific encoding and masked attribute prediction approaches. Although the preserve-before-unify strategy is well motivated, stronger empirical evidence is needed to demonstrate the distinct contributions of its components. Furthermore, the robustness of the learned representations under missing values, noisy attributes, and imbalanced attribute types remains unclear. A more detailed analysis of computational complexity and scalability would also help assess the practical applicability of FUSE to large-scale tabular datasets.
Questions for authors
-
How do the proposed TAF and CRU modules differ from existing type-specific encoding and masked attribute prediction methods, and what are their individual contributions to clustering performance?
-
How robust is FUSE when handling missing values, noisy attributes, or datasets with highly imbalanced proportions of numerical, nominal, and ordinal attributes?
-
How does the computational complexity of FUSE compare with existing mixed-type clustering methods, and how well does it scale to datasets with large numbers of samples and attributes?
2 comments
Follow-up on Our Responses
Dear Reviewer XqZ1,
We sincerely appreciate your positive assessment of our work.
In our rebuttal, we responded by clarifying our FUSE’s novelty and the contributions of its components (W1/Q1), extending our robustness evaluations (W2/Q2), and elaborating on computational complexity and scalability (W3/Q3).
If you have any questions or would like to discuss any of these points, we would be pleased to engage further.
Best regards,
The Authors
Additional Evidence on FUSE's Design and Robustness, with Scalability Analysis
W1/Q1 [Distinctions and Contributions of the TAF and CRU Modules]: TAF avoids homogenizing heterogeneous attributes into a unified categorical/numerical reconstruction task, instead designing type-faithful learning signals to capture numerical continuity, nominal category relationships, and ordinal ordering. Building on this, the CRU module dynamically rotates target attributes and predicts each from the remaining attributes, encouraging unified representations to capture sample-wise attribute relationships, where identical attribute values may convey different relational information across contexts. These complementary mechanisms provide richer information for mixed-type clustering.
The individual contributions of TAF and CRU are demonstrated by the ablation results (main paper, Section 4.3, Table 2). We additionally conduct comparisons with targeted design variants (see Table 1 below). Specifically, replacing TAF's type-specific corruption-recovery with uniform masking-based recovery (
Generic Recovery) degrades clustering performance, supporting the effectiveness of type-matched supervision. Applying both objectives to a shared representation (Shared-space Objectives) also reduces performance, supporting the preserve-before-unify design.DatasetHFANLDGBCMetricACCNMIARIACCNMIARIACCNMIARIACCNMIARIFUSE.7806±.0167.2297±.0326.3089±.0356.6639±.0194.3902±.0210.2347±.0229.9767±.0047.9496±.0076.9580±.0067.7593±.0123.1415±.0079.2451±.0177Generic Recovery.7659±.0165.1998±.0395.2765±.0375.4519±.0333.1621±.0123.0363±.0111.8659±.1212.8409±.0794.8179±.1349.7480±.0062.1163±.0075.2174±.0104Shared-space Objectives.7452±.0512.1865±.0477.2437±.0954.4190±.0213.1744±.0063.0243±.0060.7324±.0577.6795±.0434.6564±.0814.7502±.0027.1157±.0029.2186±.0025 Table 1. Ablations on objective design and representation-level organization.
W2/Q2 [Robustness Evaluation]: FUSE addresses imperfect inputs through type-specific perturbations and cross-attribute context. Specifically, TAF employs type-specific perturbations to simulate missing values, measurement errors, and ordinal rating errors. The resulting recovery tasks provide self-supervised learning signals while encouraging structure preservation under corruption. CRU incorporates complementary contextual information, reducing reliance on individual attributes. Consistently, FUSE shows robustness to attribute noise (main paper, Fig. 4(a)). We additionally evaluate missingness and attribute-type imbalance:
1) Missing values: We compare FUSE with SubTab, T-JEPA, and MGBCC under 5%–40% random missingness. All methods are trained on clean data and evaluated on incomplete inputs. FUSE performs best across all tested rates on CMC and DG and remains competitive on BC. Full results and robustness curves are provided in Appendix C.7 of the revised paper.
2) Imbalanced Attribute Types: FUSE's type-wise averaged recovery losses limit the dominance of majority attribute types. We further conduct a controlled experiment on synthetic data (2,000 samples, 30 attributes), varying numerical/nominal/ordinal proportions while keeping clustering information fixed. FUSE maintains 84.01%–87.15% ARI across imbalanced settings, comparable to 85.33% under balanced proportions. Under nominal dominance (1/28/1), SubTab and MGBCC drop from 44.03% to 12.03% and 70.09% to 36.38%, respectively. These findings, together with FUSE's first-place performance on ordinal-dominant DG and nominal-dominant ANL (main paper, Table 1), support its effectiveness under attribute-type imbalance.
W3/Q3 [Computational Complexity and Scalability]: Our FUSE supports scalable training without constructing pairwise relationships across all samples. CRU controls the computational cost of contextual prediction by limiting the number of target attributes selected per batch. Consequently, training complexity scales linearly with the number of samples under fixed model and training settings (main paper, Section 3). This is further supported by the near-linear runtime growth observed over 1k–60k samples (empirical exponent 0.991; main paper, Fig. 4(b)). Runtime also increases smoothly across 10–120 attributes. We have expanded the discussion of the scaling conditions and computational trade-offs in the revised paper (Section 3.4 and Appendix A).