SimplePPT: A Simple Principal Tree Algorithm
Qi Mao, Le Yang, Li Wang et al. · SIAM International Conference on Data Mining · 2015
Many scientific datasets are of high dimension, and the analysis usually requires visual manipulation by retaining the most important structures of data. Principal curve is a widely used approach for this purpose. However, many existing methods work only for data with structures that are not self-intersected, which is quite restrictive for real applications. To address this issue, we develop a new model, which captures the local information of the underlying graph structure based on reversed graph embedding. A generalization bound is derived that show that the model is consistent if the number of data points is sufficiently large. As a special case, a principal tree model is proposed and a new algorithm is developed that learns a tree structure automatically from data. The new algorithm is simple and parameter-free with guaranteed convergence. Experimental results on synthetic and breast cancer datasets show that the proposed method compares favorably with baselines and can discover a breast cancer progression path with multiple branches.
Cited by 31 works. doi:10.1137/1.9781611974010.89
Authors
References
- Convex Optimization
- Self-Organizing Maps
- Pattern Recognition with Fuzzy Objective Function Algorithms
- Principal Component Analysis
- Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
- Mean shift, mode seeking, and clustering
- GTM: The Generative Topographic Mapping
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- Supervised Risk Predictor of Breast Cancer Based on Intrinsic Subtypes
- The genomic and transcriptomic architecture of 2,000 breast tumours reveals novel subgroups