Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2009, Bled, Slovenia, September 7-11, 2009, Proceedings, Part I / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $110.65
Usually ships in 1-2 business days
(Save 38%)
Other sellers (Paperback)
  • All (10) from $110.65   
  • New (7) from $114.95   
  • Used (3) from $110.65   

More About This Textbook


This book constitutes the refereed proceedings of the joint conference on Machine Learning and Knowledge Discovery in Databases: ECML PKDD 2009, held in Bled, Slovenia, in September 2009.

The 106 papers presented in two volumes, together with 5 invited talks, were carefully reviewed and selected from 422 paper submissions. In addition to the regular papers the volume contains 14 abstracts of papers appearing in full version in the Machine Learning Journal and the Knowledge Discovery and Databases Journal of Springer.

The conference intends to provide an international forum for the discussion of the latest high quality research results in all areas related to machine learning and knowledge discovery in databases. The topics addressed are application of machine learning and data mining methods to real-world problems, particularly exploratory research that describes novel learning and mining tasks and applications requiring non-standard techniques.

Read More Show Less

Product Details

Table of Contents

Invited Talks (Abstracts).- Theory-Practice Interplay in Machine Learning – Emerging Theoretical Challenges.- Are We There Yet?.- The Growing Semantic Web.- Privacy in Web Search Query Log Mining.- Highly Multilingual News Analysis Applications.- Machine Learning Journal Abstracts.- Combining Instance-Based Learning and Logistic Regression for Multilabel Classification.- On Structured Output Training: Hard Cases and an Efficient Alternative.- Sparse Kernel SVMs via Cutting-Plane Training.- Hybrid Least-Squares Algorithms for Approximate Policy Evaluation.- A Self-training Approach to Cost Sensitive Uncertainty Sampling.- Learning Multi-linear Representations of Distributions for Efficient Inference.- Cost-Sensitive Learning Based on Bregman Divergences.- Data Mining and Knowledge Discovery Journal Abstracts.- RTG: A Recursive Realistic Graph Generator Using Random Typing.- Taxonomy-Driven Lumping for Sequence Mining.- On Subgroup Discovery in Numerical Domains.- Harnessing the Strengths of Anytime Algorithms for Constant Data Streams.- Identifying the Components.- Two-Way Analysis of High-Dimensional Collinear Data.- A Fast Ensemble Pruning Algorithm Based on Pattern Mining Process.- Regular Papers.- Evaluation Measures for Multi-class Subgroup Discovery.- Empirical Study of Relational Learning Algorithms in the Phase Transition Framework.- Topic Significance Ranking of LDA Generative Models.- Communication-Efficient Classification in P2P Networks.- A Generalization of Forward-Backward Algorithm.- Mining Graph Evolution Rules.- Parallel Subspace Sampling for Particle Filtering in Dynamic Bayesian Networks.- Adaptive XML Tree Classification on Evolving Data Streams.- A Condensed Representation of Itemsets for Analyzing Their Evolution over Time.- Non-redundant Subgroup Discovery Using a Closure System.- PLSI: The True Fisher Kernel and beyond.- Semi-supervised Document Clustering with Simultaneous Text Representation and Categorization.- One Graph Is Worth a Thousand Logs: Uncovering Hidden Structures in Massive System Event Logs.- Conference Mining via Generalized Topic Modeling.- Within-Network Classification Using Local Structure Similarity.- Multi-task Feature Selection Using the Multiple Inclusion Criterion (MIC).- Kernel Polytope Faces Pursuit.- Soft Margin Trees.- Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs.- Margin and Radius Based Multiple Kernel Learning.- Inference and Validation of Networks.- Binary Decomposition Methods for Multipartite Ranking.- Leveraging Higher Order Dependencies between Features for Text Classification.- Syntactic Structural Kernels for Natural Language Interfaces to Databases.- Active and Semi-supervised Data Domain Description.- A Matrix Factorization Approach for Integrating Multiple Data Views.- Transductive Classification via Dual Regularization.- Stable and Accurate Feature Selection.- Efficient Sample Reuse in EM-Based Policy Search.- Applying Electromagnetic Field Theory Concepts to Clustering with Constraints.- An—1 Regularization Framework for Optimal Rule Combination.- A Generic Approach to Topic Models.- Feature Selection by Transfer Learning with Linear Regularized Models.- Integrating Logical Reasoning and Probabilistic Chain Graphs.- Max-Margin Weight Learning for Markov Logic Networks.- Parameter-Free Hierarchical Co-clustering by n-Ary Splits.- Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts.- Minimum Free Energy Principle for Constraint-Based Learning Bayesian Networks.- Kernel-Based Copula Processes.- Compositional Models for Reinforcement Learning.- Feature Selection for Value Function Approximation Using Bayesian Model Selection.- Learning Preferences with Hidden Common Cause Relations.- Feature Selection for Density Level-Sets.- Efficient Multi-start Strategies for Local Search Algorithms.- Considering Unseen States as Impossible in Factored Reinforcement Learning.- Relevance Grounding for Planning in Relational Domains.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)