Table of Contents

• Theory-Practice Interplay in Machine Learning - Emerging Theoretical ChallengesShai Ben-David. 1 [doi]
• Are We There Yet?Nello Cristianini. 2 [doi]
• The Growing Semantic WebMark Greaves. 3 [doi]
• Privacy in Web Search Query Log MiningRosie Jones. 4 [doi]
• Highly Multilingual News Analysis ApplicationsRalf Steinberger. 5 [doi]
• Combining Instance-Based Learning and Logistic Regression for Multilabel ClassificationWeiwei Cheng, Eyke Hüllermeier. 6 [doi]
• On Structured Output Training: Hard Cases and an Efficient AlternativeThomas Gärtner, Shankar Vembu. 7 [doi]
• Sparse Kernel SVMs via Cutting-Plane TrainingThorsten Joachims, Chun-Nam John Yu. 8 [doi]
• Hybrid Least-Squares Algorithms for Approximate Policy EvaluationJeffrey Johns, Marek Petrik, Sridhar Mahadevan. 9 [doi]
• A Self-training Approach to Cost Sensitive Uncertainty SamplingAlexander Liu, Goo Jun, Joydeep Ghosh. 10 [doi]
• Learning Multi-linear Representations of Distributions for Efficient InferenceDan Roth, Rajhans Samdani. 11 [doi]
• Cost-Sensitive Learning Based on Bregman DivergencesRaúl Santos-Rodríguez, Alicia Guerrero-Curieses, Rocío Alaíz-Rodríguez, Jesús Cid-Sueiro. 12 [doi]
• RTG: A Recursive Realistic Graph Generator Using Random TypingLeman Akoglu, Christos Faloutsos. 13-28 [doi]
• Taxonomy-Driven Lumping for Sequence MiningFrancesco Bonchi, Carlos Castillo, Debora Donato, Aristides Gionis. 29 [doi]
• On Subgroup Discovery in Numerical DomainsHenrik Grosskreutz, Stefan Rüping. 30 [doi]
• Harnessing the Strengths of Anytime Algorithms for Constant Data StreamsPhilipp Kranen, Thomas Seidl. 31 [doi]
• Identifying the ComponentsMatthijs van Leeuwen, Jilles Vreeken, Arno Siebes. 32 [doi]
• Two-Way Analysis of High-Dimensional Collinear DataIlkka Huopaniemi, Tommi Suvitaival, Janne Nikkilä, Matej Oresic, Samuel Kaski. 33 [doi]
• A Fast Ensemble Pruning Algorithm Based on Pattern Mining ProcessQiang-li Zhao, Yan-huang Jiang, Ming Xu. 34 [doi]
• Evaluation Measures for Multi-class Subgroup DiscoveryTarek Abudawood, Peter Flach. 35-50 [doi]
• Empirical Study of Relational Learning Algorithms in the Phase Transition FrameworkÉrick Alphonse, Aomar Osmani. 51-66 [doi]
• Topic Significance Ranking of LDA Generative ModelsLoulwah AlSumait, Daniel Barbará, James Gentle, Carlotta Domeniconi. 67-82 [doi]
• Communication-Efficient Classification in P2P NetworksHock Hee Ang, Vivekanand Gopalkrishnan, Wee Keong Ng, Steven C. H. Hoi. 83-98 [doi]
• A Generalization of Forward-Backward AlgorithmAi Azuma, Yuji Matsumoto. 99-114 [doi]
• Mining Graph Evolution RulesMichele Berlingerio, Francesco Bonchi, Björn Bringmann, Aristides Gionis. 115-130 [doi]
• Parallel Subspace Sampling for Particle Filtering in Dynamic Bayesian NetworksEva Besada-Portas, Sergey M. Plis, Jesús Manuel de la Cruz, Terran Lane. 131-146 [doi]
• Adaptive XML Tree Classification on Evolving Data StreamsAlbert Bifet, Ricard Gavaldà. 147-162 [doi]
• A Condensed Representation of Itemsets for Analyzing Their Evolution over TimeMirko Böttcher, Martin Spott, Rudolf Kruse. 163-178 [doi]
• Non-redundant Subgroup Discovery Using a Closure SystemMario Boley, Henrik Grosskreutz. 179-194 [doi]
• PLSI: The True Fisher Kernel and beyondJean-Cédric Chappelier, Emmanuel Eckard. 195-210 [doi]
• Semi-supervised Document Clustering with Simultaneous Text Representation and CategorizationYanhua Chen, Lijun Wang, Ming Dong. 211-226 [doi]
• One Graph Is Worth a Thousand Logs: Uncovering Hidden Structures in Massive System Event LogsMichal Aharon, Gilad Barash, Ira Cohen, Eli Mordechai. 227-243 [doi]
• Conference Mining via Generalized Topic ModelingAli Daud, Juanzi Li, Lizhu Zhou, Faqir Muhammad. 244-259 [doi]
• Within-Network Classification Using Local Structure SimilarityChristian Desrosiers, George Karypis. 260-275 [doi]
• Multi-task Feature Selection Using the Multiple Inclusion Criterion (MIC)Paramveer S. Dhillon, Brian Tomasik, Dean P. Foster, Lyle H. Ungar. 276-289 [doi]
• Kernel Polytope Faces PursuitTom Diethe, Zakria Hussain. 290-301 [doi]
• Soft Margin TreesJorge Díez, Juan José del Coz, Antonio Bahamonde, Oscar Luaces. 302-314 [doi]
• Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMsHuyen Do, Alexandros Kalousis, Melanie Hilario. 315-329 [doi]
• Margin and Radius Based Multiple Kernel LearningHuyen Do, Alexandros Kalousis, Adam Woznica, Melanie Hilario. 330-343 [doi]
• Inference and Validation of NetworksIlias N. Flaounas, Marco Turchi, Tijl De Bie, Nello Cristianini. 344-358 [doi]
• Binary Decomposition Methods for Multipartite RankingJohannes Fürnkranz, Eyke Hüllermeier, Stijn Vanderlooy. 359-374 [doi]
• Leveraging Higher Order Dependencies between Features for Text ClassificationMurat Can Ganiz, Nikita I. Lytkin, William M. Pottenger. 375-390 [doi]
• Syntactic Structural Kernels for Natural Language Interfaces to DatabasesAlessandra Giordani, Alessandro Moschitti. 391-406 [doi]
• Active and Semi-supervised Data Domain DescriptionNico Görnitz, Marius Kloft, Ulf Brefeld. 407-422 [doi]
• A Matrix Factorization Approach for Integrating Multiple Data ViewsDerek Greene, Padraig Cunningham. 423-438 [doi]
• Transductive Classification via Dual RegularizationQuanquan Gu, Jie Zhou. 439-454 [doi]
• Stable and Accurate Feature SelectionGokhan Gulgezen, Zehra Cataltepe, Lei Yu. 455-468 [doi]
• Efficient Sample Reuse in EM-Based Policy SearchHirotaka Hachiya, Jan Peters, Masashi Sugiyama. 469-484 [doi]
• Applying Electromagnetic Field Theory Concepts to Clustering with ConstraintsHuseyin Hakkoymaz, Georgios Chatzimilioudis, Dimitrios Gunopulos, Heikki Mannila. 485-500 [doi]
• An l1 Regularization Framework for Optimal Rule CombinationYanjun Han, Jue Wang. 501-516 [doi]
• A Generic Approach to Topic ModelsGregor Heinrich. 517-532 [doi]
• Feature Selection by Transfer Learning with Linear Regularized ModelsThibault Helleputte, Pierre Dupont. 533-547 [doi]
• Integrating Logical Reasoning and Probabilistic Chain GraphsArjen Hommersom, Nivea de Carvalho Ferreira, Peter J. F. Lucas. 548-563 [doi]
• Max-Margin Weight Learning for Markov Logic NetworksTuyen N. Huynh, Raymond J. Mooney. 564-579 [doi]
• Parameter-Free Hierarchical Co-clustering by n-Ary SplitsDino Ienco, Ruggero G. Pensa, Rosa Meo. 580-595 [doi]
• Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background TextsDaisuke Ikeda, Einoshin Suzuki. 596-611 [doi]
• Minimum Free Energy Principle for Constraint-Based Learning Bayesian NetworksTakashi Isozaki, Maomi Ueno. 612-627 [doi]
• Kernel-Based Copula ProcessesSebastian Jaimungal, Eddie K. H. Ng. 628-643 [doi]
• Compositional Models for Reinforcement LearningNicholas K. Jong, Peter Stone. 644-659 [doi]
• Feature Selection for Value Function Approximation Using Bayesian Model SelectionTobias Jung, Peter Stone. 660-675 [doi]
• Learning Preferences with Hidden Common Cause RelationsKristian Kersting, Zhao Xu. 676-691 [doi]
• Feature Selection for Density Level-SetsMarius Kloft, Shinichi Nakajima, Ulf Brefeld. 692-704 [doi]
• Efficient Multi-start Strategies for Local Search AlgorithmsLevente Kocsis, András György. 705-720 [doi]
• Considering Unseen States as Impossible in Factored Reinforcement LearningOlga Kozlova, Olivier Sigaud, Pierre-Henri Wuillemin, Christophe Meyer. 721-735 [doi]
• Relevance Grounding for Planning in Relational DomainsTobias Lang, Marc Toussaint. 736-751 [doi]