Discovery Science: 11th International Conference, DS 2008, Budapest, Hungary, October 13-16, 2008, Proceedings / Edition 1

by Jean-Francois Boulicaut, Michael R. Berthold, Tamás Horváth

Overview

It is our pleasure to present the proceedings of Discovery Science 2008, the 11th International Conference on Discovery Science held in Budapest, Hungary, October 13-16, 2008. It was co-located with ALT 2008, the 19th International Conference on Algorithmic Learning Theory, whose proceedings are available in the twin volume LNAI 5254. This combination of DS and ALT conferences has been successfully organized each year since 2002. It provides a forum for the researchersworking on many different aspects of scientific discovery. Indeed, ALT/DS 2008 covered both the possibility to automate part of the scientific discovery and the necessary support to the human process of discovery inscience. Interestingly, this co-location also provided the opportunity for an exciting joint program of tutorials and invited talks. The number of submitted papers was 58, i.e., slightly more than the previous year. The Program Committee members were involved in a rigorous selection process based on three reviews per paper. At the end, we selected 26 long papers thanks to the recommendations of the experts based on relevance, novelty, significance, technical quality, and clarity. Although some short papers were submitted, none of them was selected.

Product Details

ISBN-13:	9783540884101
Publisher:	Springer Berlin Heidelberg
Publication date:	11/14/2008
Series:	Lecture Notes in Computer Science , #5255
Edition description:	2008
Pages:	348
Product dimensions:	6.10(w) x 9.40(h) x 0.90(d)

Table of Contents

Invited Papers.- On Iterative Algorithms with an Information Geometry Background.- Visual Analytics: Combining Automated Discovery with Interactive Visualizations.- Some Mathematics Behind Graph Property Testing.- Finding Total and Partial Orders from Data for Seriation.- Computational Models of Neural Representations in the Human Brain.- Learning.- Unsupervised Classifier Selection Based on Two-Sample Test.- An Empirical Investigation of the Trade-Off between Consistency and Coverage in Rule Learning Heuristics.- Learning Model Trees from Data Streams.- Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees.- Ensemble-Trees: Leveraging Ensemble Power Inside Decision Trees.- A Comparison between Neural Network Methods for Learning Aggregate Functions.- Feature Selection.- Smoothed Prediction of the Onset of Tree Stem Radius Increase Based on Temperature Patterns.- Feature Selection in Taxonomies with Applications to Paleontology.- Associations.- Deduction Schemes for Association Rules.- Constructing Iceberg Lattices from Frequent Closures Using Generators.- Discovery Processes.- Learning from Each Other.- Comparative Evaluation of Two Systems for the Visual Navigation of Encyclopedia Knowledge Spaces.- A Framework for Knowledge Discovery in a Society of Agents.- Learning and Chemistry.- Active Learning for High Throughput Screening.- An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules.- Mining Intervals of Graphs to Extract Characteristic Reaction Patterns.- Clustering.- Refining Pairwise Similarity Matrix for Cluster Ensemble Problem with Cluster Relations.- Input Noise Robustness and Sensitivity Analysis to Improve Large Datasets Clustering by Using the GRID.- An Integrated Graph and Probability Based Clustering Framework for Sequential Data.- Cluster Analysis in Remote Sensing Spectral Imagery through Graph Representation and Advanced SOM Visualization.- Structured Data.- Mining Unordered Distance-Constrained Embedded Subtrees.- Finding Frequent Patterns from Compressed Tree-Structured Data.- A Modeling Approach Using Multiple Graphs for Semi-Supervised Learning.- Text Analysis.- String Kernels Based on Variable-Length-Don’t-Care Patterns.- Unsupervised Spam Detection by Document Complexity Estimation.- A Probabilistic Neighbourhood Translation Approach for Non-standard Text Categorisation.