Machine Learning, Volume 80, 2010

Volume 80, Number 1, July 2010

• Cynthia Rudin, Rebecca J. Passonneau, Axinia Radeva, Haimonti Dutta, Steve Ierome, Delfina Isaac:
  A process for predicting manhole events in Manhattan. 1-31
  
• Peter R. Rijnbeek, Jan A. Kors:
  Finding a short and accurate decision rule in disjunctive normal form by exhaustive search. 33-62
  
• Marco C. Campi:
  Classification with guaranteed probability of error. 63-84
  
• Don R. Hush, Reid B. Porter:
  Algorithms for optimal dyadic decision trees. 85-107
  

Volume 80, Numbers 2-3, September 2010

• Sham Kakade, Ping Li:
  Guest editorial: special issue on learning theory. 109-110
  
• Maria-Florina Balcan, Steve Hanneke, Jennifer Wortman Vaughan:
  The true sample complexity of active learning. 111-139
  
• Shai Shalev-Shwartz, Yoram Singer:
  On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms. 141-163
  
• Elad Hazan, Satyen Kale:
  Extracting certainty from uncertainty: regret bounded by variation in costs. 165-188
  
• Nir Ailon, Mehryar Mohri:
  Preference-based learning to rank. 189-211
  
• Ohad Shamir, Naftali Tishby:
  Stability and model selection in k-means clustering. 213-243
  
• Robert Kleinberg, Alexandru Niculescu-Mizil, Yogeshwer Sharma:
  Regret bounds for sleeping experts and bandits. 245-272
  
• Eric Blais, Ryan O'Donnell, Karl Wimmer:
  Polynomial regression under arbitrary product distributions. 273-294
  
• Shuheng Zhou, John D. Lafferty, Larry A. Wasserman:
  Time varying undirected graphs. 295-319
  

Last update Tue May 21 19:23:44 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page