ACM Home Page
Please provide us with feedback. Feedback
Characterizing and predicting community members from evolutionary and heterogeneous networks
Full text PdfPdf (1.23 MB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
SESSION: KM: link and graph mining table of contents
Pages 309-318  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Qiankun Zhao  AOL Lab, Beijing, China
Sourav S. Bhowmick  Nanyang Technological University, Singapore, Singapore
Xin Zheng  Tsinghua University, Beijing, China
Kai Yi  Peiking University, Beijing, China
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 27,   Downloads (12 Months): 159,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458125
What is a DOI?

ABSTRACT

Mining different types of communities from web data have attracted a lot of research efforts in recent years. However, none of the existing community mining techniques has taken into account both the dynamic as well as heterogeneous nature of web data. In this paper, we propose to characterize and predict community members from the evolution of heterogeneous web data. We first propose a general framework for analyzing the evolution of heterogeneous networks. Then, the academic network, which is extracted from 1 million computer science papers, is used as an example to illustrate the framework. Finally, two example applications of the academic network are presented. Experimental results with a real and very large heterogeneous academic network show that our proposed framework can produce good results in terms of community member recommendation. Also, novel knowledge and insights can be gained by analyzing the community evolution pattern.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L. Adamic and E. Adar. Friends and neighbors on the web. In TR HP, 2001.
2
3
 
4
A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509--512, 1999.
 
5
6
 
7
C. M. Fonseca and P. J. Fleming. Multiobjective optimization and multiple constraint handling with evolutionary algorithms - Part I: A unified formulation. In IEEE TSMC, 28(1):26--37, 1998.
8
9
10
11
12
 
13
14
15
16
 
17
 
18
19
 
20
F. Osareh. Bibliometrics, citation analysis and co-citation analysis: A review of literature I. Libri 46 (September 1996), 149--158, 1996.
21
22
 
23
W.-J. Zhou, J.-R. Wen, W.-Y. Ma, and H.-J. Zhang. A concentric model for community mining in graph structures. TR, Microsoft Research, 2002.

Collaborative Colleagues:
Qiankun Zhao: colleagues
Sourav S. Bhowmick: colleagues
Xin Zheng: colleagues
Kai Yi: colleagues