Abstract
With the rapid development of E-business and database, classification for high dimensions in large scale datasets becomes an important task of business intelligence. Recently, kernel-based methods have attracted more and more attention and have shown excellent performance in pattern recognition, machine learning and image classification etc. The common weakness of the kernel-based learning algorithms is that they cannot deal with a large dataset. In this paper, a novel classification method for large datasets named Sub-KFDA (Subspace classification based on Kernel Fisher Discriminant Analysis) is presented. A subspace mining approach based on frequent patterns and kernel-based fisher discriminant analysis is designed to decompose the initial large dataset classification problem into many small dataset classification problems. Experiment results on UCI datasets demonstrate that the proposed method has advantages in accuracy in comparison to other classification approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Müller, K.R., Mika, S., Rätsch, G., Tsuda, K., Schölkopf, B.: An Introduction to Kernel-Based Learning Algorithms. IEEE Trans. Neural Networks 12(2), 181–201 (2001)
Yang, J., Frangi, A.F., Yang, J., Zhang, D.: KPCA Plus LDA: A Complete Kernel Fisher Discriminant Framework for Feature Extraction and Recognition. IEEE Trans. Pattern Analysis and Machine Intelligence 27(2), 230–244 (2005)
Mika, S., Rätsch, G., Weston, J., Schölkopf, B., Müller, K.R.: Fisher discriminant analysis with kernels. In: Proc. IEEE Workshop Neural Networks, Signal Process. IX, pp. 41–48 (1999)
Xu, Y., Zhang, D., Jin, Z., et al.: A fast kernel-based nonlinear discriminant analysis for multi-class problems. Patterns Recognition 39, 1026–1033 (2006)
Cai, R., Hao, Z., Wen, W., Huang, H.: Kernel based gene expression pattern discovery and its application on cancer classification. Neurocomputing 73, 2562–2570 (2010)
Balachander, T., Kothari, R.: Introducing Locality and Softness in Subspace Classification. Pattern Analysis and Applications 2, 53–58 (1999)
Breiman, L.: Bagging predictors. Machine Learning 24(2), 123–140 (1996)
Ho, T.K.: The random subspace method for constructing decision forests. IEEE Trans. Pattern Anal. Mach. Intell. 20(8), 832–844 (1998)
Yan, R., Tesic, J., Smith, J.R.: Model-shared subspace boosting for multi-label classification. In: Proceedings of the 13th ACM SIGKDD International Conference on KDD, pp. 834–843. ACM, New York (2007)
Oja, E.: Subspace methods of pattern recognition. Research Studies Press (1973)
Breiman, L.: Random Forests. Machine Learning 45, 5–32 (2001)
Ting, K.M., Wells, J.R., Tan, S.C., et al.: Feating-subspace aggregating: ensembles for stable and unstable learners. Machine Learning 82, 375–397 (2011)
Schölkopf, B., Smola, A., Müller, K.R.: Nonlinear Component Analysis as a Kernel Eigenvalue Problem. Neural Computation 10, 1299–1319 (1998)
Balachander, T., Kothari, R.: Kernel based subspace pattern classification. In: Proceeding of International Joint Conference on Neural Networks, Washington, DC, USA, pp. 3119–3122 (1999)
Kitamura, T., Abe, S., Fukui, K.: Subspace Based Least Squares Support Vector Machines for Pattern Classification. In: Proceedings of International Joint Conference on Neural Networks, Atlanta, Georgia, USA, pp. 1640–1646 (2009)
Richman, M.B., Adrianto, I.: Classification and regionalization through kernel principal component analysis. Physics and Chemistry of the Earth 35, 316–328 (2010)
Frank, E., Hall, M., Pfahringer, B.: Locally weighted Naive Bayes. In: Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence, pp. 249–256. Morgan Kaufmann, San Francisco (2003)
Thabtah, F., Cowling, P., Hammoud, S.: Improving rule sorting, predictive accuracy and training time in associative classification. Expert Systems with Applications 31, 414–426 (2006)
Murphy, P.M., Aha, D.W.: UCI Repository Machine Learning Databases. University of California, Irvine (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Chen, F., Li, M., Kou, J. (2012). A Novel Subspace Classification Method for Large Datasets Based on Kernel-Based Fisher Discriminant Analysis. In: Khachidze, V., Wang, T., Siddiqui, S., Liu, V., Cappuccio, S., Lim, A. (eds) Contemporary Research on E-business Technology and Strategy. iCETS 2012. Communications in Computer and Information Science, vol 332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34447-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-34447-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34446-6
Online ISBN: 978-3-642-34447-3
eBook Packages: Computer ScienceComputer Science (R0)