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

Overview

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 ...

See more details below
Paperback (2009)
$165.44
BN.com price
(Save 7%)$179.00 List Price
Other sellers (Paperback)
  • All (6) from $117.56   
  • New (5) from $117.56   
  • Used (1) from $131.90   
Sending request ...

Overview

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

Regular Papers.- Decomposition Algorithms for Training Large-Scale Semiparametric Support Vector Machines.- A Convex Method for Locating Regions of Interest with Multi-instance Learning.- Active Learning for Reward Estimation in Inverse Reinforcement Learning.- Simulated Iterative Classification A New Learning Procedure for Graph Labeling.- Graph-Based Discrete Differential Geometry for Critical Instance Filtering.- Integrating Novel Class Detection with Classification for Concept-Drifting Data Streams.- Neural Networks for State Evaluation in General Game Playing.- Learning to Disambiguate Search Queries from Short Sessions.- Dynamic Factor Graphs for Time Series Modeling.- On Feature Selection, Bias-Variance, and Bagging.- Efficient Pruning Schemes for Distance-Based Outlier Detection.- The Sensitivity of Latent Dirichlet Allocation for Information Retrieval.- Efficient Decoding of Ternary Error-Correcting Output Codes for Multiclass Classification.- The Model of Most Informative Patterns and Its Application to Knowledge Extraction from Graph Databases.- On Discriminative Parameter Learning of Bayesian Network Classifiers.- Mining Spatial Co-location Patterns with Dynamic Neighborhood Constraint.- Classifier Chains for Multi-label Classification.- Dependency Tree Kernels for Relation Extraction from Natural Language Text.- Statistical Relational Learning with Formal Ontologies.- Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm.- Capacity Control for Partially Ordered Feature Sets.- Reconstructing Data Perturbed by Random Projections When the Mixing Matrix Is Known.- Identifying the Original Contribution of a Document via Language Modeling.- Relaxed Transfer of Different Classes via Spectral Partition.- Mining Databases to Mine Queries Faster.- MACs: Multi-Attribute Co-clusters with High Correlation Information.- Bi-directional Joint Inference for Entity Resolution and Segmentation Using Imperatively-Defined Factor Graphs.- Latent Dirichlet Allocation for Automatic Document Categorization.- New Regularized Algorithms for Transductive Learning.- Enhancing the Performance of Centroid Classifier by ECOC and Model Refinement.- Optimal Online Learning Procedures for Model-Free Policy Evaluation.- Kernels for Periodic Time Series Arising in Astronomy.- K-Subspace Clustering.- Latent Dirichlet Bayesian Co-Clustering.- Variational Graph Embedding for Globally and Locally Consistent Feature Extraction.- Protein Identification from Tandem Mass Spectra with Probabilistic Language Modeling.- Causality Discovery with Additive Disturbances: An Information-Theoretical Perspective.- Subspace Regularization: A New Semi-supervised Learning Method.- Heteroscedastic Probabilistic Linear Discriminant Analysis with Semi-supervised Extension.- Semi-Supervised Multi-Task Regression.- A Flexible and Efficient Algorithm for Regularized Fisher Discriminant Analysis.- Debt Detection in Social Security by Sequence Classification Using Both Positive and Negative Patterns.- Learning the Difference between Partially Observable Dynamical Systems.- Universal Learning over Related Distributions and Adaptive Graph Transduction.- The Feature Importance Ranking Measure.- Demo Papers.- OTTHO: On the Tip of My THOught.- Protecting Sensitive Topics in Text Documents with PROTEXTOR.- Enhanced Web Page Content Visualization with Firefox.- ClusTR: Exploring Multivariate Cluster Correlations and Topic Trends.- Visual OntoBridge: Semi-automatic Semantic Annotation Software.- Semi-automatic Categorization of Videos on VideoLectures.net.- Discovering Patterns in Flows: A Privacy Preserving Approach with the ACSM Prototype.- Using Temporal Language Models for Document Dating.- Omiotis: A Thesaurus-Based Measure of Text Relatedness.- Found in Translation.- A Community-Based Platform for Machine Learning Experimentation.- TeleComVis: Exploring Temporal Communities in Telecom Networks.
Read More Show Less

Customer Reviews

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

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com 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 & Noble.com 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 & Noble.com 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 BN.com 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

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com 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 BN.com. 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)