NDLI: BibClus: A Clustering Algorithm of Bibliographic Networks by Message Passing on Center Linkage Structure

Content Provider	IEEE Xplore Digital Library
Author	Xiaoran Xu Zhi-Hong Deng
Copyright Year	2011
Abstract	Multi-type objects with multi-type relations are ubiquitous in real-world networks, e.g. bibliographic networks. Such networks are also called heterogeneous information networks. However, the research on clustering for heterogeneous information networks is little. A new algorithm, called NetClus, has been proposed in recent two years. Although NetClus is applied on a heterogeneous information network with a star network schema, considering the relations between center objects and all attribute objects linking to them, it ignores the relations between center objects such as citation relations, which also contain rich information. Hence, we think the star network schema cannot be used to characterize all possible relations without integrating the linkage structure among center objects, which we call the Center Linkage Structure, and there has been no practical way good enough to solve it. In this paper, we present a novel algorithm, BibClus, for clustering heterogeneous objects with center linkage structure by taking a bibliographic information network as an example. In BibClus, we build a probabilistic model of pair wise hidden Markov random field (P-HMRF) to characterize the center linkage structure, and convert it to a factor graph. We further combine EM algorithm with factor graph theory, and design an efficient way based on message passing algorithm to inference marginal probabilities and estimate parameters at each iteration of EM. We also study how factor functions affect clustering performance with different function forms and constraints. For evaluating our proposed method, we have conducted thorough experiments on a real dataset that we had crawled from ACM Digital Library. The experimental results show that BibClus is effective and has a much higher quantity than the recently proposed algorithm, NetClus, in both recall and precision.
Starting Page	864
Ending Page	873
File Size	267523
Page Count	10
File Format	PDF
ISBN	9781457720758
ISSN	15504786
DOI	10.1109/ICDM.2011.27
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-12-11
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Couplings Message passing Clustering algorithms Probability Joints Hidden Markov models Approximation algorithms message passing heterogeneous information network clustering factor graph
Content Type	Text
Resource Type	Article

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

Evolutionary Clustering and Analysis of Bibliographic Networks

Learning Topic Models by Belief Propagation

Multilevel Parallelized Forward Algorithm for Hidden Markov Models on IBM Roadrunner Clusters

Variational message passing for joint localization and synchronization in wireless sensor networks

Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior

Message passing methods for factor graph based MIMO detection

Document summarization method based on heterogeneous graph

Entropy Message Passing

Evolutionary Clustering and Analysis of Bibliographic Networks

BibClus: A Clustering Algorithm of Bibliographic Networks by Message Passing on Center Linkage Structure

Similar Documents

Evolutionary Clustering and Analysis of Bibliographic Networks

Learning Topic Models by Belief Propagation

Multilevel Parallelized Forward Algorithm for Hidden Markov Models on IBM Roadrunner Clusters

Variational message passing for joint localization and synchronization in wireless sensor networks

Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior

Message passing methods for factor graph based MIMO detection

Document summarization method based on heterogeneous graph

Entropy Message Passing

Evolutionary Clustering and Analysis of Bibliographic Networks

BibClus: A Clustering Algorithm of Bibliographic Networks by Message Passing on Center Linkage Structure