A hierarchical latent variable model for data visualization

被引:131
作者
Bishop, CM
Tipping, ME
机构
[1] Microsoft Res, Cambridge CB2 3NH, England
[2] Aston Univ, Neural Comp Res Grp, Birmingham B4 7ET, W Midlands, England
基金
英国工程与自然科学研究理事会;
关键词
latent variables; data visualization; EM algorithm; hierarchical mixture model; density estimation; principal component analysis; factor analysis; maximum likelihood; clustering; statistics;
D O I
10.1109/34.667885
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Visualization has proven to be a powerful and widely-applicable tool for the analysis and interpretation of multivariate data. Most visualization algorithms aim to find a projection from the data space down to a two-dimensional visualization space. However, for complex data sets living in a high-dimensional space, it is unlikely that a single two-dimensional projection can reveal all of the interesting structure. We therefore introduce a hierarchical visualization algorithm which allows the complete data set to be visualized at the top level, with clusters and subclusters of data points visualized at deeper levels. The algorithm is based on a hierarchical mixture of latent variable models, whose parameters are estimated using the expectation-maximization algorithm. We demonstrate the principle of the approach on a toy data set, and we then apply the algorithm to the visualization of a synthetic data set in 12 dimensions obtained from a simulation of multiphase flows in oil pipelines, and to data in 36 dimensions derived from satellite images. A Matlab software implementation of the algorithm is publicly available from the World Wide Web.
引用
收藏
页码:281 / 293
页数:13
相关论文
共 18 条
[1]  
Bishop C. M., 1995, NEURAL NETWORKS PATT
[2]   ANALYSIS OF MULTIPHASE FLOWS USING DUAL-ENERGY GAMMA DENSITOMETRY AND NEURAL NETWORKS [J].
BISHOP, CM ;
JAMES, GD .
NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT, 1993, 327 (2-3) :580-593
[3]   GTM: The generative topographic mapping [J].
Bishop, CM ;
Svensen, M ;
Williams, CKI .
NEURAL COMPUTATION, 1998, 10 (01) :215-234
[4]  
Buja Andreas, 1996, Journal of Computational and Graphical Statistics, V5, P78, DOI [DOI 10.1080/10618600.1996.10474696, 10.2307/1390754, DOI 10.2307/1390754]
[5]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[6]  
Everitt BS., 1984, INTRO LATENT VARIABL
[7]   PROJECTION PURSUIT ALGORITHM FOR EXPLORATORY DATA-ANALYSIS [J].
FRIEDMAN, JH ;
TUKEY, JW .
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (09) :881-890
[8]   HIERARCHICAL MIXTURES OF EXPERTS AND THE EM ALGORITHM [J].
JORDAN, MI ;
JACOBS, RA .
NEURAL COMPUTATION, 1994, 6 (02) :181-214
[9]  
Kohonen T., 1995, Self-Organizing Maps
[10]  
Krzanowski W. J., 1994, MULTIVARIATE ANAL 2