2011 AGameTheoreticFrameworkforHeter

• (Alqadah & Bhatnagar, 2011) ⇒ Faris Alqadah, and Raj Bhatnagar. (2011). “A Game Theoretic Framework for Heterogenous Information Network Clustering.” In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2011) Journal. ISBN:978-1-4503-0813-7 doi:10.1145/2020408.2020547

Subject Headings:

Cited By

• http://scholar.google.com/scholar?q=%222011%22+A+Game+Theoretic+Framework+for+Heterogenous+Information+Network+Clustering
• http://dl.acm.org/citation.cfm?id=2020408.2020547&preflayout=flat#citedby

Quotes

Author Keywords

• Algorithms; clustering; data mining; game theoretic clustering; information networks; multi-way clustering

Abstract

Heterogeneous information networks are pervasive in applications ranging from bioinformatics to e-commerce. As a result, unsupervised learning and clustering methods pertaining to such networks have gained significant attention recently. Nodes in a heterogeneous information network are regarded as objects derived from distinct domains such as ' authors' and ' papers'. In many cases, feature sets characterizing the objects are not available, hence, clustering of the objects depends solely on the links and relationships amongst objects. Although several previous studies have addressed information network clustering, shortcomings remain. First, the definition of what constitutes an information network cluster varies drastically from study to study. Second, previous algorithms have generally focused on non-overlapping clusters, while many algorithms are also limited to specific network topologies. In this paper we introduce a game theoretic framework (GHIN) for defining and mining clusters in heterogeneous information networks. The clustering problem is modeled as a game wherein each domain represents a player and clusters are defined as the Nash equilibrium points of the game. Adopting the abstraction of Nash equilibrium points as clusters allows for flexible definition of reward functions that characterize clusters without any modification to the underlying algorithm. We prove that well-established definitions of clusters in 2-domain information networks such as formal concepts, maximal bi-cliques, and noisy binary tiles can always be represented as Nash equilibrium points. Moreover, experimental results employing a variety of reward functions and several real world information networks illustrate that the GHIN framework produces more accurate and informative clusters than the recently proposed NetClus and state of the art MDC algorithms.

References

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2011 AGameTheoreticFrameworkforHeter	Faris Alqadah Raj Bhatnagar			A Game Theoretic Framework for Heterogenous Information Network Clustering				10.1145/2020408.2020547		2011