开课单位--卡内基梅隆大学

141
Interview with Christos Faloutsos[采访克里斯托法鲁托斯]
  Christos Faloutsos;Davor Orlič(卡内基梅隆大学) We met Christos Faloustos in Pittsburgh at CMU where we discussed with him about his current work. Here he describes all his work in the last ten year...
热度:72

142
Alternatives to the Discrete Fourier Transform [离散傅立叶变换的替代方案]
  Aliaksei Sandryhaila; Jonathan Gross; Markus Püschel;Doru Balcan(卡内基梅隆大学) It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform of the ...
热度:43

143
Protein Identification from Tandem Mass Spectra with Probabilistic Language Modeling[基于概率语言模型的串联质谱鉴定蛋白质鉴定]
  Yiming Yang(卡内基梅隆大学) This paper presents an interdisciplinary investigation of statistical information retrieval (IR) techniques for protein identification from tandem mas...
热度:107

144
The Fixed Points of Off-Policy TD[非政策TD的固定点]
  J. Zico Kolter(卡内基梅隆大学) Off-policy learning, the ability for an agent to learn about a policy other than the one it is following, is a key element of Reinforcement Learning, ...
热度:43

146
Algebraic statistics for random graph models: Markov bases and their uses[随机图模型代数统计:马尔可夫基础及其应用]
  Alessandro Rinaldo;Stephen E. Fienberg;Sonja Petrović(卡内基梅隆大学) We use algebraic geometry to study a statistical model for the analysis of networks represented by graphs with directed edges due to Holland and Leinh...
热度:45

147
Dynamics of Conversations[动态的对话]
  Mary McGlohon(卡内基梅隆大学) How do online conversations build? Is there a common model that human communication follows? In this work we explore these questions in detail. We ana...
热度:33

148
Efficiently Learning the Accuracy of Labeling Sources for Selective Sampling[高效学习选择抽样的标记源准确性]
  Pinar Donmez(卡内基梅隆大学) Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple l...
热度:38

149
Fast Nearest Neighbor Search in Disk-resident Graphs[在磁盘驻留图中的快速最近邻搜索]
  Purnamrita Sarkar(卡内基梅隆大学) Link prediction, personalized graph search, fraud detection, and many such graph mining problems revolve around the computation of the most ``similar'...
热度:56

150
Connecting the Dots Between News Articles[连接新闻文章之间的点]
  Dafna Shahaf(卡内基梅隆大学) The process of extracting useful knowledge from large datasets has become one of the most pressing problems in today's society. The problem spans enti...
热度:36