• Aug 09, 2018 News![CFP] The annual meeting of IJFCC Editorial Board, ICCTD 2019, will be held in Prague, Czech Republic during March 2-4, 2019.   [Click]
  • Aug 09, 2018 News!IJFCC Vol. 6, No. 1-No. 3 has been indexed by EI (Inspec).   [Click]
  • Dec 24, 2018 News!The papers published in Vol.7, No.1-No.2 have all received dois from Crossref.
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Cherry L. Chan
    • Abstracting/ Indexing: Google Scholar,  Crossref, Electronic Journals LibraryEI (INSPEC, IET), etc.
    • E-mail:  ijfcc@ejournal.net 
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.
IJFCC 2015 Vol.4(5): 364-367 ISSN: 2010-3751
doi: 10.18178/ijfcc.2015.4.5.417

High Dimensional Data Mining Systems by Kernel Orthonormalized Partial Least Square Analysis

Shian-Chang Huang, Nan-Yu Wang, and Tung-Kuang Wu
Abstract—Mining high-dimensional business data is a popular and important problem. However, there are two challenges for mining such data, including 1) the curse of dimensionality and 2) the meaningfulness of the similarity measure in the high dimension space. This paper proposes a novel approach to overcome the problems, which builds a generalized multiple kernel machine (GMKM) on a special subspace created by the kernel orthonormalized partial least square (KOPLS). GMKM takes products of kernels-corresponding to a tensor product of feature spaces. This leads to a richer and much higher dimensional feature representation. Therefore, GMKM is powerful in identifying relevant features and their apposite kernel representation. KOPLS finds a low dimensional representation of data, which uncovers the hidden information and simultaneously respects the intrinsic geometry of data manifold. Our new system robustly overcomes the weakness of traditional multiple kernel machines, and outperforms traditional classification systems.

Index Terms—Data mining, multiple kernel learning, dimensionality reduction, support vector machine.

Shian-Chang Huang and Tung-Kuang Wu are with the National Changhua University of Education, Changhua, Taiwan (e-mail: shhuang@cc.ncue.edu.tw, tkwu@im.ncue.edu.tw).
Nan-Yu Wang is with Ta Hwa University of Science and Technology, Hsinchu, Taiwan (e-mail: nanyu@tust.edu.tw).


Cite: Shian-Chang Huang, Nan-Yu Wang, and Tung-Kuang Wu, "High Dimensional Data Mining Systems by Kernel Orthonormalized Partial Least Square Analysis," International Journal of Future Computer and Communication vol. 4, no. 5, pp. 364-367, 2015.

Copyright © 2008-2018. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net