The Community for Technology Leaders
2015 IEEE Pacific Visualization Symposium (PacificVis) (2015)
Hangzhou, China
April 14, 2015 to April 17, 2015
ISBN: 978-1-4673-6879-7
pp: 287-294
Kazuho Watanabe , Toyohashi University of Technology, Japan
Hsiang-Yun Wu , The University of Tokyo, Japan
Yusuke Niibe , Keio University, Japan
Shigeo Takahashi , The University of Tokyo, Japan
Issei Fujishiro , Keio University, Japan
Exploring feature subspaces is one of promising approaches to analyzing and understanding the important patterns in multivariate data. If relying too much on effective enhancements in manual interventions, the associated results depend heavily on the knowledge and skills of users performing the data analysis. This paper presents a novel approach to extracting feature subspaces from multivariate data by incorporating biclustering techniques. The approach has been maximally automated in the sense that highly-correlated dimensions are automatically grouped to form subspaces, which effectively supports further exploration of them. A key idea behind our approach lies in a new mathematical formulation of asymmetric biclustering, by combining spherical k-means clustering for grouping highly-correlated dimensions, together with ordinary k-means clustering for identifying subsets of data samples. Lower-dimensional representations of data in feature subspaces are successfully visualized by parallel coordinate plot, where we project the data samples of correlated dimensions to one composite axis through dimensionality reduction schemes. Several experimental results of our data analysis together with discussions will be provided to assess the capability of our approach.
Linear programming, Correlation, Data visualization, Clustering algorithms, Data models, History, Data mining

K. Watanabe, H. Wu, Y. Niibe, S. Takahashi and I. Fujishiro, "Biclustering multivariate data for correlated subspace mining," 2015 IEEE Pacific Visualization Symposium (PacificVis)(PACIFICVIS), Hangzhou, China, 2015, pp. 287-294.
307 ms
(Ver 3.3 (11022016))