The Handbook of Data Mining
CERN Document Server (European Organization for Nuclear Research)Published 1 January 2003
Nong Ye
Citations216
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
This bk is the 1st comprehensive one to feature systematic coverage of the concepts, techniques, examples, issues, software tools and future advancements of data mining. The demand for DM apps are increasing in indus, gov, & academia.
Keywords
Computer Science
Choice Reviews OnlineGenetic algorithms in search, optimization, and machine learning
49,278 Citations1989
This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
An Introduction to the Bootstrap
39,744 Citations1994Bradley Efron, Robert Tibshirani
Neural Networks: A Comprehensive Foundation
29,816 Citations1998Simon Haykin
Thorough, well-organized, and completely up to date, this book examines all the important aspects of this emerging technology, including the learning process, back-propagation learning, radial-basis function networks, self-organizing systems, modular networks, temporal processing and neurodynamics, and VLSI implementation of neural networks.
C4.5: Programs for Machine Learning
23,665 Citations1992J. R. Quinlan
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Choice Reviews OnlineNeural networks for pattern recognition
18,687 Citations1994
This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition, and is designed as a text, with over 100 exercises, to benefit anyone involved in the fields of neural computation and pattern recognition.
IEEE Transactions on Pattern Analysis and Machine IntelligenceStochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
17,980 Citations1984Stuart Geman, Donald Geman
The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
16,927 Citations1988Judea Pearl
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.
BiometrikaMonte Carlo sampling methods using Markov chains and their applications
15,200 Citations1970W. Keith Hastings
Machine LearningInduction of Decision Trees
14,815 Citations1986J. R. Quinlan
This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail, which is described in detail.
Bayesian Data Analysis
13,688 Citations2003Andrew Gelman, John B. Carlin +2 more
Mathematics of Control Signals and SystemsApproximation by superpositions of a sigmoidal function
13,684 Citations1989George Cybenko
The Annals of Mathematical StatisticsA Stochastic Approximation Method
9,581 Citations1951Herbert Robbins, Sutton Monro
Biological CyberneticsSelf-organized formation of topologically correct feature maps
9,519 Citations1982Teuvo Kohonen
In a simple network of adaptive physical elements which receives signals from a primary event space, the signal representations are automatically mapped onto a set of output responses in such a way that the responses acquire the same topological order as that of the primary events.
Springer series in information sciencesSelf-Organization and Associative Memory
8,770 Citations1989Teuvo Kohonen
IEEE Transactions on Neural NetworksIdentification and control of dynamical systems using neural networks
8,008 Citations1990Kumpati S. Narendra, K. Parthasarathy
It is demonstrated that neural networks can be used effectively for the identification and control of nonlinear dynamical systems and the models introduced are practically feasible.
TechnometricsIntroduction to Statistical Quality Control
7,900 Citations1992Roger Sauter, Douglas C. Montgomery
Cambridge University Press eBooksPattern Recognition and Neural Networks
6,468 Citations1996B. D. Ripley
ACM SIGMOD RecordMining frequent patterns without candidate generation
6,360 Citations2000Jiawei Han, Jian Pei +1 more
BiometrikaReversible jump Markov chain Monte Carlo computation and Bayesian model determination
5,929 Citations1995Peter J. Green
A new framework for the construction of reversible Markov chain samplers that jump between parameter subspaces of differing dimensionality is proposed, which is flexible and entirely constructive, and should have wide applicability in model determination problems.
IEEE ExpertData mining and knowledge discovery: making sense out of data
4,643 Citations1996U.M. Feyyad
Find loads of the data mining and knowledge discovery making sense out of data book catalogues in this site as the choice of you visiting this page.
Lecture notes in statisticsBayesian Learning for Neural Networks
4,375 Citations1996Radford M. Neal
Bayesian Learning for Neural Networks shows that Bayesian methods allow complex neural network models to be used without fear of the "overfitting" that can occur with traditional neural network learning methods.
Neural NetworksOn the approximate realization of continuous mappings by neural networks
4,220 Citations1989Ken-ichi Funahashi
It is proved that any continuous mapping can be approximately realized by Rumelhart-Hinton-Williams' multilayer neural networks with at least one hidden layer whose output functions are sigmoid functions.
TechnometricsApplied Statistics and Probability for Engineers
3,975 Citations1995Melvin Alexander, Douglas C. Montgomery +1 more
Machine LearningA Bayesian Method for the Induction of Probabilistic Networks from Data
3,525 Citations1992Gregory F. Cooper, Edward H. Herskovits
This paper presents a Bayesian method for constructing probabilistic networks from databases, focusing on constructing Bayesian belief networks, and extends the basic method to handle missing data and hidden variables.
Machine LearningLearning Bayesian Networks: The Combination of Knowledge and Statistical Data
3,242 Citations1995David Heckerman, Dan Geiger +1 more
A methodology for assessing informative priors needed for learning Bayesian networks from a combination of prior knowledge and statistical data is developed and how to compute the relative posterior probabilities of network structures given data is shown.
Lecture notes in computer scienceNaive (Bayes) at forty: The independence assumption in information retrieval
2,092 Citations1998David Lewis
The naive Bayes classifier, currently experiencing a renaissance in machine learning, has long been a core technique in information retrieval, and some of the variations used for text retrieval and classification are reviewed.
Dynamic itemset counting and implication rules for market basket data
1,954 Citations1997Sergey Brin, Rajeev Motwani +2 more
A new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling and a new way of generating “implication rules” which are normalized based on both the antecedent and the consequent.
Journal of the Royal Statistical Society Series B (Statistical Methodology)On Bayesian Analysis of Mixtures with an Unknown Number of Components (with discussion)
1,913 Citations1997Sylvia Richardson, Peter J. Green
Applied Physics Letters10.1162/15324430152748236
1,869 Citations2000
It is demonstrated that by exploiting a probabilistic Bayesian learning framework, the 'relevance vector machine' (RVM) can derive accurate prediction models which typically utilise dramatically fewer basis functions than a comparable SVM while offering a number of additional advantages.
Mining quantitative association rules in large relational tables
1,484 Citations1996Ramakrishnan Srikant, Rakesh Agrawal
This work deals with quantitative attributes by fine-partitioning the values of the attribute and then combining adjacent partitions as necessary and introduces measures of partial completeness which quantify the information lost due to partitioning.
KybernetikSelf-organization of orientation sensitive cells in the striate cortex
1,481 Citations1973Chr. von der Malsburg
A nerve net model for the visual cortex of higher vertebrates is presented and a simple learning procedure is shown to be sufficient for the organization of some essential functional properties of single units.
An effective hash-based algorithm for mining association rules
1,412 Citations1995Jong Soo Park, Ming-Syan Chen⋆ +1 more
The number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods, thus resolving the performance bottleneck, and allows us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly.
TechnometricsExponentially Weighted Moving Average Control Schemes: Properties and Enhancements
1,372 Citations1990James M. Lucas, Michael S. Saccucci
The recognition that an EWMA control scheme can be represented as a Markov chain allows its properties to be evaluated more easily and completely than has previously been done.
Lecture notes in computer scienceDiscovering Frequent Closed Itemsets for Association Rules
1,361 Citations1999Nicolas Pasquier, Yves Bastide +2 more
This paper proposes a new algorithm, called A-Close, using a closure mechanism to find frequent closed itemsets, and shows that this approach is very valuable for dense and/or correlated data that represent an important part of existing databases.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Bayesian Model Choice: Asymptotics and Exact Calculations
1,239 Citations1994Alan E. Gelfand, Dipak K. Dey
A general predictive density is presented which includes all proposed Bayesian approaches the authors are aware of and using Laplace approximations they can conveniently assess and compare asymptotic behavior of these approaches.
Journal of the American Statistical AssociationModel Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
1,234 Citations1994David Madigan, Adrian E. Raftery
Neural ComputationFirst- and Second-Order Methods for Learning: Between Steepest Descent and Newton's Method
1,193 Citations1992Roberto Battiti
First- and second-order optimization methods for learning in feedforward neural networks are reviewed to illustrate the main characteristics of the different methods and their mutual relations.
TechnometricsA Multivariate Exponentially Weighted Moving Average Control Chart
1,148 Citations1992Cynthia A. Lowry, William H. Woodall +2 more
Machine LearningA Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
1,132 Citations2000Tjen-Sien Lim, Wei‐Yin Loh +1 more
Among decision tree algorithms with univariate splits, C4.5, IND-CART, and QUEST have the best combinations of error rate and speed, but C 4.5 tends to produce trees with twice as many leaves as those fromIND-Cart and QUEST.
International Statistical ReviewBayesian Graphical Models for Discrete Data
1,115 Citations1995David Madigan, Jeremy York +1 more
New algorithms for fast discovery of association rules
1,112 Citations1997Mohammed J. Zaki, Srinivasan Parthasarathy +2 more
New algorithms for fast association mining, which scan the database only once, are presented, addressing the open question whether all the rules can be efficiently extracted in a single database pass.
Sampling Large Databases for Association Rules
1,079 Citations1996Hannu Toivonen
New algorithms that reduce the database activity considerably by picking a Random sample, to find using this sample all association rules that probably hold in the whole database, and then to verify the results with the rest of the database.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Bayesian Model Choice Via Markov Chain Monte Carlo Methods
1,017 Citations1995Bradley P. Carlin, Siddhartha Chib
This paper presents a framework for Bayesian model choice, along with an MCMC algorithm that does not suffer from convergence difficulties, and applies equally well to problems where only one model is contemplated but its proper size is not known at the outset.
Data Mining and Knowledge DiscoveryAutomatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
971 Citations1998Sreerama K. Murthy
This paper surveys existing work on decision tree construction, attempting to identify the important issues involved, directions the work has taken and the current state of the art.
IEEE Transactions on Neural NetworksSelf organization of a massive document collection
911 Citations2000Teuvo Kohonen, Samuel Kaski +5 more
A system that is able to organize vast document collections according to textual similarities based on the self-organizing map (SOM) algorithm, based on 500-dimensional vectors of stochastic figures obtained as random projections of weighted word histograms.
Computer systems that learn: classification and prediction methods from statistics, neural nets, machine learning, and expert systems
906 Citations1991Sholom M. Weiss, Casimir A. Kulikowski
This book discusses how to Estimate the True Performance of a Learning System, and the Importance of Unbiased Error Rate Estimation, and Machine Learning: Easily Understood Decision Rules.
Proceedings of the Royal Society of London. Series B, Biological sciencesHow patterned neural connections can be set up by self-organization
834 Citations1976David Willshaw, C. von der Malsburg
Without needing to make any elaborate assumptions about its structure or about the operations its elements are to carry out, it is shown that the mappings are set up in a system- to-system rather than a cell-to-cell fashion.
Wiley StatsRef: Statistics Reference Online<scp>B</scp>ayesian Survival Analysis
802 Citations2014Joseph G. Ibrahim, Ming‐Hui Chen +1 more
The American StatisticianBayesian Data Mining in Large Frequency Tables, with an Application to the FDA Spontaneous Reporting System
770 Citations1999William DuMouchel
Here, a baseline or null hypothesis expected frequency is constructed for each cell, and screening criteria for ranking the cell deviations of observed from expected count are suggested and compared.
Finding interesting rules from large sets of discovered association rules
717 Citations1994Mika Klemettinen, Heikki Mannila +3 more
It is shown how a simple formalism of rule templates makes it possible to easily describe the structure of interesting rules, and how a visualization tool interfaces with rule templates.
Lecture notes in computer scienceThe power of decision tables
707 Citations1995Ron Kohavi
Experimental results show that on artificial and real-world domains containing only discrete features, IDTM, an algorithm inducing decision tables, can sometimes outperform state-of-the-art algorithms such as C4.5.
Journal of the Operational Research SocietyBayesian Forecasting and Dynamic Models (2nd edn)
683 Citations1998F P Wheeler
IIE TransactionsA review of multivariate control charts
682 Citations1995Cynthia A. Lowry, Douglas C. Montgomery
IEEE Transactions on Knowledge and Data EngineeringWhat makes patterns interesting in knowledge discovery systems
675 Citations1996Abraham Silberschatz, Alexander Tuzhilin
The focus of the paper is on studying subjective measures of interestingness, which are classified into actionable and unexpected, and the relationship between them is examined.
Mining the most interesting rules
651 Citations1999Roberto J. Bayardo, Rakesh Agrawal
It is argued that by returning a broader set of rules than previous algorithms, these techniques allow for improved insight into the data and support more user-interaction in the optimized rule-mining process.
Prediction with Gaussian Processes: From Linear Regression to Linear Prediction and Beyond
639 Citations1998Christopher K. I. Williams
The main aim of this paper is to provide a tutorial on regression with Gaussian processes, starting from Bayesian linear regression, and showing how by a change of viewpoint one can see this method as a Gaussian process predictor based on priors over functions, rather than on prior over parameters.
Statistics and ComputingBayesian parameter estimation via variational methods
610 Citations2000Tommi Jaakkola, Michael I. Jordan
It is shown that an accurate variational transformation can be used to obtain a closed form approximation to the posterior distribution of the parameters thereby yielding an approximate posterior predictive model.
NetworksSequential updating of conditional probabilities on directed graphical structures
533 Citations1990David J. Spiegelhalter, Steffen L. Lauritzen
It is shown how one can introduce imprecision into such probabilities as a data base of cases accumulates and how to take advantage of a range of well-established statistical techniques.
TechnometricsMultivariate Generalizations of Cumulative Sum Quality-Control Schemes
510 Citations1988Ronald B. Crosier
H-mine: hyper-structure mining of frequent patterns in large databases
408 Citations2002Jian Pei, Jiawei Han +4 more
This study shows that H-mine has high performance in various kinds of data, outperforms the previously developed algorithms in different settings, and is highly scalable in mining large databases.
Efficiently mining maximal frequent itemsets
391 Citations2002Karam Gouda, Mohammed J. Zaki
GenMax is a backtracking search based algorithm for mining maximal frequent itemsets that uses a novel technique called progressive focusing to perform maximality checking, and diffset propagation to perform fast frequency computation.
Journal of Quality TechnologyDesign of Exponentially Weighted Moving Average Schemes
390 Citations1989Stephen V. Crowder
Journal of Quality TechnologyDecomposition of <i>T</i> 2 for Multivariate Control Chart Interpretation
386 Citations1995Robert Mason, Nola D. Tracy +1 more
ScienceDirect Cortical Representation of Drawing
375 Citations1994Andrew B. Schwartz
A population vector method was used to visualize the motor cortical representation of the hand's trajectory made by rhesus monkeys as they drew spirals and showed that the movement trajectory is an important determinant of motor cortical activity.
IEEE Transactions on ComputersA Recursive Partitioning Decision Rule for Nonparametric Classification
367 Citations1977Friedman
A new criterion for deriving a recursive partitioning decision rule for nonparametric classification is presented and the resulting decision rule is asymptotically Bayes' risk efficient.
Constraint-based rule mining in large, dense databases
359 Citations1999Roberto J. Bayardo, R. K. Agrawal +1 more
Data Mining and Knowledge DiscoveryRainForest—A Framework for Fast Decision Tree Construction of Large Datasets
349 Citations2000Johannes Gehrke, Raghu Ramakrishnan +1 more
This paper presents a unifying framework called Rain Forest for classification tree construction that separates the scalability aspects of algorithms for constructing a tree from the central features that determine the quality of the tree.
BiometrikaA Bayesian CART algorithm
317 Citations1998D. Dension
A stochastic search form of classification and regression tree (CART) analysis is proposed, motivated by a Bayesian model and an approximation to a probability distribution over the space of possible trees is explored.
ACM SIGMOD RecordBOAT—optimistic decision tree construction
288 Citations1999Johannes Gehrke, Venkatesh Ganti +2 more
Empirical bayes screening for multi-item associations
269 Citations2001William DuMouchel, Daryl Pregibon
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item sets, and defines a 95% Bayesian lower confidence limit for the "interestingness" measure of every item set.
Statistics and ComputingApplications of a general propagation algorithm for probabilistic expert systems
238 Citations1992A. P. Dawid
This paper analyses a ‘flow-propagation’ algorithm for calculating marginal and conditional distributions in a probabilistic expert system in detail, and shows how it can be modified to perform other tasks, including maximization of the joint density and simultaneous 'fast retraction' of evidence entered on several variables.
Knowledge-Based SystemsOn rule interestingness measures
236 Citations1999Alex A. Freitas
This article aims at drawing attention to several factors related to rule interestingness that have been somewhat neglected in the literature, and introducing a new criterion to measure attribute surprisingness, as a factor influencing the interestingness of discovered rules.
IEEE Intelligent Systems and their ApplicationsAnalyzing the subjective interestingness of association rules
232 Citations2000Bing Liu, Wynne Hsu +2 more
This article describes how the interestingness analysis system (IAS) leverages the user's existing domain knowledge to analyze discovered associations and then rank discovered rules according to various interestingness criteria, such as conformity and various types of unexpectedness.
IEEE Transactions on Semiconductor ManufacturingA neural-network approach to recognize defect spatial pattern in semiconductor fabrication
230 Citations2000Feilong Chen, Shu-Fan Liu
The results show that ART1 architecture can recognize the similar defect spatial patterns more easily and correctly than another unsupervised neural network, self-organizing map (SOM).
Journal of Quality TechnologyDesigning a Multivariate EWMA Control Chart
225 Citations1997Sharad S. Prabhu, George C. Runger
A multivariate exponentially weighted moving average control chart can be used to improve the detection of small shifts in multivariate statistical process control.
Medical Entomology and ZoologyApplied Bayesian Forecasting and Times Series Analysis
222 Citations1994Andy Pole, Mike West +1 more
MDL-based decision tree pruning
183 Citations1995Manish Mehta, J. Rissanen +1 more
A new algorithm is presented that intuitively captures the primary goal of reducing the misclassification error and achieves good accuracy, small trees, and fast execution times in the MDL pruning algorithm.
Statistics and ComputingMML clustering of multi-state, Poisson, von Mises circular and Gaussian distributions
166 Citations2000Chris S. Wallace, David L. Dowe
This work outlines how MML is used for statistical parameter estimation, and how the MML mixture modelling program, Snob, uses the message lengths from various parameter estimates to enable it to combine parameter estimation with selection of the number of components and estimation of the relative abundances of the components.
Society for Industrial and Applied Mathematics eBooksProbabilistic Expert Systems
161 Citations1996Glenn Shafer
The aim of this monograph is to provide a Discussion of the Foundations of Probability Distributions and their Applications to Architecture.
A statistical theory for quantitative association rules
147 Citations1999Yonatan Aumann, Yehuda Lindell
Quality EngineeringTHE STATISTICAL DESIGN OF CUSUM CHARTS
144 Citations1993William H. Woodall, Benjamin M. Adams
It has been shown that this method of N.L. Johnson results in CUSUM charts with statistical properties quite differen..
A computer host-based user anomaly detection system using the self-organizing map
119 Citations2000A. Hoglund, Kimmo Hätönen +1 more
A prototype UNIX anomaly detection system has been constructed and contains an automatic anomaly detection component that uses a test based on the self-organizing map to test if user behavior is anomalous.
Journal of the American Statistical AssociationBayesian Analysis: A Look at Today and Thoughts of Tomorrow
109 Citations2000James O. Berger
The vignette series concludes with 22 contributions in Theory and Methods with a scope is broad, but by no means exhaustive, and the writers are all experts in their fields, and bring a perception and view that truly highlights each subject area.
Applied Physics Letters10.1162/153244301753683717
107 Citations2000
It is found that Bayes point machines consistently outperform support vector machines on both surrogate data and real-world benchmark data sets and it is demonstrated that the real-valued output of single Bayes points on novel test points is a valid confidence measure and leads to a steady decrease in generalisation error when used as a rejection criterion.
Journal of Quality TechnologyAn Optimal Design of CUSUM Quality Control Charts
105 Citations1991F. F. Gan
An optimal design of C USUM control charts is reviewed and plots of chart parameters are given which enable the chart parameters of an optimal CUSUM chart to be determined easily.
Interestingness via what is not interesting
100 Citations1999Sigal Sahar
This work presents a simple and short process of eliminating a substantial portion of uninteresting association rules in a list outputted by a data-mining algorithm, and presents representative results of executions of the algorithm over three real databases.
Springer texts in statisticsThe Metropolis—Hastings Algorithm
93 Citations2004Christian P. Robert, George Casella
This chapter is the first of a series on simulation methods based on Markov chains and contains a description of the most general algorithm of all, the Metropolis–Hastings algorithm.
Knowledge Discovery and Data MiningEvaluating the interestingness of characteristic rules
92 Citations1996Micheline Kamber, Rajjan Shinghal
This paper proposes IC++, an interestingness measure for characteristic rules based on necessity and sufficiency (Duda, Gaschnig, & Hart 1981), which obeys each of the rule interestingness principles, unlike the other measures studied.
Discovering associations with numeric variables
89 Citations2001Geoffrey I. Webb
This paper further develops Aumann and Lindell's proposal for a variant of association rules for which the consequent is a numeric variable and it is argued that these rules can discover useful interactions with numeric data that cannot be discovered directly using traditional association rules with discretization.
IEEE Transactions on Neural NetworksHandwritten digit recognition by adaptive-subspace self-organizing map (ASSOM)
69 Citations1999Bailing Zhang, Minyue Fu +2 more
This paper proposes a method to realize ASSOM using a neural learning algorithm in nonlinear autoencoder networks, which has the advantage of numerical stability.
Journal of Quality TechnologyProbability and Statistics for Engineering and the Sciences, 5th Ed.
67 Citations2002Connie M. Borror
Communication in Statistics- Theory and MethodsEliciting prior information to enhance the predictive performance of bayesian graphical models
59 Citations1995David Madigan, Jonathan R. Gavrin +1 more
This work focuses on assessment of predictive performance and provides two techniques for improving the predictive performance of Bayesian graphical models and describes a technique for eliciting a prior distribution for competing models from domain experts.
Journal of Statistical Planning and InferenceBayesian measures of surprise for outlier detection
51 Citations2002M. J. Bayarri, Javier Morales
Easy, preliminary checks in which these assessments can often be avoided may prove useful for outlier detection in normal models are found.
…