| BibNetMiner: mining bibliographic information networks |
| Full text |
Pdf
(264 KB)
|
Source
|
International Conference on Management of Data
archive
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
table of contents
Vancouver, Canada
DEMONSTRATION SESSION: Group 3
table of contents
Pages 1341-1344
Year of Publication: 2008
ISBN:978-1-60558-102-6
|
|
Authors
|
|
Yizhou Sun
|
University of Illinois at Urbana-Champaign, Urbana, IL, USA
|
|
Tianyi Wu
|
University of Illinois at Urbana-Champaign, Urbana, IL, USA
|
|
Zhijun Yin
|
University of Illinois at Urbana-Champaign, Urbana, USA
|
|
Hong Cheng
|
University of Illinois at Urbana-Champaign, Urbana, USA
|
|
Jiawei Han
|
University of Illinois at Urbana-Champaign, Urbana, USA
|
|
Xiaoxin Yin
|
Microsoft Research, Redmond, USA
|
|
Peixiang Zhao
|
University of Illinois at Urbana-Champaign, Urbana, USA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 18, Downloads (12 Months): 167, Citation Count: 0
|
|
|
ABSTRACT
Online bibliographic databases, such as DBLP in computer science and PubMed in medical sciences, contain abundant information about research publications in different fields. Each such database forms a gigantic information network (hence called BibNet), connecting in complex ways research papers, authors, conferences/journals, and possibly citation information as well, and provides a fertile land for information network analysis. Our BibNetMiner is designed for sophisticated information network mining on such bibliographic databases. In this demo, we will take the DBLP database as an example, demonstrate several attractive functions of BibNetMiner, including clustering, ranking and profiling of conferences and authors based on the research subfields. A user-friendly, visualization-enhanced interface will be provided to facilitate interactive exploration of a bibliographic database. This project will serve as an example to demonstrate the power of links in information network mining. Since the dataset is large and the network is heterogeneous, such a study will benefit the research on the analysis of massive heterogeneous information networks.
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
|
Jure Leskovec , Jon Kleinberg , Christos Faloutsos, Graphs over time: densification laws, shrinking diameters and possible explanations, Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, August 21-24, 2005, Chicago, Illinois, USA
[doi> 10.1145/1081870.1081893]
|
| |
2
|
Tianyi Wu , Xiaolei Li , Dong Xin , Jiawei Han , Jacob Lee , Ricardo Redder, DataScope: viewing database contents in Google Maps' way, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
|
| |
3
|
|
| |
4
|
|
| |
5
|
X. Yin, J. Han, and P. S. Yu. Object distinction: Distinguishing objects with identical names by link analysis. In ICDE'07, Istanbul, Turkey, April 2007.
|
 |
6
|
|
|