SIGKDD历年Best Papers

作者：我爱机器学习
原文链接：SIGKDD历年Best Papers

SIGKDD(Data Mining)(1997-2016)
年份 标题 一作 一作单位
2016 FRAUDAR: Bounding Graph Fraud in the Face of Camouflage Bryan Hooi Carnegie Mellon University
2015 Efficient Algorithms for Public-Private Social Networks Flavio Chierichetti Sapienza University of Rome
2014 Reducing the Sampling Complexity of Topic Models Aaron Li Carnegie Mellon University
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
2011 Leakage in Data Mining: Formulation, Detection, and Avoidance Shachar Kaufman Tel-Aviv University
2010 Large linear classification when data cannot fit in memory Hsiang-Fu Yu National Taiwan University
Connecting the dots between news articles Dafna Shahaf 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
2007 Predictive discrete latent factor models for large scale dyadic data Deepak Agarwal 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
2004 A probabilistic framework for semi-supervised clustering Sugato Basu University of Texas at Austin
2003 Maximizing the spread of influence through a social network David Kempe Cornell University
2002 Pattern discovery in sequences under a Markov assumption Darya Chudova University of California Irvine
2001 Robust space transformations for distance-based operations Edwin M. Knorr University of British Columbia
2000 Hancock: a language for extracting signatures from data streams Corinna Cortes AT&T Laboratories
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 NYNEX Science and Technology

参考文献：Best Paper Awards in Computer Science (since 1996)

时间： 2024-07-30 04:22:10

SIGKDD历年Best Papers的相关文章

ICML历年Best Papers

作者:我爱机器学习原文链接:ICML历年Best Papers ICML (Machine Learning)(1999-2016) 2016 Dueling Network Architectures for Deep Reinforcement Learning Ziyu Wang Google Inc. Pixel Recurrent Neural Networks Aaron van den Oord Google DeepMind Ensuring Rapid Mixing and L

CVPR历年Best Papers

作者:我爱机器学习原文链接:CVPR历年Best Papers CVPR (Computer Vision)(2000-2016) 年份 标题 一作 一作单位 2016 Deep Residual Learning for Image Recognition Kaiming He Microsoft Research 2015 DynamicFusion: Reconstruction and Tracking of Non-rigid Scenes in Real-Time Richard A

KDD2015,Accepted Papers

Accepted Papers by Session Research Session RT01: Social and Graphs 1Tuesday 10:20 am–12:00 pm | Level 3 – Ballroom AChair: Tanya Berger-Wolf Efficient Algorithms for Public-Private Social NetworksFlavio Chierichetti,Sapienza University of Rome; Ales

如何教你在NIPS会议上批量下载历年的pdf文档（另附04~14年NIPS论文下载链接）

如何获得NIPS会议上批量下载的链接? NIPS会议下载网址:http://papers.nips.cc/ a.点击打开上述网站,进入某一年的所有会议,例如2014年,如下图 b.然后对着当前网页点击鼠标右键->点击审查元素(这里我用的是360浏览器打开),(如下图) 下一步----------------------------------------------------------------------------------------------------------------

历年NOIP水题泛做

快noip了就乱做一下历年的noip题目咯.. noip2014 飞扬的小鸟 其实这道题并不是很难,但是就有点难搞 听说男神错了一个小时.. 就是$f_{i,j}$表示在第$i$个位置高度为$j$的时候最小点击次数 递推的话对于上升的情况只做一次,后面几次在后面再做.. #include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm> using namespace st

（转）The 9 Deep Learning Papers You Need To Know About (Understanding CNNs Part 3)

Adit Deshpande CS Undergrad at UCLA ('19) Blog About The 9 Deep Learning Papers You Need To Know About (Understanding CNNs Part 3) Introduction Link to Part 1Link to Part 2 In this post, we’ll go into summarizing a lot of the new and important develo

华为历年试题（掷骰子游戏 7）

问题描述: 在掷骰子游戏中,会根据所掷数字在地图中前进几步,前进完成后需要根据当前地图位置所示的障碍进行相应操作,其中障碍表示: 1)  9:无障碍 2)  1:停掷一轮,即下轮所掷数字无效: 3)  2:后退两步,如果已经到起点不再后退: 4)  3:奖励前进一步 如果在游戏过程中,已经走到地图终点,则游戏结束.根据输入的地图数组,和5个骰子数的数组,返回最终玩家前进了多少步. 要求实现函数: void dice(int map_len, int* map, int* dice_val, in

蓝桥杯——历年真题之带分数

问题描述 100 可以表示为带分数的形式:100 = 3 + 69258 / 714. 还可以表示为:100 = 82 + 3546 / 197. 注意特征:带分数中,数字1~9分别出现且只出现一次(不包含0). 类似这样的带分数,100 有 11 种表示法. 输入格式 从标准输入读入一个正整数N (N<1000*1000) 输出格式 程序输出该数字用数码1~9不重复不遗漏地组成带分数表示的全部种数. 注意:不要求输出每个表示,只统计有多少表示法! 样例输入1 100 样例输出1 11 样例输入

IEEE/ACM International Conference on Advances in Social Network Analysis and Mining (ASONAM) 2014 Industry Track Call for Papers

IEEE/ACM International Conference on Advances in Social Network Analysis and Mining (ASONAM) 2014 Industry Track Call for Papers Beijing China August 17-20, 2014Home Page: www.asonam2014.org Full paper/short paper/extended abstract submission deadlin