KDD-Cup(数据挖掘与知识发现竞赛) 介绍

n
n
The goal – to design models to support website personalization and to improve the profitability of the site by increasing customer response. Questions - When given a set of page views,
n
ROBOCUP
n
2
About ACM KDDCUP
n n
ACM KDD: Premiere Conference in knowledge discovery and data mining ACM KDDCUP:
n
Worldwide competition in conjunction with ACM KDD conferences. showcase the best methods for discovering higher-level knowledge from data. Helping to close the gap between research and industry Stimulating further KDD research and development
Year
97 98
99 24
2000 2005 2011 30 32 1000+
4
Submissions 16 21
Algorithms (up to 2000)
5
KDD Cup 97
8
KDDCUP 1998 Results
$70,000 $65,000 $60,000 $55,000 $50,000 $45,000 $40,000 $35,000 $30,000 $25,000 $20,000 $15,000 $10,000 $5,000 $100%
Maximum Possible Profit Line ($72,776 in profits with 4,873 mailed)
10
KDDCUP 2000: Data Set and Goal:
Data collected from n , a legwear and legcare Web retailer n Pre-processed n Training set: 2 months n Test sets: one month n Data collected includes: n
11
KDDCUP 2000: The Winners
n
Question 1 & 5 Winner: Amdocs Question 2 & 3 Winner: Salford Systems Question 4 Winner: e-steam
n
n
12
KDD Cup 2001
n
3 Bioinformatics Tasks
15
2003 KDDCUP
n
Information Retrieval/ Citation Mining of Scientific research papers
n n
n
n
n
based on a very large archive of research papers First Task: predict how many citations each paper will receive during the three months leading up to the KDD 2003 conference Second Task: a citation graph of a large subset of the archive from only the LaTex sources Third Task: each paper's popularity will be estimated based on partial download logs Last Task: devise their own questions
ACM KDD Cup A Survey: 1997-2011
Qiang Yang 杨强
(partly based on Xinyue Liu’s slides @SFU, and Nathan Liu’s slides @hkust)
Hong Kong University of Science and Technology 香港科大
13
2001 Winners
n
Task 1, Thrombin:
n n
n
n
Task 2, Function: Mark-A. Krogel (University of Magdeburg).
n
Jie Cheng (Canadian Imperial Bank of Commerce). Bayesian network learner and classifier
n
Inductive Logic programming
K nearest neighbor
14
n
molecular biology : Two tasks
n
n
Winners:
n
n
Task 1: Document extraction from biological articles Task 2: Classification of proteins based on gene deletion experiments
1
About KDD Cup (1997 – 2011)
n
Competition is a strong mover for Science and Engineering:
n
ACM Programming Contest
n
World College level Programming skills World Robotics Competition
n
n
Dataset 2 is smaller and easier to understand 7 megabytes uncompressed
A total of 136 groups participated to produce a total of 200 submitted predictions over the 3 tasks: 114 for Thrombin, 41 for Function, and 45 for Localization.
Task 1: ClearForest and Celera, USA
n
Yizhar Regev and Michal Finkelstein
n
Task 2: Telstra Research Laboratories , Australia
n
Adam Kowalczyk and Bhavani Raskutti
n
Dataset 1: Prediction of Molecular Bioactivity for Drug Design
n
n
half a gigabyte when uncompressed
n
Dataset 2: Prediction of Gene/Protein Function (task 2) and Localization (task 3)
n n n
Click streams Order information
characterize heavy spenders characterize killer pages characterize which product brand a visitor will view in the remainder of the session?
ACM KDD Cup 1999
n
n
n n
URL: /users/elkan/ kdresults.html Problem To detect network intrusion and protect a computer network from unauthorized users, including perhaps insiders Data: from DoD Winners n SAS Institute Inc. with their software Enterprise Miner. n Amdocs with their Information Analysis Environment
n
Winners
n
n
n
Urban Science Applications, Inc. with their software GainSmarts. SAS Institute, Inc. with their software SAS Enterprise Miner ™ Quadstone Limited with their software Decisionhouse ™
Task 2:
n n
the genes of one particular type of organism A gene/protein can have more than one function, but only one localization.
n
Task 3, Localization: Hisashi Hayashi, Jun Sese, and Shinichi Morishita (University of Tokyo).