Principles of Data Mining and Knowledge Discovery
4th European Conference, PKDD, 2000, Lyon, France, September 13-16, 2000 Proceedings (Lecture Notes ... / Lecture Notes in Artificial Intelligence)
1 edition
Our rough guess is there are 174,500 words in this book.
At a pace averaging 250 words per minute, this book will take 11 hours and 38 minutes to read. With a half hour per day, this will take 23 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Djamel A. Zighed (Editor) - Contributor
- Jan Komorowski (Editor) - Contributor
- Jan Zytkow (Editor) - Contributor
Publication
2000-10-13 - Springer
Language
English
Word Count
174,500 words, Guess
Page Count
698 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL9659197M
- ISBN-139783540410669
- ISBN-10354041066X
- OCLC Control Number44914182
- Library of Congress Control Number00045030
and 1 more
- Goodreads4083709
Classifications
- LCCQ334-342QA76.9.D35QA
Description
Principles of Data Mining and Knowledge Discovery: 4th European Conference, PKDD 2000 Lyon, France, September 13–16, 2000 Proceedings<br />Author: Djamel A. Zighed, Jan Komorowski, Jan Żytkow<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-41066-9<br /> DOI: 10.1007/3-540-45372-5<br /><br />Table of Contents:<p></p><ul><li>Multi-relational Data Mining, Using UML for ILP </li><li>An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data </li><li>Basis of a Fuzzy Knowledge Discovery System </li><li>Confirmation Rule Sets </li><li>Contribution of Dataset Reduction Techniques to Tree-Simplification and Knowledge Discovery </li><li>Combining Multiple Models with Meta Decision Trees </li><li>Materialized Data Mining Views </li><li>Approximation of Frequency Queries by Means of Free-Sets </li><li>Application of Reinforcement Learning to Electrical Power System Closed-Loop Emergency Control </li><li>Efficient Score-Based Learning of Equivalence Classes of Bayesian Networks </li><li>Quantifying the Resilience of Inductive Classification Algorithms </li><li>Bagging and Boosting with Dynamic Integration of Classifiers </li><li>Zoomed Ranking: Selection of Classification Algorithms Based on Relevant Performance Information </li><li>Some Enhancements of Decision Tree Bagging </li><li>Relative Unsupervised Discretization for Association Rule Mining </li><li>Mining Association Rules: Deriving a Superior Algorithm by Analyzing Today’s Approaches </li><li>Unified Algorithm for Undirected Discovery of Exception Rules </li><li>Sampling Strategies for Targeting Rare Groups from a Bank Customer Database </li><li>Instance-Based Classification by Emerging Patterns </li><li>Context-Based Similarity Measures for Categorical Databases</li></ul>
Subjects
Topics
Other Editions
- Principles of Data Mining and Knowledge Discovery: 4th European Conference, PKDD, 2000, Lyon, France, September 13-16, 2000 Proceedings (Lecture Notes ... / Lecture Notes in Artificial Intelligence)
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!