MLJ 2009
49 papers
An Efficient Algorithm for Learning to Rank from Preference Graphs
Tapio Pahikkala, Evgeni Tsivtsivadze, Antti Airola, Jouni Järvinen, Jorma Boberg An Investigation into Feature Construction to Assist Word Sense Disambiguation
Lucia Specia, Ashwin Srinivasan, Sachindra Joshi, Ganesh Ramakrishnan, Maria das Graças Volpe Nunes Cost-Sensitive Learning Based on Bregman Divergences
Raúl Santos-Rodríguez, Alicia Guerrero-Curieses, Rocío Alaíz-Rodríguez, Jesús Cid-Sueiro Cutting-Plane Training of Structural SVMs
Thorsten Joachims, Thomas Finley, Chun-Nam John Yu Finding Anomalous Periodic Time Series
Umaa Rebbapragada, Pavlos Protopapas, Carla E. Brodley, Charles R. Alcock Learning Block-Preserving Graph Patterns and Its Application to Data Mining
Hitoshi Yamasaki, Yosuke Sasaki, Takayoshi Shoudai, Tomoyuki Uchida, Yusuke Suzuki NP-Hardness of Euclidean Sum-of-Squares Clustering
Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat On the Properties of Von Neumann Kernels for Link Analysis
Masashi Shimbo, Takahiko Ito, Daichi Mochihashi, Yuji Matsumoto Parallel ILP for Distributed-Memory Architectures
Nuno A. Fonseca, Ashwin Srinivasan, Fernando M. A. Silva, Rui Camacho Search-Based Structured Prediction
Hal Daumé Iii, John Langford, Daniel Marcu Semi-Supervised Graph Clustering: A Kernel Approach
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Raymond J. Mooney Structured Prediction with Reinforcement Learning
Francis Maes, Ludovic Denoyer, Patrick Gallinari