Hoffmann / Scheffer / Motoda | Discovery Science | Buch | 978-3-540-29230-2 | sack.de

Buch, Englisch, Band 3735, 404 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1310 g

Reihe: Lecture Notes in Computer Science

Hoffmann / Scheffer / Motoda

Discovery Science

8th International Conference, DS 2005, Singapore, October 8-11, 2005, Proceedings

Buch, Englisch, Band 3735, 404 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1310 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-29230-2
Verlag: Springer Berlin Heidelberg


two members of the Program Committee of international expertsinthe?eld.Theselectionwasmadeaftercarefulevaluationofeachpaper based on originality, technical quality, relevance to the ?eld of discovery science, and clarity.
Hoffmann / Scheffer / Motoda Discovery Science jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Invited Papers.- Invention and Artificial Intelligence.- Algorithms and Software for Collaborative Discovery from Autonomous, Semantically Heterogeneous, Distributed Information Sources.- Training Support Vector Machines via SMO-Type Decomposition Methods.- The Robot Scientist Project.- The Arrowsmith Project: 2005 Status Report.- Regular Contributions - Long Papers.- Practical Algorithms for Pattern Based Linear Regression.- Named Entity Recognition for the Indonesian Language: Combining Contextual, Morphological and Part-of-Speech Features into a Knowledge Engineering Approach.- Bias Management of Bayesian Network Classifiers.- A Bare Bones Approach to Literature-Based Discovery: An Analysis of the Raynaud’s/Fish-Oil and Migraine-Magnesium Discoveries in Semantic Space.- Assisting Scientific Discovery with an Adaptive Problem Solver.- Cross-Language Mining for Acronyms and Their Completions from the Web.- Mining Frequent ?-Free Patterns in Large Databases.- An Experiment with Association Rules and Classification: Post-Bagging and Conviction.- Movement Analysis of Medaka (Oryzias Latipes) for an Insecticide Using Decision Tree.- Support Vector Inductive Logic Programming.- Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences.- The q-Gram Distance for Ordered Unlabeled Trees.- Monotone Classification by Function Decomposition.- Learning On-Line Classification via Decorrelated LMS Algorithm: Application to Brain-Computer Interfaces.- An Algorithm for Mining Implicit Itemset Pairs Based on Differences of Correlations.- Pattern Classification via Single Spheres.- SCALETRACK: A System to Discover Dynamic Law Equations Containing Hidden States and Chaos.- Exploring Predicate-Argument Relations for Named Entity Recognition in the MolecularBiology Domain.- Massive Biomedical Term Discovery.- Active Constrained Clustering by Examining Spectral Eigenvectors.- Learning Ontology-Aware Classifiers.- Regular Contributions - Regular Papers.- Automatic Extraction of Proteins and Their Interactions from Biological Text.- A Data Analysis Approach for Evaluating the Behavior of Interestingness Measures.- Unit Volume Based Distributed Clustering Using Probabilistic Mixture Model.- Finding Significant Web Pages with Lower Ranks by Pseudo-Clique Search.- CLASSIC’CL: An Integrated ILP System.- Detecting and Revising Misclassifications Using ILP.- Project Reports.- Self-generation of Control Rules Using Hierarchical and Nonhierarchical Clustering for Coagulant Control of Water Treatment Plants.- A Semantic Enrichment of Data Tables Applied to Food Risk Assessment.- Knowledge Discovery Through Composited Visualization, Navigation and Retrieval.- A Tabu Clustering Method with DHB Operation and Mergence and Partition Operation.- Discovering User Preferences by Using Time Entries in Click-Through Data to Improve Search Engine Results.- Network Boosting for BCI Applications.- Rule-Based FCM: A Relational Mapping Model.- Effective Classifier Pruning with Rule Information.- Text Mining for Clinical Chinese Herbal Medical Knowledge Discovery.


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.