Overview of the 2003 KDD Cup

Authors:
Johannes Gehrke;Paul Ginsparg;Jon Kleinberg
Affiliations:
Cornell University, Ithaca, NY;Cornell University, Ithaca, NY;Cornell University, Ithaca, NY
Venue:
ACM SIGKDD Explorations Newsletter
Year:
2003

Citing 1
Cited 19

Linked

Linked

Graphs over time: densification laws, shrinking diameters and possible explanations

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Graph evolution: Densification and shrinking diameters

ACM Transactions on Knowledge Discovery from Data (TKDD)
Promoting Insight-Based Evaluation of Visualizations: From Contest to Benchmark Repository

IEEE Transactions on Visualization and Computer Graphics
Statistical properties of community structure in large social and information networks

Proceedings of the 17th international conference on World Wide Web
Using importance flooding to identify interesting networks of criminal activity

Journal of the American Society for Information Science and Technology
Kronecker Graphs: An Approach to Modeling Networks

The Journal of Machine Learning Research
Sampling community structure

Proceedings of the 19th international conference on World wide web
Estimating number of citations using author reputation

SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Expansion and search in networks

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
On the relationship between novelty and popularity of user-generated content

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Supervised random walks: predicting and recommending links in social networks

Proceedings of the fourth ACM international conference on Web search and data mining
Toward optimal vaccination strategies for probabilistic models

Proceedings of the 20th international conference companion on World wide web
Using importance flooding to identify interesting networks of criminal activity

ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
Learning models of relational stochastic processes

ECML'05 Proceedings of the 16th European conference on Machine Learning
To better stand on the shoulder of giants

Proceedings of the 12th ACM/IEEE-CS joint conference on Digital Libraries
On the Relationship between Novelty and Popularity of User-Generated Content

ACM Transactions on Intelligent Systems and Technology (TIST)
Semi-automated debugging via binary search through a process lifetime

Proceedings of the Seventh Workshop on Programming Languages and Operating Systems
Efficient Multiview Maintenance under Insertion in Huge Social Networks

ACM Transactions on the Web (TWEB)
Efficient eigen-updating for spectral graph clustering

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys the 2003 KDD Cup, a competition held in conjunction with the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) in August 2003. The competition focused on mining the complex real-life social network inherent in the e-print arXiv (arXiv.org). We describe the four KDD Cup tasks: citation prediction, download prediction, data cleaning, and an open task.