这一期，接着上一期，开始我们的卡内基梅隆大学（CMU）机器学习论文之旅。
CMU果然是机器学习的牛叉大学（拥有专门的机器学习专业系）。David 9翻看所有获得“Test of Time Award”（经得住时间考验奖）的论文，没有一篇论文是应用型，全部是奠基类的基础研究文章，不得不赞叹才疏学浅啊。先来获奖看一下列表：
- Graphs over time: densification laws, shrinking diameters and possible explanations [.pdf]
Jure Leskovec, Jon Kleinberg, Christos Faloutsos, Test of Time Award, KDD 2016 - Dynamic Topic Models [.pdf]
John Lafferty, David Blei, Test of Time Award, ICML 2016 - Realistic, Mathematically Tractable Graph Generation and Evolution, Using Krinecker Multiplication [.pdf]Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos, Test of Time Award, ECML/PKDD 2015
- Beyond Independent Relevance: Methods and Evaluation Metrics for Subtopic Retrieval [.pdf]
Cheng Zhai, William Cohen, John Lafferty, Test of Time Award, SIGIR 2014 - Diffusion Kernels on Graphs and Other Discrete Input Spaces [.pdf]Risi Kondar and John Lafferty, Test of Time Award, ICML 2012
- Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data [.pdf]
John Lafferty, Andrew McCallum, and Fernando C. N. Pereira, Test of Time Award, ICML 2011 - On Power-Law Relationships of the Internet Topology [.pdf]Michalis Faloutsos, Petros Faloutsos and Christos Faloutsos, Test of Time Award, ACM SIGCOMM 2010
- Integration of heterogeneous databases without common domains using queries based on textual similarity [.pdf]William Cohen, Test of Time Award, ACM SIGMOD, 2008
David 9发现一个规律，里面几乎所有论文都和“图”有关系啊，看来CMU对Graph研究很热衷啊？ 继续阅读卡内基梅隆大学（CMU），那些经受住时间考验的机器学习论文–第一弹：互联网拓扑规律研究