Principal Graph and Structure Learning Based on Reversed Graph Embedding

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 39, Issue 11, 2017, Pages 2227-2241

  Mao, Qi ^a   Wang, Li ^b   Tsang, Ivor W ^c   Sun, Yijun ^d  

^a A Nokia Company   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^d UNIVERSITY AT BUFFALO   (United States)

Author keywords

Principal curve; principal graph; structure learning

Indexed keywords

GRAPHIC METHODS; LEARNING ALGORITHMS;

GUARANTEED CONVERGENCE; LOCAL INFORMATION; PRINCIPAL CURVE; PRINCIPAL GRAPH; REAL APPLICATIONS; REAL-WORLD DATASETS; STRUCTURE-LEARNING; UNDERLYING GRAPHS;

TREES (MATHEMATICS);

EID: 85032304080     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2016.2635657     Document Type: Article

References (59)

1. T. Hastie and W. Stuetzle, "Principal curves," J. Amer. Statistical Assoc., vol. 84, pp. 502-516, 1989.
2. B. Kégl, A. Kryzak, T. Linder, and K. Zeger, "Learning and design of principal curves," IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, no. 3, pp. 281-297, Mar. 2000.
3. A. J. Smola, S. Mika, B. Schölkopf, and R. C. Williamson, "Regularized principal manifolds," J. Mach. Learn. Res., vol. 1, pp. 179-209, 2001.
4. S. Sandilya and S. R. Kulkami, "Principal curves with bounded turn," IEEE Trans. Inf. Theory, vol. 48, no. 10, pp. 2789-2793, Oct. 2002.
5. A. Gorban and A. Y. Zinovyev, "Principal graphs and manifolds," in Handbook of Research on Machine Learning Applications and Trends: Algorithms, Methods and Techniques, vol. 31. Hershey, PA, USA: IGI Global, 2009, ch. 2, pp. 28-59.
6. R. Tibshirani, "Principal curves revisited," Statist. Comput., vol. 2, pp. 183-190, 1992.
7. C. M. Bishop, M. Svensén, and C. K. I. Williams, "GTM: The generative topographic mapping," Neural Comput., vol. 10, no. 1, pp. 215-234, 1998.
8. B. Kégl, "Principal curve: Learning, design, and applications," Ph.D. dissertation, Dept. Comput. Sci., Concordia Univ., Montreal, Quebec, Canada, 1999.
9. A. Gorban, A. Pitenko, A. Zinovyev, and D. Wunsch, "Vizualization of any data using elastic map method," Smart Eng. Syst. Des., vol. 11, pp. 363-368, 2001.
10. A. Gorban and A. Y. Zinovyev, "Elastic principal graphs and manifold and their practical applications," Computing, vol. 75, no. 4, pp. 359-379, 2006.
11. T. Kohonen, Self-Organizing Maps. Berlin, Germany: Springer, 1997.
12. E. Erwin, K. Obermayer, and K. Schulten, "Self-organizing maps: Ordering, convergence properties and energy functions," Biol. Cybern., vol. 67, pp. 47-55, 1992.
13. U. Ozertem and D. Erdogmus, "Locally defined principal curves and surfaces," J. Mach. Learn. Res., vol. 12, pp. 1249-1286, 2011.
14. B. Kégl and A. Kryzak, "Piecewise linear skeletonization using principal curves," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 1, pp. 59-74, Jan. 2002.
15. D. Miao, Q. Tang, and W. Fu, "Fingerprint minutiae extraction based on principal curves," Pattern Recognit. Lett., vol. 28, no. 16, pp. 2184-2189, 2007.
16. A. Gorban, N. Sumner, and A. Zinovyev, "Topological grammars for data approximation," Appl. Math. Lett., vol. 20, no. 4, pp. 382-386, 2007.
17. M. Nagl, "Formal languages of labelled graphs," Computing, vol. 16, no. 1/2, pp. 113-137, 1976.
18. M. Löwe, "Algebraic approach to single-pushout graph transformation," Theoretical Comput. Sci., vol. 109, no. 1/2, pp. 181-224, 1993.
19. A. N. Gorban and A. Zinovyev, "Principal manifolds and graphs in practice: From molecular biology to dynamical systems," Int. J. Neural Syst., vol. 20, no. 3, pp. 219-232, 2010.
20. G. Carlsson, "Topology and data," Bulletin Amer. Math. Soc., vol. 46, no. 2, pp. 255-308, 2009.
21. X. Ge, I. I. Safa, M. Belkin, and Y. Wang, "Data skeletonization via Reeb graphs," in Proc. Advances Neural Inf. Process. Syst. 24, 2011, pp. 837-845.
22. T. K. Dey and Y. Wang, "Reeb graphs: Approximation and persistence," Discr. Comput. Geom., vol. 49, no. 1, pp. 46-73, 2013.
23. G. Singh, F. Mémoli, and G. E. Carlsson, "Topological methods for the analysis of high dimensional data sets and 3D object recognition," presented at the Eurographics Symp. Point-Based Graph., Prague, Czech Republic, 2007.
24. M. Nicolau, A. J. Levine, and G. Carlsson, "Topology based data analysis identifies a subgroup of breast cancers with a unique mutational profile and excellent survival," Proc. Nat. Academy Sci. United States America, vol. 108, no. 17, pp. 7265-7270, 2011.
25. U. Ozertem and D. Erdogmus, "Local conditions for critical and principal manifolds," in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., 2008, pp. 1893-1896.
26. M. Belkin and P. Niyogi, "Laplacian eigenmaps and spectral techniques for embedding and clustering," in Proc. 14th Int. Conf. Neural Inf. Process. Syst: Natural Synthetic, 2001, pp. 585-591.
27. M. Maier and U. Luxburg, "Influence of graph construction on graph-based clustering measures," in Proc. 21st Int. Conf. Neural Inf. Process. Syst., 2009, pp. 1025-1032.
28. T. Jebara, J. Wang, and S. Chang, "Graph construction and bmatching for semi-supervised learning," in Proc. 26th Annu. Int. Conf. Mach. Learn., 2009, pp. 441-448.
29. E. Elhamifar and R. Vidal, "Sparse manifold clustering and embedding," in Proc. 24th Int. Conf. Neural Inf. Process. Syst., 2011, pp. 55-63.
30. 1-graph for image analysis," IEEE Trans. Image Process., vol. 19, no. 4, pp. 858-866, Apr. 2010.
31. B. Lake and J. Tenenbaum, "Discovering structure by learning sparse graph," in Proc. 33rd Annu. Cogn. Sci. Conf., 2010, pp. 778-783.
32. Q. Mao, L. Wang, and I. W. Tsang, "A unified probabilistic framework for robust manifold learning and embedding," Mach. Learn., 2016.
33. L. Wang, Q. Mao, and I. W. Tsang, "Latent smooth skeleton embedding," in Proc. 31st AAAI Conf. Artif. Intell., 2017.
34. Q. Mao and I. W. Tsang, "Parameter-free spectral kernel learning," in Proc. 26th Conf. Uncertainty Artif. Intell., 2010, pp. 350-357.
35. Q. Mao, L. Yang, L. Wang, S. Goodison, and Y. Sun, "SimplePPT: A simple principal tree algorithm," in Proc. 15th SIAM Int. Conf. Data Mining, 2015, pp. 792-800.
36. K. Q. Weinberger and L. K. Saul, "An introduction to nonlinear dimensionality reduction by maximum variance unfolding," in Proc. 21st Nat. Conf. Artif. Intell.-Vol. 2, 2006, pp. 1683-1686.
37. L. Song, A. Smola, A. Gretton, and K. Borgwardt, "A dependence maximization view of clustering," in Proc. 24th Int. Conf. Mach. Learn., 2007, pp. 815-822.
38. J. B. Tenenbaum, V. de Silva, and J. C. Landford, "A global geometric framework for nonlinear dimensionality reduction," Science, vol. 290, pp. 2319-2323, 2000.
39. S. T. Roweis and L. K. Saul, "Nonlinear dimensionality reduction by locally linear embedding," Science, vol. 290, no. 5500, pp. 2323-2326, 2000.
40. M. Greaves and C. C. Maley, "Clonal evolution in cancer," Nature, vol. 481, no. 7381, pp. 306-313, 2012.
41. Y. Sun, J. Yao, N. Nowak, and S. Goodison, "Cancer progression modeling using static sample data," Genome Biol., vol. 15, no. 8, 2014, Art. no. 440.
42. Y. Cheng, "Mean shift, mode seeking, and clustering," IEEE Trans. Pattern Anal. Mach. Intell., vol. 17, no. 8, pp. 790-799, Aug. 1995.
43. J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Amer. Math. Soc., vol. 7, pp. 48-50, 1958.
44. M. Cheung, "Minimum-cost spanning trees," (2008). [Online]. Available: http://people.orie.cornell.edu/dpw/orie6300/fall2008/Recitations/rec09.pdf
45. Q. Mao, L. Wang, S. Goodison, and Y. Sun, "Dimensionality reduction via graph structure learning," in Proc. 21st ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2015, pp. 765-774.
46. J. Gorski, F. Pfeuffer, and K. Klamroth, "Biconvex sets and optimization with biconvex functions-A survey and extensions," Math. Methods Operations Res., vol. 66, pp. 373-407, 2007.
47. E. D. Andersen and K. D. Andersen, "The mosek interior point optimizer for linear programming: An implementation of the homogeneous algorithm," in High Performance Optimization. Berlin, Germany: Springer, 2000, pp. 197-232.
48. K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl, "Constrained kmeans clustering with background knowledge," in Proc. 18th Int. Conf. Mach. Learn., 2001, pp. 577-584.
49. E. P. Xing, M. I. Jordan, S. Russell, and A. Y. Ng, "Distance metric learning with application to clustering with side-information," in Proc. Advances Neural Inf. Process. Syst., 2002, pp. 505-512.
50. J. Zhuang, I. W. Tsang, and S. C. Hoi, "A family of simple nonparametric kernel learning algorithms," J. Mach. Learn. Res., vol. 12, pp. 1313-1347, 2011.
51. C. Fowikes, S. Belongle, F. Chung, and J. Malik, "Spectral grouping using the Nyström method," IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 2, pp. 214-225, Feb. 2004.
52. X. Chen and D. Cai, "Large scale spectral clustering with landmark-based representation," in Proc. 25th AAAI Conf. Artif. Intell., 2011, pp. 313-318.
53. D. Yan, L. Huang, and M. Jordan, "Fast approximation spectral clustering," in Proc. 15th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2009, pp. 907-916.
54. S. Kumar, M. Mohri, and A. Talwalkar, "Sampling method for the Nyström method," J. Mach. Learn. Res., vol. 13, pp. 981-1006, 2012.
55. M. Á. Carreira-Perpi~nán, "A review of mean-shift algorithms for clustering," arXiv preprint arXiv:1503.00687, 2015.
56. D. M. Witten and R. Tibshirani, "A framework for feature selection in clustering," J. Royal Statistical Soc., vol. 105, no. 490, pp. 713-726, 2010.
57. C. Curtis, et al., "The genomic and transcriptomic architecture of 2,000 breast tumours reveals novel subgroups," Nature, vol. 486, no. 7403, pp. 346-352, 2012.
58. J. Parker, et al., "Supervised risk predictor of breast cancer based on intrinsic subtypes," J. Clinical Oncology, vol. 27, no. 8, pp. 1160-1167, 2009.
59. C. J. Creighton, et al., "The molecular profile of luminal B breast cancer," Biologics, vol. 6, no. 2, pp. 289-297, 2012.