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 |
SIGKDD历年Best Papers的更多相关文章
- ICML历年Best Papers
作者:我爱机器学习原文链接:ICML历年Best Papers ICML (Machine Learning)(1999-2016) 2016 Dueling Network Architecture ...
- CVPR历年Best Papers
作者:我爱机器学习原文链接:CVPR历年Best Papers CVPR (Computer Vision)(2000-2016) 年份 标题 一作 一作单位 2016 Deep Residual L ...
- 如何教你在NIPS会议上批量下载历年的pdf文档(另附04~14年NIPS论文下载链接)
如何获得NIPS会议上批量下载的链接? NIPS会议下载网址:http://papers.nips.cc/ a.点击打开上述网站,进入某一年的所有会议,例如2014年,如下图 b.然后对着当前网页点击 ...
- KDD2015,Accepted Papers
Accepted Papers by Session Research Session RT01: Social and Graphs 1Tuesday 10:20 am–12:00 pm | Lev ...
- 历年NOIP水题泛做
快noip了就乱做一下历年的noip题目咯.. noip2014 飞扬的小鸟 其实这道题并不是很难,但是就有点难搞 听说男神错了一个小时.. 就是$f_{i,j}$表示在第$i$个位置高度为$j$的时 ...
- International Conference for Smart Health 2015 Call for Papers
Advancing Informatics for healthcare and healthcare applications has become an international researc ...
- IEEE/ACM ASONAM 2014 Industry Track Call for Papers
IEEE/ACM International Conference on Advances in Social Network Analysis and Mining (ASONAM) 2014 In ...
- Call for Papers IEEE/ACM International Conference on Advances in Social Network Analysis and Mining (ASONAM)
IEEE/ACM International Conference on Advances in Social Network Analysis and Mining (ASONAM) 2014 In ...
- Call for Papers International Conference for Smart Health (ICSH) 2014
Call for PapersInternational Conference for Smart Health (ICSH) 2014 Beijing, China July 10-11, 2014 ...
随机推荐
- linux多文本替换内容
之前不小心写错了代码,把nil写成了Nil,脚本写的传到git中了,批量替换解决办法: grep "Nil" -rl $PATH/ |xargs sed -i 's/Nil/nil ...
- Google开源SLAM软件cartographer中使用的UKF滤波器解析
在Google开源SLAM软件cartographer中,相对<SLAM for dummies>使用了更为复杂.性能更好的Scan匹配与UKF算法,这里简单介绍下cartographer ...
- [bzoj3192][JLOI2013]删除物品(树状数组)
3192: [JLOI2013]删除物品 Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 872 Solved: 508[Submit][Status ...
- 利用Object.prototype.toString方法,实现比typeof更准确的type校验
Object.prototype.toString方法返回对象的类型字符串,因此可以用来判断一个值的类型. 调用方法: Object.prototype.toString.call(value) 不同 ...
- asp.net 一句话搞定分页
rows 是客户端传过来的行数,page是页码,传参就需要就两个参数就行,sql语句中_row 和_page 自己声明的局部变量,值还是相应的row 和page ,为了运算而已. 用数据库类获得它的D ...
- arm cache line,PLD指令
C中嵌入汇编PLD指令:asm("PLD [%0,#128]": :"r" (psrc) ); copy自官方文档: 4.2.7. PLD.PLDW 和 PLI ...
- 模拟微信上传图片(带预览,支持预览gif)
一.Html <style type="text/css"> #previewDiv{width:50px;height:50px;overflow:hidden;po ...
- Reconstruction
/* Reconstruction */ /*@mixin border($position){ @if $position == left-right or $position == ...
- jQuery事件绑定on()、bind()与delegate() 方法详解
jquery中有四种事件绑定函数,bind(),live(),on(),delegate(),由于live现在并不常用,因此不做过多解释. 1. bind()用法 $("div p" ...
- css学习笔记 3
css选择符: 通配选择符:* 类选择符:.className 标签选择符 后代选择符:例:p strong ,选择的是p标签内的所有strong标签. 子选择符:> ,只选择父标签内的直接子标 ...