Call for papers (expired)
on the following topics was
open until May 31, 2004.
Link Analysis and Link Discovery
has been developed over the past 20 years in
various fields including Discrete Mathematics (Graph
Theory), Social Sciences (Social Network Analysis) and
Computer Science (graph as a data structure). Recently this
area has attracted a wider attention for its applicability
in law enforcement investigations (e.g., terrorism), fraud
detection (e.g., insurance, banking), WWW analysis (e.g.,
search engines, marketing), telecommunications (e.g.,
routers, traffic, connectivity), and similar.
Particular topics of interest for the workshop include but are not limited to:
The workshop consists of invited talk,
presentation of refereed papers,
and discussions.
We hope that the program will stimulate future
collaboration among researchers.
SESSION I | |
8:30
- 8:45
|
Introductory Remarks |
8:45
- 9:05
|
Compressing
Network Graphs Anna C. Gilbert and Kirill Levchenko |
9:05
- 9:25
|
Measuring
Confidence Intervals in Link Discovery: A Bootstrap Approach Jafar Adibi, Clayton M. Morrison and Paul R. Cohen |
9:25
- 9:55
|
Semisupervised
Learning on Small Worlds Rosie Jones |
10:00
- 10:30
|
Break |
10:30
- 10:50
|
An
Exploration of Entity Models, Collective Classification and Relation
Description Hema Raghavan, James Allan and Andrew McCallum |
10:50
- 11:10
|
Graph-based
Data Mining on Social Networks Maitrayee Mukherjee, and Lawrence B. Holder |
11:10
- 11:30
|
Extracting
Social Networks from Instant Messaging Populations John Resig, Santosh Dawara, Christopher M. Homan, and Ankur Teredesai |
11:30
- 11:50
|
Issues
of Verification for Unsupervised Discovery Systems Shou-de Lin and Hans Chalupsky |
SESSION
II
|
|
1:15
- 2:00
|
Keynote
Speaker Christos Falotsous , CMU |
2:10
- 2:30
|
Deduplication
and Group Detection using Links Indrajit Bhattacharya and Lise Getoor |
2:30
- 2:50
|
Multi-Hypothesis
Abductive Reasoning for Link Discovery Nicholas J. Pioch, Daniel Hunter, James V. White, Amy Kao, Daniel Bostwick and Eric K. Jones |
3:00
- 3:30
|
Break |
3:30
- 3:50
|
Learning
Sub-structures of Document Semantic Graphs for Document Summarization
Jure Leskovec, Marko Grobelnik, Natasa Milic-Frayling |
3:50
- 4:10
|
Path
Analysis for Refining Verb Relations Timothy Chklovski and Patrick Pantel |
4:10
- 4:30
|
Discovering
links between lexical and surface features in questions and answers
Soumen Chakrabarti |
4:30
- 4:45
|
Conclusion Remarks |
Attendance is not limited to the paper authors.
We strongly encourage interested researchers from related
areas to attend the workshop.
The workshop should be of interest to researchers and
practitioners conducting research or building applications
that involve various data analysis and rich data and
knowledge representations, in particular, those from:
Academic Data Mining (analytical aspects of dealing with
link structures), Commercial Data Mining (new application areas),
Social Networks Analysis (algorithmic aspects of dealing
with large network structures),
Relational Data Mining/Association Rules (alternative
representations and dealing with the data),
Natural Language Processing/Text Mining (representational aspects).
We expect that the workshop topics will attract attention of
regular KDD attendees who are interested in
Data Mining, Machine Learning, and Natural Language
Processing but also potentially encourage the attendance of KDD by
participants interested in Social Network Analysis who would
otherwise not choose to come to the conference.
Jafar Adibi
Information Sciences Institute, University of Southern California,
4676 Admiralty Way Suit 1001, Marina del Rey, CA 90292
Hans Chalupsky
Information Sciences Institute, University of Southern California,
4676 Admiralty Way Suit 1001, Marina del Rey, CA 90292
Marko Grobelnik
J.Stefan Institute, Jamova 39, 1000 Ljubljana, Slovenia
Natasa
Milic-Frayling
Microsoft Research Ltd, 7 J J Thomson Avenue, Cambridge, CB3 0FB, United Kingdom
Dunja Mladenic
J.Stefan Institute, Jamova 39, 1000 Ljubljana, Slovenia
Program Committee
We feel that the continuity of meeting and exchanging ideas is essential for effective promotion and development of this research area.