AutoClass: A Bayesian Classification System
Elsevier eBooksPublished 1 January 1988
Peter Cheeseman, James G. Kelly, Matthew W. Self, John Stutz, Will Taylor, Don Freeman
Citations504
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 paper describes AutoClass II, a program for automatically discovering (inducing) classes from a database, based on a Bayesian statistical technique which automatically determines the most probable number of classes, their probabilistic descriptions, and the probability that each object is a member of each class. AutoClass has been tested on several large, real databases and has discovered previously unsuspected classes. There is no doubt that these classes represent new phenomena.
Keywords
Computer ScienceMathematics
Journal of the Royal Statistical Society Series B (Statistical Methodology)Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
49,657 Citations1977A. P. Dempster, N. M. Laird +1 more
Annals of EugenicsTHE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
14,727 Citations1936Ronald Aylmer Fisher
CERN Document Server (European Organization for Nuclear Research)Multivariate Analysis: Methods and Applications
1,920 Citations1984William R. Dillon, Matthew Goldstein
Multivariate Behavioral ResearchPATTERN CLUSTERING BY MULTIVARIATE MIXTURE ANALYSIS
604 Citations1970J. H. Wolfe
The maximum-likelihood theory and numerical solution techniques are developed for a fairly general class of distributions and the feasibility of the procedures is demonstrated by two examples of computer solutions for normal mixture models of the Fisher Iris data and of artify generated clusters with unequal covariance matrices.
IEEE Transactions on Pattern Analysis and Machine IntelligenceAutomated Construction of Classifications: Conceptual Clustering Versus Numerical Taxonomy
317 Citations1983Ryszard S. Michalski, Robert E. Stepp
A method for automated construction of classifications called conceptual clustering is described and compared to methods used in numerical taxonomy, in which descriptive concepts are conjunctive statements involving relations on selected object attributes and optimized according to an assumed global criterion of clustering quality.
Pattern RecognitionHow many clusters are best? - An experiment
230 Citations1987Richard C. Dubes
The modified Hubert index, proposed here for the first time, is shown to perform better than the Davies-Bouldin index under all experimental conditions and demonstrates the difficulty inherent in estimating the number of clusters.
IEEE Transactions on Pattern Analysis and Machine IntelligenceSynthesizing Statistical Knowledge from Incomplete Mixed-Mode Data
190 Citations1987Andrew K. C. Wong, David Chiu
The proposed method adopts an event-covering approach which covers a subset of statistically relevant outcomes in the outcome space of variable-pairs and can acquire statistical knowledge from incomplete mixed-mode data.
Cambridge University Press eBooksMaximum Entropy and Bayesian Methods in Applied Statistics
190 Citations1986J. H. Justice
Elsevier eBooksDECISION TREES AS PROBABILISTIC CLASSIFIERS
187 Citations1987J. R. Quinlan
This paper outlines extensions to the way a case is classified by a decision tree that address shortcomings in the way cases are classified by the decision tree.
Elsevier eBooksConceptual Clustering, Learning from Examples, and Inference
48 Citations1987Douglas Fisher
Results obtained by COBWEB, a conceptual clustering system that organizes data so as to maximize inference abilities, are described, which generalizes the performance requirements typically associated with the better known task of learning from examples.