TY - GEN
T1 - Unsupervised deep kernel for high dimensional data
AU - Xie, Ying
AU - Hao, Jie
AU - Le, Linh
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017
Y1 - 2017
N2 - In this paper we propose a method for visualizing unlabeled high dimensional data in a 3-dimensional space using Kernel Principal Component Analysis (KPCA) with the proposed unsupervised deep kernel. First, an optimal cluster structure of the data is determined using an unsupervised procedure. Second, an unsupervised deep kernel is learned via the clustered data. Then, deep kernel based PCA is applied to map the data into a 3-dimensional space for visualization. To ensure the visualization on a 3-dimensional space is reliable, we proposed the V3D (Visualizability in 3 Dimension) measurement to evaluate the amount of structural information is maintained by the dimension reduction process. V3D is computed based on the comparison of the clustering structures of the data before and after dimension reduction. The reduction and visualization results using the deep kernel based PCA are compared with several other methods include Principal Component Analysis, PCA based on other kernel functions, Entropy Component Analysis, and deep learning approaches. The experimental results show that the deep kernel outperforms all other methods in dimension reductions with respect to the V3D measure.
AB - In this paper we propose a method for visualizing unlabeled high dimensional data in a 3-dimensional space using Kernel Principal Component Analysis (KPCA) with the proposed unsupervised deep kernel. First, an optimal cluster structure of the data is determined using an unsupervised procedure. Second, an unsupervised deep kernel is learned via the clustered data. Then, deep kernel based PCA is applied to map the data into a 3-dimensional space for visualization. To ensure the visualization on a 3-dimensional space is reliable, we proposed the V3D (Visualizability in 3 Dimension) measurement to evaluate the amount of structural information is maintained by the dimension reduction process. V3D is computed based on the comparison of the clustering structures of the data before and after dimension reduction. The reduction and visualization results using the deep kernel based PCA are compared with several other methods include Principal Component Analysis, PCA based on other kernel functions, Entropy Component Analysis, and deep learning approaches. The experimental results show that the deep kernel outperforms all other methods in dimension reductions with respect to the V3D measure.
KW - Big data visualization
KW - Deep kernel
KW - Deep learning
KW - Dimension reduction
KW - High dimensional data
KW - V
UR - https://www.scopus.com/pages/publications/85031022469
U2 - 10.1109/IJCNN.2017.7965868
DO - 10.1109/IJCNN.2017.7965868
M3 - Conference contribution
T3 - Proceedings of the International Joint Conference on Neural Networks
SP - 294
EP - 299
BT - International Joint Conference on Neural Networks
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 International Joint Conference on Neural Networks, IJCNN 2017
Y2 - 14 May 2017 through 19 May 2017
ER -