Pattern Recognition and String Matching (Combinatorial Optimization)
1 edition
Our rough guess is there are 193,000 words in this book.
At a pace averaging 250 words per minute, this book will take 12 hours and 52 minutes to read. With a half hour per day, this will take 26 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
- Dechang Chen (Editor) - Contributor
- Xiuzhen Cheng (Editor) - Contributor
Publication
2003-11-30 - Springer
Language
English
Word Count
193,000 words, Guess
Page Count
772 pages
Physical Format
Hardcover
Identifiers
- ISBN-101402009534
- ISBN-139781402009532
- Library of Congress Control Number2002040776
- Better World Books9781402009532
- Open LibraryOL8370328M
Classifications
- LCCTA1630 .C47 2002
- LCCQA1-939
First Sentence
Traditionally, learning algorithms and pattern recognition methods have been sorted into two broad groups: supervised and unsupervised (predictive and informative in Data Mining terminology) whether training data is available or not.
Subjects
Topics
Other Editions
- Pattern Recognition and String Matching (Combinatorial Optimization)
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!