The DOI matches its Crossref record.
Proceedings of the 3rd international workshop on Link discovery
Abstract
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). LD research studies and develops data mining techniques for extracting valuable patterns linking together seemingly unrelated items. LD, rooted in fields such as discreet 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 behaviour, 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, arising 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 modelling. 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Getoor, L., & Diehl, C. P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 973
A Method of Automated Nonparametric Content Analysis for Social Science
Hopkins, D. J., & King, G. (2010) · American Journal of Political Science · doi:10.1111/j.1540-5907.2009.00428.x · Cited by 765
Evidence for hubs in human functional brain networks
Power, J. D., Schlaggar, B. L., Lessov-Schlaggar, C. N., & Petersen, S. E. (2013) · Neuron · doi:10.1016/j.neuron.2013.07.035 · Cited by 716
The H-index of a network node and its relation to degree and coreness
Lü, L., Zhou, T., Zhang, Q.-M., & Stanley, H. E. (2016) · Nature Communications · doi:10.1038/ncomms10168 · Cited by 690
Network analysis reveals open forums and echo chambers in social media discussions of climate change
Williams, H. T. P., McMurray, J. R., Kurz, T., & Hugo Lambert, F. (2015) · Global Environmental Change · doi:10.1016/j.gloenvcha.2015.03.006 · Cited by 631
Metadata
- Publisher
- ACM
- Published
- 2005-08-21
- OpenAlex
- W4230790955
- Cited by
- 255
- References
- 0
- Type
- paratext
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Proceedings of the 3rd international workshop on Link discovery. https://app.cochat.ai/papers/10.1145/1134271
- The paper
- Proceedings of the 3rd international workshop on Link discovery. (2005). https://doi.org/10.1145/1134271
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.