12. ECML 2000: Barcelona, Catalonia, Spain

Invited Papers

• Pedro Domingos:
  Beyond Occam's Razor: Process-Oriented Evaluation. 3
  
• Katharina Morik:
  The Representation Race - Preprocessing for Handling Time Phenomena. 4-19
  

Contributed Papers

• Esma Aïmeur, Mathieu Vézeau:
  Short-Term Profiling for a Case-Based Reasoning. 23-30
  
• Cecilio Angulo, Andreu Català:
  K-SVCR. A Multi-class Support Vector Machine. 31-38
  
• Liviu Badea:
  Learning Trading Rules with Inductive Logic Programming. 39-46
  
• Javier Béjar:
  Improving Knowledge Discovery Using Domain Knowledge in Unsupervised Learning. 47-54
  
• Enrico Blanzieri, Claudio Eccher, Stefano Forti, Andrea Sboner:
  Exploiting Classifier Combination for Early Melanoma Diagnosis Support. 55-62
  
• Pavel Brazdil, Carlos Soares:
  A Comparison of Ranking Methods for Classification Algorithm Selection. 63-74
  
• Laurent Bréhélin, Olivier Gascuel, Gilles Caraux:
  Hidden Markov Models with Patterns and Their Application to Integrated Circuit Testing. 75-87
  
• Tom Brijs, Gilbert Swinnen, Koen Vanhoof, Geert Wets:
  Comparing Complete and Partial Classification for Identifying Latently Dissatisfied Customers. 88-95
  
• Boris Chidlovskii, Jon Ragetli, Maarten de Rijke:
  Wrapper Generation via Grammar Induction. 96-108
  
• Padraig Cunningham, John Carney:
  Diversity versus Quality in Classification Ensembles Based on Feature Selection. 109-116
  
• Fredrik A. Dahl, Ole Martin Halck:
  Minimax TD-Learning with Neural Nets in a Markov Game. 117-128
  
• Gerard Escudero, Lluís Màrquez, German Rigau:
  Boosting Applied toe Word Sense Disambiguation. 129-141
  
• Wei Fan, Wenke Lee, Salvatore J. Stolfo, Matthew Miller:
  A Multiple Model Cost-Sensitive Approach for Intrusion Detection. 142-153
  
• Katja Gelbrich, Reza Nakhaeizadeh:
  Value Miner: A Data Mining Environment for the Calculation of the Customer Lifetime Value with Application to the Automotive Industry. 154-161
  
• Pierre Geurts, Louis Wehenkel:
  Investigation and Reduction of Discretization Variance in Decision Tree Induction. 162-170
  
• Ole Martin Halck, Fredrik A. Dahl:
  Asymmetric Co-evolution for Imperfect-Information Zero-Sum Games. 171-182
  
• Joachim Herbst:
  A Machine Learning Approach to Workflow Management. 183-194
  
• Andrzej Izworski, Ryszard Tadeusiewicz, Andrzej Paslawski:
  The Utilization of Context Signals in the Analysis of ABR Potentials by Application of Neural Networks. 195-202
  
• Yuri Kalnishkan:
  Complexity Approximation Principle and Rissanen's Approach to Real-Valued Parameters. 203-210
  
• DaeEun Kim, Jaeho Lee:
  Handling Continuous-Valued Attributes in Decision Tree with Neural Network Modelling. 211-219
  
• Pat Langley, Sean Stromsten:
  Learning Context-Free Grammars with a Simplicity Bias. 220-228
  
• Carsten Lanquillon:
  Partially Supervised Text Classification: Combining Labeled and Unlabeled Documents Using an EM-like Scheme. 229-237
  
• Mathieu Latourrette:
  Toward an Ecplanatory Similarity Measure for Nearest-Neighbor Classification. 238-245
  
• Marcus-Christopher Ludl, Gerhard Widmer:
  Relative Unsupervised Discretization for Regresseion Problems. 246-253
  
• Zdravko Markov, Ivo Marinchev:
  Metric-Based Inductive Learning Using Semantic Height Functions. 254-262
  
• David McKoskey, Daniel Boley:
  Error Analysis of Automatic Speech Recognition Using Principal Direction Divisive Partitioning. 263-270
  
• Dimitris Meretakis, Hongjun Lu, Beat Wüthrich:
  A Study on the Performance of Large Bayes Classifier. 271-279
  
• Llanos Mora López, Inmaculada Fortes Ruiz, Rafael Morales Bueno, Francisco Triguero Ruiz:
  Dynamic Discretization of Continuous Values from Time Series. 280-291
  
• Emmanuel Morin, Emmanuelle Martienne:
  Using a Symbolic Machine Learning Tool to Refine Lexico-syntactic Patterns. 292-299
  
• Stephen Muggleton, Christopher H. Bryant, Ashwin Srinivasan:
  Measuring Performance when Positives Are Rare: Relative Advantage versus Predictive Accuracy - A Biological Case Study. 300-312
  
• Filippo Neri:
  Mining TCP/IP Traffic for Network Intrusion Detection by Using a Distributed Genetic Algorithm. 313-322
  
• Marlon Núñez:
  Learning Patterns of Behavior by Observing System Events. 323-330
  
• Terry R. Payne, Peter Edwards:
  Dimensionality Reduction through Sub-space Mapping for Nearest Neighbor Algorithms. 331-343
  
• Tobias Scheffer:
  Nonparametric Regularization of Decision Trees. 344-356
  
• Barry Smyth, Elizabeth McKenna:
  An Efficient and Effective Procedure for Updating a Competence Model for Case-Based Reasoners. 357-368
  
• Peter Stone, Manuela M. Veloso:
  Layered Learning. 369-381
  
• Dorian Suc, Ivan Bratko:
  Problem Decomposition for Behavioural Cloning. 382-391
  
• Luis Talavera:
  Dynamic Feature Selection in Incremental Hierarchical Clustering. 392-403
  
• Christino Tamon, Jie Xiang:
  On the Boosting Pruning Problem. 404-412
  
• Kai Ming Ting:
  An Empirical Study of MetaCost Using Boosting Algorithms. 413-425
  
• Luís Torgo, Joaquim Pinto da Costa:
  Clustered Partial Linear Regression. 426-436
  
• Kitsana Waiyamai, Lotfi Lakhal:
  Knowledge Discovery from Very Large Databases Using Frequent Concept Lattices. 437-445
  
• Wei Zhang:
  Some Improvements on Event-Sequence Temporal Region Methods. 446-458