FEEDBACK Smiley face
Discovery Science 11th International Conference, DS 2008, Budapest, Hungary, October 13-16, 2008. Proceedings / [electronic resource] : edited by Jean-François Jean-Fran, Michael R. Berthold, Tamás Horváth. - XII, 348 p. 96 illus. online resource. - Lecture Notes in Computer Science, 5255 0302-9743 ; . - Lecture Notes in Computer Science, 5255 .

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.

This book constitutes the refereed proceedings of the 11th International Conference on Discovery Science, DS 2008, held in Budapest, Hungary, in October 2008, co-located with the 19th International Conference on Algorithmic Learning Theory, ALT 2008. The 26 revised long papers presented together with 5 invited papers were carefully reviewed and selected from 58 submissions. The papers address all current issues in the area of development and analysis of methods for intelligent data analysis, knowledge discovery and machine learning, as well as their application to scientific knowledge discovery. The papers are organized in topical sections on learning, feature selection, associations, discovery processes, learning and chemistry, clustering, structured data, and text analysis.


10.1007/978-3-540-88411-8 doi

Computer science.
Database management.
Data mining.
Information storage and retrieval.
Artificial intelligence.
Application software.
Computer Science.
Artificial Intelligence (incl. Robotics).
Data Mining and Knowledge Discovery.
Database Management.
Information Storage and Retrieval.
Computer Appl. in Administrative Data Processing.
Computer Appl. in Social and Behavioral Sciences.

Q334-342 TJ210.2-211.495


© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: