1996 AdHocAttributeValuePrediction

Jump to: navigation, search

Subject Headings: Lazy Model-based Supervised Classification Algorithm, Lazy Decision Tree Algorithm.


Cited By




The evolving ease and efficiency in accessing large amounts of data presents an opportunity to execute prediction tasks based on this data (Hunt, Marin, & Stone 1964). Research in learning-from-example has addressed this opportunity with algorithms that induce either decision structures (ID3) or classification rules (AQ15). Lazy learning research on the other hand, delay the model construction to strictly satisfy a prediction task (Aha, Kibler, & Albert 1991). To support a prediction query against a data set, current techniques require a large amount of preprocessing to either construct a complete domain model, or to determine attribute relevance. Our work in this area is to develop an algorithm that will automatically return a probabilistic classification rule for a prediction query with equal accuracy to current techniques but with no pre-processing requirements. The proposed algorithm, DBPredictor, combines the delayed model construction approach of lazy learning along with the information theoretic measure and top-down heuristic search of learning-from-example algorithms. The algorithm induces only the information required to satisfy the prediction query and avoids the attribute relevance tests required



 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
1996 AdHocAttributeValuePredictionGabor MelliAd Hoc Attribute-Value PredictionAAAI 1996https://www.aaai.org/Papers/AAAI/1996/AAAI96-247.pdf1996