


default search action
11th DS 2008: Budapest, Hungary
- Jean-François Boulicaut, Michael R. Berthold, Tamás Horváth:

Discovery Science, 11th International Conference, DS 2008, Budapest, Hungary, October 13-16, 2008. Proceedings. Lecture Notes in Computer Science 5255, Springer 2008, ISBN 978-3-540-88410-1
Invited Papers
- Imre Csiszár:

On Iterative Algorithms with an Information Geometry Background. 1 - Daniel A. Keim, Florian Mansmann, Daniela Oelke, Hartmut Ziegler:

Visual Analytics: Combining Automated Discovery with Interactive Visualizations. 2-14 - László Lovász:

Some Mathematics Behind Graph Property Testing. 15 - Heikki Mannila:

Finding Total and Partial Orders from Data for Seriation. 16-25 - Tom M. Mitchell:

Computational Models of Neural Representations in the Human Brain. 26-27
Learning
- Timo Aho, Tapio Elomaa, Jussi Kujala:

Unsupervised Classifier Selection Based on Two-Sample Test. 28-39 - Frederik Janssen, Johannes Fürnkranz:

An Empirical Investigation of the Trade-Off between Consistency and Coverage in Rule Learning Heuristics. 40-51 - Elena Ikonomovska, João Gama:

Learning Model Trees from Data Streams. 52-63 - Beau Piccart, Jan Struyf, Hendrik Blockeel

:
Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees. 64-75 - Albrecht Zimmermann:

Ensemble-Trees: Leveraging Ensemble Power Inside Decision Trees. 76-87 - Werner Uwents, Hendrik Blockeel

:
A Comparison between Neural Network Methods for Learning Aggregate Functions. 88-99
Feature Selection
- Mikko Korpela, Harri Mäkinen, Mika Sulkava, Pekka Nöjd, Jaakko Hollmén:

Smoothed Prediction of the Onset of Tree Stem Radius Increase Based on Temperature Patterns. 100-111 - Gemma C. Garriga, Antti Ukkonen, Heikki Mannila:

Feature Selection in Taxonomies with Applications to Paleontology. 112-123
Associations
- José L. Balcázar:

Deduction Schemes for Association Rules. 124-135 - Laszlo Szathmary, Petko Valtchev

, Amedeo Napoli, Robert Godin:
Constructing Iceberg Lattices from Frequent Closures Using Generators. 136-147
Discovery Processes
- Christopher Dartnell, Eric Martin, Jean Sallantin:

Learning from Each Other. 148-159 - Wolfgang Kienreich, Peter Kraker

:
Comparative Evaluation of Two Systems for the Visual Navigation of Encyclopedia Knowledge Spaces. 160-171 - Gauvain Bourgne, Vincent Corruble:

A Framework for Knowledge Discovery in a Society of Agents. 172-184
Learning and Chemistry
- Kurt De Grave, Jan Ramon, Luc De Raedt

:
Active Learning for High Throughput Screening. 185-196 - Leander Schietgat, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel

:
An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules. 197-209 - Frédéric Pennerath, Géraldine Polaillon, Amedeo Napoli:

Mining Intervals of Graphs to Extract Characteristic Reaction Patterns. 210-221
Clustering
- Natthakan Iam-on

, Tossapon Boongoen
, Simon M. Garrett:
Refining Pairwise Similarity Matrix for Cluster Ensemble Problem with Cluster Relations. 222-233 - Alberto Faro, Daniela Giordano, Francesco Maiorana:

Input Noise Robustness and Sensitivity Analysis to Improve Large Datasets Clustering by Using the GRID. 234-245 - Haytham Elghazel, Tetsuya Yoshida, Mohand-Said Hacid:

An Integrated Graph and Probability Based Clustering Framework for Sequential Data. 246-258 - Kadim Tasdemir, Erzsébet Merényi:

Cluster Analysis in Remote Sensing Spectral Imagery through Graph Representation and Advanced SOM Visualization. 259-271
Structured Data
- Fedja Hadzic, Henry Tan, Tharam S. Dillon:

Mining Unordered Distance-Constrained Embedded Subtrees. 272-283 - Seiji Murakami, Koichiro Doi, Akihiro Yamamoto:

Finding Frequent Patterns from Compressed Tree-Structured Data. 284-295 - Akihiko Izutani, Kuniaki Uehara:

A Modeling Approach Using Multiple Graphs for Semi-Supervised Learning. 296-307
Text Analysis
- Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda:

String Kernels Based on Variable-Length-Don't-Care Patterns. 308-318 - Takashi Uemura, Daisuke Ikeda, Hiroki Arimura:

Unsupervised Spam Detection by Document Complexity Estimation. 319-331 - Ata Kabán:

A Probabilistic Neighbourhood Translation Approach for Non-standard Text Categorisation. 332-343

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














