【最佳论文】KDD最佳论文 2006-

自2006年以来计算机会议最佳论文一览：http://jeffhuang.com/best_paper_awards.html

KDD

KDD (Data Mining)
2016	FRAUDAR: Bounding Graph Fraud in the Face of Camouflage	Bryan Hooi, Carnegie Mellon University; et al.
2015	Efficient Algorithms for Public-Private Social Networks	Flavio Chierichetti, Sapienza University of Rome; et al.
2014	Reducing the Sampling Complexity of Topic Models	Aaron Li, Carnegie Mellon University; et al.
2013	Simple and Deterministic Matrix Sketching	Edo Liberty, Yahoo! Research
2012	Searching and Mining Trillions of Time Series Subsequences under Dynamic Time Warping	Thanawin Rakthanmanon, University of California Riverside; et al.
2011	Leakage in Data Mining: Formulation, Detection, and Avoidance	Shachar Kaufman, Tel-Aviv University; et al.
2010	Large linear classification when data cannot fit in memory	Hsiang-Fu Yu, National Taiwan University; et al.
	Connecting the dots between news articles	Dafna Shahaf & Carlos Guestrin, Carnegie Mellon University
2009	Collaborative Filtering with Temporal Dynamics	Yehuda Koren, Yahoo! Research
2008	Fastanova: an efficient algorithm for genome-wide association study	Xiang Zhang, University of North Carolina at Chapel Hill; et al.
2007	Predictive discrete latent factor models for large scale dyadic data	Deepak Agarwal & Srujana Merugu, Yahoo! Research
2006	Training linear SVMs in linear time	Thorsten Joachims, Cornell University
2005	Graphs over time: densification laws, shrinking diameters and possible explanations	Jure Leskovec, Carnegie Mellon University; et al.
2004	A probabilistic framework for semi-supervised clustering	Sugato Basu, University of Texas at Austin; et al.
2003	Maximizing the spread of influence through a social network	David Kempe, Cornell University; et al.
2002	Pattern discovery in sequences under a Markov assumption	Darya Chudova & Padhraic Smyth, University of California Irvine
2001	Robust space transformations for distance-based operations	Edwin M. Knorr, University of British Columbia; et al.
2000	Hancock: a language for extracting signatures from data streams	Corinna Cortes, AT&T Laboratories; et al.
1999	MetaCost: a general method for making classifiers cost-sensitive	Pedro Domingos, Universidade Técnica de Lisboa
1998	Occam's Two Razors: The Sharp and the Blunt	Pedro Domingos, Universidade Técnica de Lisboa
1997	Analysis and Visualization of Classifier Performance: Comparison under Imprecise Class and Cost Di...	Foster Provost & Tom Fawcett, NYNEX Science and Technology