TY - GEN
T1 - Intelligent data mining systems by generalized multiple kernel machines on graph based subspace
AU - Huang, Shian Chang
AU - Wu, Tung Kuang
PY - 2015/9/23
Y1 - 2015/9/23
N2 - Mining high-dimensional business data is a challenging problem. This paper proposes a novel approach to address the problems including (1) the curse of dimensionality and (2) the meaningfulness of the similarity measure in the high dimension space. The solution of this study is to build a generalized multiple kernel machine (GMKM) on a low-dimensional subspace. The representative subspace is created by the locally consistent matrix factorization (an improved variation of non-negative matrix factorization). The strengths of our system are two-fold: (1) GMKM takes products of kernels-corresponding to a tensor product of feature spaces. This leads to a richer and much higher dimensional feature representation, which is powerful in identifying relevant features and their apposite kernel representation. (2) Locally consistent matrix factorization finds a compact low-dimensional representation for data, which uncovers underlying information and simultaneously respects the intrinsic geometric structure of data manifold. Our system robustly outperforms traditional multiple kernel machines, and dimensionality reduction methods.
AB - Mining high-dimensional business data is a challenging problem. This paper proposes a novel approach to address the problems including (1) the curse of dimensionality and (2) the meaningfulness of the similarity measure in the high dimension space. The solution of this study is to build a generalized multiple kernel machine (GMKM) on a low-dimensional subspace. The representative subspace is created by the locally consistent matrix factorization (an improved variation of non-negative matrix factorization). The strengths of our system are two-fold: (1) GMKM takes products of kernels-corresponding to a tensor product of feature spaces. This leads to a richer and much higher dimensional feature representation, which is powerful in identifying relevant features and their apposite kernel representation. (2) Locally consistent matrix factorization finds a compact low-dimensional representation for data, which uncovers underlying information and simultaneously respects the intrinsic geometric structure of data manifold. Our system robustly outperforms traditional multiple kernel machines, and dimensionality reduction methods.
UR - http://www.scopus.com/inward/record.url?scp=84960877801&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84960877801&partnerID=8YFLogxK
U2 - 10.1109/ICCIS.2015.7274559
DO - 10.1109/ICCIS.2015.7274559
M3 - Conference contribution
AN - SCOPUS:84960877801
T3 - Proceedings of the 2015 7th IEEE International Conference on Cybernetics and Intelligent Systems, CIS 2015 and Robotics, Automation and Mechatronics, RAM 2015
SP - 120
EP - 125
BT - Proceedings of the 2015 7th IEEE International Conference on Cybernetics and Intelligent Systems, CIS 2015 and Robotics, Automation and Mechatronics, RAM 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th IEEE International Conference on Cybernetics and Intelligent Systems, CIS 2015 and the 7th IEEE International Conference on Robotics, Automation and Mechatronics, RAM 2015
Y2 - 15 July 2015 through 17 July 2015
ER -