AutoClass
Autoclass - A Bayesian Approach to Classification. We describe a Bayesian approach to the unsupervised discovery of classes in a set of cases, sometimes called finite mixture separation or clustering. The main difference between clustering and our approach is that we search for the “best” set of class descriptions rather than grouping the cases themselves. We describe our classes in terms of probability distribution or density functions, and the locally maximal posterior probability parameters. We rate our classifications with an approximate posterior probability of the distribution function w.r.t. the data, obtained by marginalizing over all the parameters. Approximation is necessitated by the computational complexity of the joint probability, and our marginalization is w.r.t. a local maxima in the parameter space. This posterior probability rating allows direct comparison of alternate density functions that differ in number of classes and/or individual class density functions. We discuss the rationale behind our approach to classification. We give the mathematical development for the basic mixture model, describe the approximations needed for computational tractability, give some specifics of models for several common attribute types, and describe some of the results achieved by the AutoClass program..
Keywords for this software
References in zbMATH (referenced in 70 articles )
Showing results 21 to 40 of 70.
Sorted by year (- Flores, M. Julia; Gámez, José A.; Martínez, Ana M.; Puerta, José M.: HODE: hidden one-dependence estimator (2009)
- Huang, Han-Shen; Yang, Bo-Hou; Chang, Yu-Ming; Hsu, Chun-Nan: Global and componentwise extrapolations for accelerating training of Bayesian networks and conditional random fields (2009) ioport
- Nielsen, Jens D.; Rumí, Rafael; Salmerón, Antonio: Supervised classification using probabilistic decision graphs (2009)
- Pfitzner, Darius; Leibbrandt, Richard; Powers, David: Characterization and evaluation of similarity measures for pairs of clusterings (2009) ioport
- Takahashi, Kazuko; Takamura, Hiroya; Okumura, Manabu: Direct estimation of class membership probabilities for multiclass classification using multiple scores (2009) ioport
- Zimmermann, Albrecht; De Raedt, Luc: Cluster-grouping: from subgroup discovery to clustering (2009)
- Glimcher, Leonid; Jin, Ruoming; Agrawal, Gagan: Middleware for data mining applications on clusters and grids (2008) ioport
- Kim, Hyoung-Rae; Chan, Philip K.: Learning implicit user interest hierarchy for context in personalization. (2008) ioport
- Sato, Taisuke; Kameya, Yoshitaka; Kurihara, Kenichi: Variational Bayes via propositionalized probability computation in PRISM (2008)
- Zhang, Nevin L.; Wang, Yi; Chen, Tao: Discovery of latent structures: experience with the CoIL challenge 2000 data set (2008)
- Domeniconi, Carlotta; Gunopulos, Dimitrios; Ma, Sheng; Yan, Bojun; Al-Razgan, Muna; Papadopoulos, Dimitris: Locally adaptive metrics for clustering high dimensional data (2007) ioport
- Jollois, F.-X.; Nadif, M.: Speed-up for the expectation-maximization algorithm for clustering categorical data (2007)
- Kim, Minkyong; Kotz, David: Periodic properties of user mobility and access-point popularity. (2007) ioport
- Ramamohanarao, Kotagiri; Fan, Hongjian: Patterns based classifiers (2007) ioport
- Vilalta, R.; Stepinski, T.; Achari, M.: An efficient approach to external cluster assessment with an application to Martian topography (2007) ioport
- Zhang, Yuping; Qian, Minping: The stochastic model and metastability of the gene network (2007)
- Allier, Bénédicte; Bali, Nadia; Emptoz, Hubert: Automatic accurate broken character restoration for patrimonial documents (2006) ioport
- Dong, Yihong; Zhuang, Yueting; Chen, Ken; Tai, Xiaoying: A hierarchical clustering algorithm based on fuzzy graph connectedness (2006)
- Kooptiwoot, S.; Salam, M. A.: IUI mining: human expert guidance of information theoretic network approach (2006) ioport
- Ling, Charles X.; Yang, Qiang: Discovering classification from data of multiple sources (2006) ioport