DBconnect: Mining research community on DBLP data

Joint Ninth WebKDD and First SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis

Volumn , Issue , 2007, Pages 74-81

  Zaiane, Osmar R ^a   Chen, Jiyang ^a   Goebel, Randy ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; KNOWLEDGE REPRESENTATION; SOCIAL ASPECTS; SOFTWARE PROTOTYPING;

DBCONNECT; DBLP DATA; RELATIONSHIPS; SOCIAL NETWORKS;

DATA MINING;

EID: 43449102504     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1348549.1348558     Document Type: Conference Paper

References (25)

1. Sergey Brin and Lawrence Page. The anatomy of a large-scale hypertextual web search engine. In Seventh International World Wide Web Conference, pages 107-117, Brisbane, Australia, 1998.
2. DBLP Bibliography database. http://www.informatik.uni-trier.de/~ley/db/.
3. AnHai Doan, Raghu Ramakrishnan, Fei Chen, Pedro DeRose, Yoonkyong Lee, Robert McCann, Mayssam Sayyadian, and Warren Shen. Community information management. IEEE Data Engineering Bulletin, Special Issue on Probabilistic Databases, 29(1), 2006.
4. Michelle Girvan and M. E. J. Newman. Community structure in social and biological networks. In Proceedings of the National Academy of Science USA, 99:8271-8276, 2002.
5. Taher H. Haveliwala. Topic-sensitive pagerank. In WWW: Proceedings of the 11th international conference on World Wide Web, pages 517-526, 2002.
6. Jingrui He, Mingjing Li, Hong-Jiang Zhang, Hanghang Tong, and Changshui Zhang. Manifold-ranking based image retrieval. In MULTIMEDIA: Proceedings of the 12th annual ACM international conference on Multimedia, pages 9-16, 2004.
7. P. Holme, M. Huss, and H. Jeong. Subnetwork hierarchies of biochemical pathways. Bioinformatics, 19:532-538, 2003.
8. Glen Jeh and Jennifer Widom. Simrank: a measure of structural-context similarity. In KDD, 2002.
9. George Karypis and Vipin Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distriuted Computing, 48(1):96-129, 1998.
10. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49:291-307, 1970.
11. Stefan Klink, Patrick Reuther, Alexander Weber, Bernd Walter, and Michael Ley. Analysing social networks within bibliographical data. In DEXA, pages 234-243, 2006.
12. Michael Ley. The DBLP computer science bibliography: Evolution, research issues, perspectives. In SPIRE, pages 1-10, 2002.
13. Silvio César Cazella and Luis Otávio Campos Alvares. An architecture based on multi-agent system and data, mining for recommending research papers and researchers. In Proc. of the 18th International Conference on Software Engineering and Knowledge Engineering (SEKE), pages 67-72, 2006.
14. Mario A. Nascimento, Jörg Sander, and Jeffrey Pound. Analysis of sigmod's co-authorship graph. SIGMOD Record, 32(2):57-58, 2003.
15. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
16. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: Bringing order to the web. In Technical report, Stanford University Database Group, 1998.
17. Jia-Yu Pan, Hyung-Jeong Yang, Christos Faloutsos, and Pinar Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD, pages 653-658, 2004.
18. A. Pothen, H. Simon, and K. P. Liou. Partitioning sparse matrices with eigenvectorsof graphs. SIAM J. Matrix Anal. Appl., 11:430-452, 1990.
19. Filippo Radicchi, Claudio Castellano, Federico Cecconi, Vittorio Loreto, and Domenico Parisi. Defining and identifying communities in networks. PROC.NATL.ACAD.SCI.USA, 101:2658, 2004.
20. A. F. Smeaton, G. Keogh, C. Gurrin, K. McDonald, and T. Sodring. Analysis of papers from twenty-five years of sigir conferences: What have we been doing for the last quarter of a century. SIGIR Forum, 36(2):39-43, 2002.
21. Gilbert Strang. Introduction to linear algebra, Wellesley-Cambridge Press, 3 Edition, 1998.
22. Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, and Christos Faloutsos. Neighborhood formation and anomaly detection in bipartite graphs. In ICDM, pages 418-425, 2005.
23. Hanghang Tong, Christos Faloutsos, and Jia-Yu Pan. Fast random walk with restart and its applications. In ICDM, pages 613-622, 2006.
24. Joshua R. Tyler, Dennis M. Wilkinson, and Bernardo A. Huberman. Email as spectroscopy: automated discovery of community structure within organizations. Communities and technologies, pages 81-96, 2003.
25. S. Wasserman and K. Faust. Social network analysis: Methods and applications, Cambridge University Press, 1994.