NDLI: Stochastic Blockmodel with Cluster Overlap, Relevance Selection, and Similarity-Based Smoothing

Content Provider	IEEE Xplore Digital Library
Author	Whang, J.J. Rai, P. Dhillon, I.S.
Copyright Year	2013
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Duke Univ., Durham, NC, USA (Rai, P.) \|\| Dept. of Comput. Sci., Univ. of Texas at Austin, Austin, TX, USA (Whang, J.J.; Dhillon, I.S.)
Abstract	Stochastic block models provide a rich, probabilistic framework for modeling relational data by expressing the objects being modeled in terms of a latent vector representation. This representation can be a latent indicator vector denoting the cluster membership (hard clustering), a vector of cluster membership probabilities (soft clustering), or more generally a real-valued vector (latent space representation). Recently, a new class of overlapping stochastic block models has been proposed where the idea is to allow the objects to have hard memberships in multiple clusters (in form of a latent binary vector). This aspect captures the properties of many real-world networks in domains such as biology and social networks where objects can simultaneously have memberships in multiple clusters owing to the multiple roles they may have. In this paper, we improve upon this model in three key ways: (1) we extend the overlapping stochastic block model to the bipartite graph case which enables us to simultaneously learn the overlapping clustering of two different sets of objects in the graph, the unipartite graph is just a special case of our model, (2) we allow objects (in either set) to not have membership in any cluster by using a relevant object selection mechanism, and (3) we make use of additionally available object features (or a kernel matrix of pair wise object similarities) to further improve the overlapping clustering performance. We do this by explicitly encouraging similar objects to have similar cluster membership vectors. Moreover, using nonparametric Bayesian prior distributions on the key model parameters, we side-step the model selection issues such as selecting the number of clusters a priori. Our model is quite general and can be applied for both overlapping clustering and link prediction tasks in unipartite and bipartite networks (directed/undirected), or for overlapping co-clustering of general binary-valued data. Experiments on synthetic and real-world datasets from biology and social networks demonstrate that our model outperforms several state-of-the-art methods.
Sponsorship	Toshiba
Starting Page	817
Ending Page	826
File Size	433381
Page Count	10
File Format	PDF
ISBN	9780769551081
ISSN	15504786
DOI	10.1109/ICDM.2013.156
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-12-07
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vectors Stochastic processes Data models Bayes methods Bipartite graph Kernel Social network services nonparametric Bayesian stochastic blockmodel overlapping clustering link prediction relevance selection
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

Stochastic Blockmodel with Cluster Overlap, Relevance Selection, and Similarity-Based Smoothing

Stochastic blockmodel with cluster overlap, relevance selection, and similarity-based smoothing.

Link prediction in social networks using Bayesian networks

Supervised Machine Learning Applied to Link Prediction in Bipartite Social Networks

TSBM: The Temporal-Spatial Bayesian Model for Location Prediction in Social Networks

Bayesian and nonparametric methods for system identification and model selection

Link Prediction for Bipartite Social Networks: The Role of Structural Holes

Graphon Estimation by Empirical Bayes Approach and Causal Discovery from Multiple Populations

Spectral clustering and the high-dimensional stochastic blockmodel.

Stochastic Blockmodel with Cluster Overlap, Relevance Selection, and Similarity-Based Smoothing

Similar Documents

Stochastic Blockmodel with Cluster Overlap, Relevance Selection, and Similarity-Based Smoothing

Stochastic blockmodel with cluster overlap, relevance selection, and similarity-based smoothing.

Link prediction in social networks using Bayesian networks

Supervised Machine Learning Applied to Link Prediction in Bipartite Social Networks

TSBM: The Temporal-Spatial Bayesian Model for Location Prediction in Social Networks

Bayesian and nonparametric methods for system identification and model selection

Link Prediction for Bipartite Social Networks: The Role of Structural Holes

Graphon Estimation by Empirical Bayes Approach and Causal Discovery from Multiple Populations

Spectral clustering and the high-dimensional stochastic blockmodel.

Stochastic Blockmodel with Cluster Overlap, Relevance Selection, and Similarity-Based Smoothing