Professional Documents
Culture Documents
Qiang Yang
(partly based on Xinyue Lius slides @SFU, and Nathan Lius slides @hkust)
ROBOCUP
ACM KDD: Premiere Conference in knowledge discovery and data mining ACM KDDCUP:
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
It aims at:
Statistics
Participation in KDD Cup grew steadily Average person-hours per submission: 204
Max person-hours per submission: 910
Year Submissions
97 98 16 21
99 24
KDD Cup 97
A classification task to predict financial services industry (direct mail response) Winners
Charles Elkan, a Prof from UC-San Diego with his Boosted Naive Bayesian (BNB) Silicon Graphics, Inc with their software MineSet Urban Science Applications, Inc. with their software gain, Direct Marketing Selection System
A KDD tool that combines data access, transformation, classification, and visualization.
URL:
www.kdnuggets.com/meetings/kd d98/kdd-cup-98.html A classification task to analyze fund raising mail responses to a non-profit organization
Winners
Urban Science Applications, Inc. with their software GainSmarts. SAS Institute, Inc. with their software SAS Enterprise Miner Quadstone Limited with their software Decisionhouse
8
GainSmarts
SAS/Enterprise Miner Quadstone/Decisionhouse
URL: www.cse.ucsd.edu/users/elkan/ kdresults.html Problem To detect network intrusion and protect a computer network from unauthorized users, including perhaps insiders Data: from DoD Winners SAS Institute Inc. with their software Enterprise Miner. Amdocs with their Information Analysis Environment
10
The goal to design models to support website personalization and to improve the profitability of the site by increasing customer response.
Questions - When given
characterize heavy spenders characterize killer pages characterize which product brand a visitor will view in the remainder of the session?
11
Question 1 & 5 Winner: Amdocs Question 2 & 3 Winner: Salford Systems Question 4 Winner: esteam
12
3 Bioinformatics Tasks
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.
13
2001 Winners
Task 1, Thrombin:
Jie Cheng (Canadian Imperial Bank of Commerce). Bayesian network learner and classifier
Task 2:
the genes of one particular type of organism A gene/protein can have more than one function, but only one localization.
Task 3, Localization: Hisashi Hayashi, Jun Sese, and Shinichi Morishita (University of Tokyo).
K nearest neighbor
14
Winners:
Task 1: Document extraction from biological articles Task 2: Classification of proteins based on gene deletion experiments
Research Laboratories
Adam Kowalczyk and Bhavani Raskutti
15
2003 KDDCUP
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
16
Task 1:
Task 2:
Task 3:
Task 4:
David S. Vogel, Eric Gottschalk, and Morgan C. Wang Bernhard Pfahringer, Yan Fu (), RuiXiang Sun, Qiang Yang (), Simin He, Chunli Wang, Haipeng Wang, Shiguang Shan, Junfa Liu, Wen Gao.
18
2007
Netflix
Consumer recommendation
2008
Siemens
2009
Orange
2010
KDDCUP11 Dataset
11 years of data Rated items are Tracks Albums Artists Genres Items arranges in a taxonomy Two tasks
Track 1 Track 2 63M 296K
#ratings #items
263M 625K
#users
1M
249K
Items in a Taxonomy
Track 1 Details
Track 1 Highlights
Largest publicly available dataset Large number of items (50 times more than Netflix) Extreme rating sparsity (20 times more sparse than Netflix) Taxonomy can help in combating sparsely rated items. Fine time stamps with both date and time allow sophisticated temporal modeling.
Track 2 Details
Track 2 Highlights
Performance metric focus on ranking/ classification, which differs from traditional collaborative filtering. No validation data provided, need to selfconstruct binary labeled data from rating data. Unlike track 1, track 2 removed time stamps to focus more than long term preference rather than short term behaviors.
Submission Stats
Winners
Track 1 1st place 2nd place 3rd place National Taiwan University Commendo (Netflix Prize Winnder) Hong Kong University of Science and Technology, Shanghai Jiaotong University Track 2 National Taiwan University Chinese Academy of Science, Hulu Labs Commendo (Netflix Prize Winnder)
Key Techniques
Track 1:
Blending of multiple techniques Matrix factorization models Nearest neighbor models Restricted Bolzmann machines Temporal modelings
Track 2:
Importance sampling of negative instances Taxonomical modelings Use of pairwise ranking objective functions
Summary
Team work Expertise in domain knowledge as well as mathematical tools Often done by world famous institutes and companies Dataset increasingly more realistic Participants increasingly more professional Tasks are increasingly more difficult
Recent trends:
30
Summary
KDD Cup is an excellent source to learn the state-of-art KDD techniques KDDCUP dataset often becomes the standard benchmark for future research, development and teaching Top winners are highly regarded and respected
31
References
Elkan C. (1997). Boosting and Naive Bayesian Learning. Technical Report No. CS97-557, September 1997, UCSD. Decisionhouse (1998). KDD Cup 98: Quadstone Take Bronze Miner Award. Retrieved March 15, 2001 from http://www.kdnuggets.com/meetings/kdd98/quadstone/i ndex.html Urbane Science (1998). Urbane Science wins the KDD-98 Cup. Retrieved March 15, 2001 from http://www.kdnuggets.com/meetings/kdd98/gainkddcup98-release.html Georges, J. & Milley, A. (1999). KDD99 Competition: Knowledge Discovery Contest. Retrieved March 15, 2001 from http://www.cse.ucsd.edu/users/elkan/saskdd99.pdf Rosset, S. & Inger A. (1999). KDD-Cup 99 : Knowledge Discovery In a Charitable Organizations Donor Database. Retrieved March 15, 2001 from http://www.cse.ucsd.edu/users/elkan/KDD2.doc
32
References
(Cont.)
Sebastiani P., Ramoni M. & Crea A. (1999). Profiling your Customers using Bayesian Networks. Retrieved March 15, 2001 from http://bayesware.com/resources/tutorials/kddcup99/kddcu p99.pdf Inger A., Vatnik N., Rosset S. & Neumann E. (2000). KDD-Cup 2000: Question 1 Winners Report. Retrieved March 18, 2000 from http://www.ecn.purdue.edu/KDDCUP/amdocs-slides-1.ppt Neumann E., Vatnik N., Rosset S., Duenias M., Sasson I. & Inger A. (2000). KDD-Cup 2000: Question 5 Winners Report. Retrieved March 18, 2000 from http://www.ecn.purdue.edu/KDDCUP/amdocs-slides-5.ppt Salford System white papers: http://www.salford-systems.com/whitepaper.html Summary talk presented at KDD (2000) http://robotics.stanford.edu/~ronnyk/kddCupTalk.ppt
33
References (cont)
34