An incremental method for finding multivariate splits for decision trees
Proceedings of the seventh international conference (1990) on Machine learning
Data mining: practical machine learning tools and techniques with Java implementations
Data mining: practical machine learning tools and techniques with Java implementations
Lazy Learning of Bayesian Rules
Machine Learning
Machine Learning
Artificial Intelligence Review - Special issue on lazy learning
Machine Learning
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Automatic Textual Document Categorization Based on Generalized Instance Sets and a Metamodel
IEEE Transactions on Pattern Analysis and Machine Intelligence
MEGA---the maximizing expected generalization algorithm for learning complex query concepts
ACM Transactions on Information Systems (TOIS)
DeEPs: A New Instance-Based Lazy Discovery and Classification System
Machine Learning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Data gravitation based classification
Information Sciences: an International Journal
Data envelopment analysis classification machine
Information Sciences: an International Journal
Gravitation based classification
Information Sciences: an International Journal
Hi-index | 0.07 |
We develop a customized classification learning method QPL, which is based on query projections. Given an instance to be classified (query instance), QPL explores the projections of the query instance (QPs), which are essentially subsets of attribute values shared by the query and training instances. QPL investigates the associated training data distribution of a QP to decide whether it is useful. The final prediction for the query is made by combining some statistics of the selected useful QPs. Unlike existing instance-based learning, QPL does not need to compute a distance measure between instances. The utilization of QPs for learning can explore a richer hypothesis space and achieve a balance between precision and robustness. Another characteristic of QPL is that the target class may vary for different query instances in a given data set. We have evaluated our method with synthetic and benchmark data sets. The results demonstrate that QPL can achieve good performance and high reliability.