 |
Workshop on Link Discovery: Issues, Approaches
and Applications (LinkKDD-2005)
August 21, 2005 - Chicago, IL, USA
To be held in conjunction with ACM SIGKDD-2005
August 21-25, 2005 - Chicago, IL, USA
WORKSHOP DESCRIPTION
-------------------------------------
The LinkKDD-2005 workshop aims to bring together a diverse group
of researchers and industry practitioners to advance the state
of the art in link discovery. Recently, there has been
increasing interest in developing information technology for
Link Discovery. LD research studies and develops data mining
techniques for extracting valuable patterns linking together
seemingly unrelated items. LD, rooted in fields such as discrete
mathematics, graph theory, social science, pattern analysis,
link analysis and spatial databases, is relevant to a wide range
of research topics that have been developed in past decades.
Successful LD systems will discover the hidden structure of
organizations, relate groups, identify fraudulent behavior,
model group activity and provide early detection of emerging
threats. The broader context of this workshop invites both
theoretical and applied contributions to LD spanning techniques
from Data Mining, Machine Learning, Information Retrieval,
Natural Language Processing, Social Networks Analysis, and
general Graph Theory.
Typical characteristics of link discovery problems are:
- Data is heterogeneous, arriving from multiple sources;
- Data and patterns sought include representations of
people, organizations, objects, actions and events, each of
which has its own set of attributes, and particular types of
relations linking them;
- The structure may include temporal, spatial,
organizational, and/or transactional patterns;
- A relatively low number of observations for each entity
can be recorded and the overall sample is typically small
relative to the size of the population;
- The data becomes available over time, so the timing of
when to make a decision based on the analysis is a central
issue.
LD problems are found in various areas such as homeland
security, social network analysis, fraud detection,
recommendation systems, and user modeling. The
interdisciplinary nature of link discovery promotes a
concerted effort from various researchers. The purpose of
this workshop is to provide a forum to foster such
interactions, discuss the new achievements and identify
future research directions in link discovery.TOPICS OF INTEREST
-----------------------------------
Particular topics of interest for the workshop include but
are not limited to:
- Theoretical advances to link discovery and group detection
- Practical applications of link discovery to real world
databases
- Link-analysis and graph mining
- Social network analysis and community finding
- Graph theory, scale-free networks and small world phenomenon
- Web-mining and text-mining applied to link discovery
- Link discovery for data streams and scalability of
developed approaches
- Record linkage, alias detection and object consolidation
- Visualization of link structures
- Performance evaluation measures
- Innovative applications in areas such as medical
informatics, insurance, laws enforcements and web
communities
- Link discovery and other theoretical fields such as
natural language processing, agent theory, complex systems,
trust models and dynamic pricing models
- Survey and analysis of deployed link discovery integrated
systems, commercial products, educational and commercial
packages
SUBMISSION GUIDELINES
-----------------------------------
Submissions should be sent by June 10, 2005, in electronic
form as a PDF file, to adibi@isi.edu. Please ensure you
include the following text in your email subject:
LinkKDD-2005 workshop paper submission.Submissions are limited to a maximum of 8 pages and must
follow the ACM proceedings style available at http://www.acm.org/sigs/pubs/proceed/template.html.
The reviews will not be blind so authors should include
their full contact information in the papers.
Submitted papers will be reviewed by referees from the
Program Committee. Accepted papers will be published in the
Workshop proceedings. Notification of acceptance and
rejection will be received on July 7, 2005. Authors must
present their work at the workshop.
IMPORTANT DATES
------------------------------------
Submission Deadline: June 10, 2005
Acceptance Notification: July 7, 2005
Camera-ready Copies: July 15, 2005
Workshop date: August 21, 2005
ORGANIZATION
------------------------------------
WORKSHOP CHAIRS
Jafar Adibi, USC Information Sciences Institute
Marko Grobelnik, J. Stefan Institute
Dunja Mladenic, J.Stefan Institute
Patrick Pantel, USC Information Sciences Institute
PROGRAM COMMITTEE
Lada Adamic, Hewlett Packard Laboratories
Jim Blythe, USC Information Sciences Institute
Hans Chalupsky, USC Information Sciences Institute
Tim Chklovski, USC Information Sciences Institute
Diane Cook, University of Texas at Arlington
Lise Getoor, University of Maryland
Antonio Gulli,
AskJeeves/Teoma and University of Pisa
Jiawei Han, University of Illinois at Urbana-Champaign
Larry Holder, University of Texas at Arlington
David Jensen, University of Massachusetts Amherst
George Karypis, University of Minnesota
David Kempe, University of Southern California
Filippo Menczer, Indiana University
Rada Mihalcea, University of North Texas
Natasa Milic-Frayling, Microsoft Research
Michael Mitzenmacher, Harvard University
Andrew Moore, Carnegie Mellon University
Dragomir Radev, University of Michigan
|
|
