Paper Lists

All of the papers can be downloaded from ACM digital library (http://portal.acm.org/dl.cfm). You can also google the title and find the PDF files.

All of the papers are just published in the SIGKDD 2006.

1.     Estimating the Global PageRank of Web Communities, Jason Davis, Inderjit Dhillon

2.     Unsupervised Learning on K-partite Graphs, Bo Long, Xiaoyun Wu, Zhongfei Zhang, Philip S. Yu

3.     Learning to Rank Networked Entities, Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal  

4.     Center-Piece Subgraphs: Problem Definition and Fast Solutions, Hanghang Tong, Christos Faloutsos

5.     Measuring and Extracting Proximity in Networks, Yehuda Koren, Stephen North, Chris Volinsky

6.     Group Formation in Large Social Networks: Membership, Growth, and Evolution, Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, Xiangyang Lan

7.     Using Structure Indices For Efficient Approximation of Network Properties, Matthew Rattigan, Marc Maier, David Jensen

8.     NeMoFinder: Dissecting genome wide protein-protein interactions with repeated and unique network motifs, Jin Chen, Wynne Hsu, Mong Li Lee, Seekiong Ng

9.     Rank Methods for Mining Sets of Numerical Attributes, Toon Calders, Bart Goethals, Szymon Jaroszewicz

10. Mining Quantitative Correlated Patterns Using an Information-Theoretic Approach, Yiping Ke, James Cheng, Wilfred Ng

11. Discovering significant rules, Geoff Webb

12. Assessing data mining results via swap randomization, Aris Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas

13. Extracting Redundancy-Aware Top-K Patterns, Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han

14. Maximally Informative k-Itemsets and their Efficient Discovery, Arno Knobbe, Eric Ho

15. Generating Semantic Annotations for Frequent Patterns with Context Analysis, Qiaozhu Mei, Dong Xin, Hong Cheng,Jiawei Han, ChengXiang Zhai