论文信息 - Lazy Learning by Scanning Memory Image Lattice

Lazy Learning by Scanning Memory Image Lattice

SMILE (Scanning Memory Image LatticE) is a lazy learning framework based on a memory image lattice scanning technique. To classify an unseen instance, the instances in the training set will generate a memory image lattice in terms of the similarities between the training instances and the unseen instance. An exploration algorithm of memory image lattice is designed to search an appropriate set of images of training instances to produce the final prediction. SMILE differs from other lazy learning algorithms in that it utilizes subsets of attribute values as much as possible. This design leads to a more flexible model which is less sensitive to data

Wai Lam | Yiqiu Han

[1] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .

[2] Andrew W. Moore,et al. The Racing Algorithm: Model Selection for Lazy Learners , 1997, Artificial Intelligence Review.

[3] Belur V. Dasarathy,et al. Nearest neighbor (NN) norms: NN pattern classification techniques , 1991 .

[4] Geoffrey I. Webb,et al. Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees , 1999, ICML.

[5] Belur V. Dasarathy,et al. Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design , 1994, IEEE Trans. Syst. Man Cybern..

[6] Ian H. Witten,et al. Data mining: practical machine learning tools and techniques with Java implementations , 2002, SGMD.

[7] Walter Daelemans,et al. IGTree: Using Trees for Compression and Classification in Lazy Learning Algorithms , 1997, Artificial Intelligence Review.

[8] Léon Bottou,et al. Local Learning Algorithms , 1992, Neural Computation.

[9] Ian H. Witten,et al. Data mining: practical machine learning tools and techniques, 3rd Edition , 1999 .

[10] Jerome H. Friedman,et al. Flexible Metric Nearest Neighbor Classification , 1994 .