Machine Learning, Volume 81, 2010

Volume 81, Number 1, October 2010

• José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag:
  Special issue for ECML PKDD 2010: Guest editors' introduction. 1-4
  
• Lan Du, Wray L. Buntine, Huidong Jin:
  A segmented topic model based on the two-parameter Poisson-Dirichlet process. 5-19
  
• Jason Weston, Samy Bengio, Nicolas Usunier:
  Large scale image annotation: learning to rank with joint word-image embeddings. 21-35
  
• Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping Nie:
  On the eigenvectors of p-Laplacian. 37-51
  
• Ni Lao, William W. Cohen:
  Relational retrieval using a combination of path-constrained random walks. 53-67
  
• Wei Liu, Sanjay Chawla:
  Mining adversarial patterns via regularized loss minimization. 69-83
  
• Ali Nouri, Michael L. Littman:
  Dimension reduction and its application to model-based exploration in continuous spaces. 85-98
  
• Arvind Agarwal, Hal Daumé III:
  A geometric view of conjugate priors. 99-113
  

Volume 81, Number 2, November 2010

• Pavel Laskov, Richard Lippmann:
  Machine learning in adversarial environments. 115-119
  
• Marco Barreno, Blaine Nelson, Anthony D. Joseph, J. D. Tygar:
  The security of machine learning. 121-148
  
• Ofer Dekel, Ohad Shamir, Lin Xiao:
  Learning to classify with missing and corrupted features. 149-178
  
• Yingbo Song, Michael E. Locasto, Angelos Stavrou, Angelos D. Keromytis, Salvatore J. Stolfo:
  On the infeasibility of modeling polymorphic shellcode - Re-thinking the role of learning in intrusion detection systems. 179-205
  
• Jacob Abernethy, Olivier Chapelle, Carlos Castillo:
  Graph regularization methods for Web spam detection. 207-225
  

Volume 81, Number 3, December 2010

• Peter A. Flach:
  The Machine Learning journal: 250 issues and counting. 227-228
  
• Sylvain Ferrandiz, Marc Boullé:
  Bayesian instance selection for the nearest neighbor rule. 229-256
  
• Ioannis Partalas, Grigorios Tsoumakas, Ioannis P. Vlahavas:
  An ensemble uncertainty aware measure for directed hill climbing ensemble pruning. 257-282
  
• Sertan Girgin, Faruk Polat, Reda Alhajj:
  Improving reinforcement learning by using sequence trees. 283-331
  
• Shivani Agarwal:
  Learning to rank on graphs. 333-357
  
• Andrey Bernstein, Nahum Shimkin:
  Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains. 359-397
  

Last update Sat May 26 06:50:22 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page