A Survey of Co-Clustering

Author:

Wang Hongjun1ORCID,Song Yi2ORCID,Chen Wei2ORCID,Luo Zhipeng2ORCID,Li Chongshou2ORCID,Li Tianrui2ORCID

Affiliation:

1. School of Computing and Artificial Intelligence, Southwest Jiaotong University; Engineering Research Center of Sustainable Urban Intelligent Transportation, Ministry of Educationn, China

2. School of Computing and Artificial Intelligence, Southwest Jiaotong University, China

Abstract

Co-clustering is to cluster samples and features simultaneously, which can also reveal the relationship between row clusters and column clusters. Therefore, lots of scientists have drawn much attention to conduct extensive research on it, and co-clustering is widely used in recommendation systems, gene analysis, medical data analysis, natural language processing, image analysis, and social network analysis. In this paper, we survey the entire research aspect of co-clustering, especially the latest advances in co-clustering, and discover the current research challenges and future directions. First, due to different views from researchers on the definition of co-clustering, this paper summarizes the definition of co-clustering and its extended definitions, as well as related issues, based on the perspectives of various scientists. Second, existing co-clustering techniques are approximately categorized into four classes: information-theory-based, graph-theory-based, matrix-factorization-based, and other theories-based. Third, co-clustering is applied in various aspects such as recommendation systems, medical data analysis, natural language processing, image analysis, and social network analysis. Furthermore, ten popular co-clustering algorithms are empirically studied on ten benchmark datasets with four metrics - accuracy, purity, block discriminant index, and running time; and their results are objectively reported. Finally, future work is provided to get insights into the research challenges of co-clustering.

Publisher

Association for Computing Machinery (ACM)

Reference160 articles.

1. Ensemble Block Co-clustering: A Unified Framework for Text Data

2. Regularized bi-directional co-clustering

3. Model-based co-clustering for the effective handling of sparse data

4. A generalized framework for Kullback–Leibler Markov aggregation;Amjad Rana Ali;IEEE Trans. Automat. Control,2019

5. Katy S Azoury and Manfred K Warmuth. 2001. Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine learning 43 (2001), 211–246.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3