Machine Learning and Knowledge Discovery in Databases: European Conference, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part I / Edition 1

Machine Learning and Knowledge Discovery in Databases: European Conference, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part I / Edition 1

by Walter Daelemans
     
 

When in 1986 Yves Kodrato? started the European Working Session on Le- ning at Orsay, France, it could not be foreseen that the conference would grow year by year and become the premier European conference of the ?eld, attr- ting submissions from all over the world. The ?rst European Conference on Principles of Data Mining and Knowledge Discovery was organized by… See more details below

Overview

When in 1986 Yves Kodrato? started the European Working Session on Le- ning at Orsay, France, it could not be foreseen that the conference would grow year by year and become the premier European conference of the ?eld, attr- ting submissions from all over the world. The ?rst European Conference on Principles of Data Mining and Knowledge Discovery was organized by Henryk Jan Komorowskiand Jan Zytkowin 1997 in Trondheim, Norway. Since 2001the two conferences have been collocated, o?ering participants from both areas the opportunity to listen to each other’s talks. This year, the integration has moved even further. Instead of ?rst splitting the ?eld according to ECML or PKDD topics, we ?attened the structure of the ?eld to a single set of topics. For each of the topics, experts were invited to the Program Committee. Submitted papers were gathered into one collection and characterized according to their topics. The reviewers were then asked to bid on all papers, regardlessof the conference. This allowed us to allocate papers more precisely. The hierarchical reviewing process as introduced in 2005 was continued. We nominated30AreaChairs,eachsupervisingthereviewsanddiscussionsofabout 17 papers. In addition, 307 reviewers completed the ProgramCommittee. Many thanks to all of them! It was a considerable e?ort for the reviewers to carefully review the papers, some providing us with additional reviews even at short - tice.

Read More

Product Details

ISBN-13:
9783540874782
Publisher:
Springer Berlin Heidelberg
Publication date:
09/28/2008
Series:
Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence Series, #5211
Edition description:
2008
Pages:
692
Product dimensions:
6.10(w) x 9.30(h) x 1.00(d)

Table of Contents

Invited Talks (Abstracts).- Industrializing Data Mining, Challenges and Perspectives.- From Microscopy Images to Models of Cellular Processes.- Data Clustering: 50 Years Beyond K-means.- Learning Language from Its Perceptual Context.- The Role of Hierarchies in Exploratory Data Mining.- Machine Learning Journal Abstracts.- Rollout Sampling Approximate Policy Iteration.- New Closed-Form Bounds on the Partition Function.- Large Margin vs. Large Volume in Transductive Learning.- Incremental Exemplar Learning Schemes for Classification on Embedded Devices.- A Collaborative Filtering Framework Based on Both Local User Similarity and Global User Similarity.- A Critical Analysis of Variants of the AUC.- Improving Maximum Margin Matrix Factorization.- Data Mining and Knowledge Discovery Journal Abstracts.- Finding Reliable Subgraphs from Large Probabilistic Graphs.- A Space Efficient Solution to the Frequent String Mining Problem for Many Databases.- The Boolean Column and Column-Row Matrix Decompositions.- SkyGraph: An Algorithm for Important Subgraph Discovery in Relational Graphs.- Mining Conjunctive Sequential Patterns.- Adequate Condensed Representations of Patterns.- Two Heads Better Than One: Pattern Discovery in Time-Evolving Multi-aspect Data.- Regular Papers.- TOPTMH: Topology Predictor for Transmembrane ?-Helices.- Learning to Predict One or More Ranks in Ordinal Regression Tasks.- Cascade RSVM in Peer-to-Peer Networks.- An Algorithm for Transfer Learning in a Heterogeneous Environment.- Minimum-Size Bases of Association Rules.- Combining Classifiers through Triplet-Based Belief Functions.- An Improved Multi-task Learning Approach with Applications in Medical Diagnosis.- Semi-supervised Laplacian Regularization of Kernel Canonical Correlation Analysis.- Sequence Labelling SVMs Trained in One Pass.- Semi-supervised Classification from Discriminative Random Walks.- Learning Bidirectional Similarity for Collaborative Filtering.- Bootstrapping Information Extraction from Semi-structured Web Pages.- Online Multiagent Learning against Memory Bounded Adversaries.- Scalable Feature Selection for Multi-class Problems.- Learning Decision Trees for Unbalanced Data.- Credal Model Averaging: An Extension of Bayesian Model Averaging to Imprecise Probabilities.- A Fast Method for Training Linear SVM in the Primal.- On the Equivalence of the SMO and MDM Algorithms for SVM Training.- Nearest Neighbour Classification with Monotonicity Constraints.- Modeling Transfer Relationships Between Learning Tasks for Improved Inductive Transfer.- Mining Edge-Weighted Call Graphs to Localise Software Bugs.- Hierarchical Distance-Based Conceptual Clustering.- Mining Frequent Connected Subgraphs Reducing the Number of Candidates.- Unsupervised Riemannian Clustering of Probability Density Functions.- Online Manifold Regularization: A New Learning Setting and Empirical Study.- A Fast Algorithm to Find Overlapping Communities in Networks.- A Case Study in Sequential Pattern Mining for IT-Operational Risk.- Tight Optimistic Estimates for Fast Subgroup Discovery.- Watch, Listen & Learn: Co-training on Captioned Images and Videos.- Parameter Learning in Probabilistic Databases: A Least Squares Approach.- Improving k-Nearest Neighbour Classification with Distance Functions Based on Receiver Operating Characteristics.- One-Class Classification by Combining Density and Class Probability Estimation.- Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth.- Proper Model Selection with Significance Test.- A Projection-Based Framework for Classifier Performance Evaluation.- Distortion-Free Nonlinear Dimensionality Reduction.- Learning with L q? vs L 1-Norm Regularisation with Exponentially Many Irrelevant Features.- Catenary Support Vector Machines.- Exact and Approximate Inference for Annotating Graphs with Structural SVMs.- Extracting Semantic Networks from Text Via Relational Clustering.- Ranking the Uniformity of Interval Pairs.- Multiagent Reinforcement Learning for Urban Traffic Control Using Coordination Graphs.- StreamKrimp: Detecting Change in Data Streams.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >