IDEALS Home University of Illinois at Urbana-Champaign logo The Alma Mater The Main Quad

Mining Hidden Community in Heterogeneous Social Networks

Show full item record

Bookmark or cite this item: http://hdl.handle.net/2142/10976

Files in this item

File Description Format
PDF Mining Hidden C ... eneous Social Networks.pdf (235KB) (no description provided) PDF
Title: Mining Hidden Community in Heterogeneous Social Networks
Author(s): Cai, Deng; Shao, Zheng; He, Xiaofei; Yan, Xifeng; Han, Jiawei
Subject(s): data mining
Abstract: Social network analysis has attracted much attention in recent years. Community mining is one of the major directions in social network analysis. Most of the existing methods on community mining assume that there is only one kind of relation in the network, and moreover, the mining results are independent of the users' needs or preferences. However, in reality, there exist multiple, heterogeneous social networks, each representing a particular kind of relationship, and each kind of relationship may play a distinct role in a particular task. Thus mining networks by assuming only one kind of relation may miss a lot of valuable hidden community information and may not be adaptable to the diverse information needs from different users. In this paper, we systematically analyze the problem of mining hidden communities on heterogeneous social networks. Based on the observation that different relations have different importance with respect to a certain query, we propose a new method for learning an optimal linear combination of these relations which can best meet the user's expectation. With the obtained relation, better performance can be achieved for community mining. Our approach to social network analysis and community mining represents a major shift in methodology from the traditional one, a shift from single-network, user-independent analysis to multi-network, user-dependant, and query-based analysis. Experimental results on Iris data set and DBLP data set demonstrate the effectiveness of our method.
Issue Date: 2005-03
Genre: Technical Report
Type: Text
URI: http://hdl.handle.net/2142/10976
Other Identifier(s): UIUCDCS-R-2005-2538
Rights Information: You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS: 2009-04-17
 

This item appears in the following Collection(s)

Show full item record

Item Statistics

  • Total Downloads: 830
  • Downloads this Month: 30
  • Downloads Today: 0

Browse

My Account

Information

Access Key