Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Advances in knowledge discovery in databases
Adhikari A., Adhikari J., Springer Publishing Company, Incorporated, New York, NY, 2014. 370 pp. Type: Book (978-3-319132-11-2)
Date Reviewed: May 27 2015

Several advances in techniques for obtaining nonexplicit information that is present in database systems are described in this book. It discusses a good number of problems and techniques from the point of view of what the authors call market basket databases.

The book does not present a unified theory of data mining. Instead, it is organized as a set of independent chapters that are almost self-contained papers on one topic, including a separate reference list for each chapter. The chapters have some internal loose connection in themes and notation.

The starting point of the book consists of the “classical” papers of data mining [1,2], which are briefly reviewed when presenting the first advanced topic in the book: conditional patterns. Another common point in all of the chapters lies in considering the pre-existence of a set of frequent itemsets, as is common in the data-mining literature.

The usual topics of knowledge discovery in databases are revisited with an expanded view. So, for example, going beyond the usual association rules, the topics of conditional patterns and Boolean expressions are covered. The topic of measuring associations between data items is also expanded with several new measures. Then the main topics of the book are tackled: mining several databases, time-stamped data, and joining different data sources.

Throughout the book, a similar pattern is used to present each chapter. It starts with a presentation of another problem of data mining, usually related to a previously mentioned problem, some theoretical discussion, an algorithm, and experimental results using a few standard benchmarks.

The content is interesting for readers with specific interests in data mining, but one would expect a little more care in the presentation of the material. In the initial chapters, there can be found tables with wrong entries, references pointing to the wrong sections, and lemmas/theorems with confusing statements. However, all of these problems are of a lesser nature, and all of them could have been eliminated with a detailed reading of the material by the authors.

With respect to the book’s content, the algorithms presented are also sometimes unrealistic, as they contain iterations over an exponential number of items, without the expected discussion on the limits of their applicability. Studying the algorithms, one is often led to believe that the subsequent experiments were developed over a small set of items, so as not to reach its intractable limit.

Reviewer:  Marcelo Finger Review #: CR143475 (1508-0682)
1) Agarwal, R.; Imielinski, T.; Swami, M. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD Conference on Management of Data. ACM, 1993, 207–216.
2) Wu, X.; Zhang, C.; Zhang, S. Efficient mining of both positive and negative association rules. ACM Transactions on Information Systems 22, 3(2004), 381–405.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Knowledge Acquisition (I.2.6 ... )
 
 
Data Mining (H.2.8 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Knowledge Acquisition": Date
Expertise transfer and complex problems: using AQUINAS as a knowledge-acquisition workbench for knowledge-based systems
Boose J., Bradshaw J. International Journal of Man-Machine Studies 26(1): 3-28, 1987. Type: Article
Aug 1 1988
Knowledge-based knowledge acquisition for a statistical consulting system
Gale W. International Journal of Man-Machine Studies 26(1): 55-64, 1987. Type: Article
Dec 1 1988
KNACK--report-driven knowledge acquisition
Klinker G., Bentolila J., Genetet S., Grimes M., McDermott J. International Journal of Man-Machine Studies 26(1): 65-79, 1987. Type: Article
Sep 1 1988
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy