Abstract
This paper explores the customized learning from specific to general for classification learning. Our novel learning framework called SUPE customizes its learning process to the instance to be classified called query instance. The data representation in SUPE is also customized to the query instance. Given a query instance, the training data is transformed into a query matrix, from which useful patterns are discovered for learning. The final prediction of the class label is performed by combining some statistics of the discovered useful patterns. We show that SUPE conducts the search from specific to general in a significantly reduced hypothesis space. The query matrix also facilitates the complicated operations in SUPE. The experimental results on benchmark data sets are encouraging.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blake, C., Keogh, E., Merz, C.: UCI repository of machine learning databases, http://www.ics.uci.edu/~mlearn/MLRepository.html
Cohen, W.: Fast effective rule induction. In: Proceedings of the Twelfth International Conference on Machine Learning, pp. 115–123 (1995)
Cohen, W., Singer, Y.: A simple, fast, and effective rule learner. In: Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence, pp. 335–342 (1999)
Han, Y., Lam, W.: Lazy learning by scanning memory image lattice. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp. 407–423 (2004)
Han, Y., Lam, W.: Lazy learning for classification based on query projections. In: Proceedings of the 2005 SIAM International Conference on Data Mining, pp. 227–238 (2005)
Lam, W., Han, Y.: Automatice textual document categorization based on generalized instance sets and a metamodel. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(5), 628–633 (2003)
Li, W., Han, J., Pei, J.: Accurate and efficient classification based on multiple class-association rules. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp. 369–376 (2001)
Mehta, M., Rissanen, J., Agrawal, R.: MDL-based decision tree pruning. In: Proceedings of the First International Conference on Knowledge Discovery and Data Mining, KDD 1995, pp. 216–221 (1995)
Mitchell, T.: Machine Learning. McGraw-Hill, New York (1997)
Weiss, S., Indurkhya, N.: Lightweight rule induction. In: Proceedings of the International Conference on Machine Learning (ICML), pp. 1135–1142. Morgan Kaufmann, San Francisco (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, Y., Lam, W. (2006). Exploring Query Matrix for Support Pattern Based Classification Learning. In: Yeung, D.S., Liu, ZQ., Wang, XZ., Yan, H. (eds) Advances in Machine Learning and Cybernetics. Lecture Notes in Computer Science(), vol 3930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11739685_22
Download citation
DOI: https://doi.org/10.1007/11739685_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33584-9
Online ISBN: 978-3-540-33585-6
eBook Packages: Computer ScienceComputer Science (R0)