Affiliation:
1. Southwest Jiaotong University, China
2. Chengdu Neusoft University, China
3. Xihua University, China
Abstract
Co-clustering is the simultaneous clustering of the samples and attributes of a data matrix that provides deeper insight into data than traditional clustering. However, there is a lack of representation learning algorithms that serve this mechanism of co-clustering, and the current representation learning algorithms are limited to the sample perspective and lack the use of information in the attribute prespective. In order to solve this problem, in this paper, a co-representation learning model based on t-distributed stochastic neighbor embedding (ctSNE) is proposed for unsupervised co-clustering, where ctSNE makes the dataset representation outputted more discriminative of row and column clusters, i.e. co-discrimination. On the basis of tSNE retaining the sample data distribution and local data structure, the philosophy of collaboration is introduced, i.e., row and column hidden relationship information, so that the ctSNE model is equipped with co-representation learning capability, which can effectively improve the performance of co-clustering. To prove the effectiveness of the ctSNE model, several classic co-clustering algorithms are used to check the co-representation performance of ctSNE, and a novel internal index based on an internal clustering index, known as total inertia, is proposed to demonstrate the effect of co-clustering. The numerous experimental results show that ctSNE has tremendous co-representation capability and can significantly improve the performance of co-clustering algorithms.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Theoretical Computer Science
Reference44 articles.
1. Principal component analysis
2. A Cognitively Inspired Approach to Two-Way Cluster Extraction from One-Way Clustered Data
3. Motoshi Abe , Junichi Miyao , and Takio Kurita . 2021 . q-SNE: visualizing data using q-Gaussian distributed stochastic neighbor embedding . In 2020 25th International Conference on Pattern Recognition (ICPR). 1051–1058 . Motoshi Abe, Junichi Miyao, and Takio Kurita. 2021. q-SNE: visualizing data using q-Gaussian distributed stochastic neighbor embedding. In 2020 25th International Conference on Pattern Recognition (ICPR). 1051–1058.
4. A generalized maximum entropy approach to bregman co-clustering and matrix approximation
5. Yoshua Bengio , Aaron Courville , and Pascal Vincent . 2013. Representation learning: A review and new perspectives . IEEE transactions on pattern analysis and machine intelligence 35, 8( 2013 ), 1798–1828. Yoshua Bengio, Aaron Courville, and Pascal Vincent. 2013. Representation learning: A review and new perspectives. IEEE transactions on pattern analysis and machine intelligence 35, 8(2013), 1798–1828.