NDLI: HICC: an entropy splitting-based framework for hierarchical co-clustering

Content Provider	Springer Nature Link
Author	Cheng, Wei Zhang, Xiang Pan, Feng Wang, Wei
Copyright Year	2015
Abstract	Two-dimensional contingency tables or co-occurrence matrices arise frequently in various important applications such as text analysis and web-log mining. As a fundamental research topic, co-clustering aims to generate a meaningful partition of the contingency table to reveal hidden relationships between rows and columns. Traditional co-clustering algorithms usually produce a predefined number of flat partition of both rows and columns, which do not reveal relationship among clusters. To address this limitation, hierarchical co-clustering algorithms have attracted a lot of research interests recently. Although successful in various applications, the existing hierarchical co-clustering algorithms are usually based on certain heuristics and do not have solid theoretical background. In this paper, we present a new co-clustering algorithm, HICC, with solid theoretical background. It simultaneously constructs a hierarchical structure of both row and column clusters, which retains sufficient mutual information between rows and columns of the contingency table. An efficient and effective greedy algorithm is developed, which grows a co-cluster hierarchy by successively performing row-wise or column-wise splits that lead to the maximal mutual information gain. Extensive experiments on both synthetic and real datasets demonstrate that our algorithm can reveal essential relationships of row (and column) clusters and has better clustering precision than existing algorithms. Moreover, the experiments on real dataset show that HICC can effectively reveal hidden relationships between rows and columns in the contingency table.
Starting Page	343
Ending Page	367
Page Count	25
File Format	PDF
ISSN	02191377
Journal	Knowledge and Information Systems
Volume Number	46
Issue Number	2
e-ISSN	02193116
Language	English
Publisher	Springer London
Publisher Date	2015-02-10
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Co-clustering Entropy Contingency table Text analysis Information Systems and Communication Service IT in Business
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Information Systems Human-Computer Interaction Hardware and Architecture Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Co-clustering of multi-view datasets

Characterizing pattern preserving clustering

Finding centroid clusterings with entropy-based criteria

Sleeved co-clustering of lagged data

Multi-step density-based clustering

MDL-based time series clustering

“Best K”: critical clustering structures in categorical datasets

Privacy-preserving clustering with distributed EM mixture modeling

Co-clustering of fuzzy lagged data

HICC: an entropy splitting-based framework for hierarchical co-clustering

Similar Documents

Co-clustering of multi-view datasets

Characterizing pattern preserving clustering

Finding centroid clusterings with entropy-based criteria

Sleeved co-clustering of lagged data

Multi-step density-based clustering

MDL-based time series clustering

“Best K”: critical clustering structures in categorical datasets

Privacy-preserving clustering with distributed EM mixture modeling

Co-clustering of fuzzy lagged data

HICC: an entropy splitting-based framework for hierarchical co-clustering