P-ISOMAP: An efficient parametric update for ISOMAP for visual analytics

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 502-513

  Choo, Jaegul ^a   Reddy, Chandan K ^b   Lee, Hanseung ^c   Park, Haesun ^a  

^a Georgia Institute of Technology   (United States)

^b Wayne State University   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; VISUALIZATION;

COMPLEXITY ANALYSIS; LARGE SCALE DATA; MANIFOLD LEARNING; NEIGHBORHOOD GRAPHS; PARAMETER CHANGES; UPDATING ALGORITHM; VISUAL ANALYTICS; VISUALIZATION APPLICATION;

DATA VISUALIZATION;

EID: 84858052981     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.44     Document Type: Conference Paper

References (17)

1. A. Asuncion and D.J. Newman. UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences, 2007.
2. Mukund Balasubramanian, Eric L. Schwartz, Joshua B. Tenenbaum, Vin de Silva, and John C. Langford. The Isomap Algorithm and Topological Stability. Science, 295(5552):7a, 2002.
3. M. Barbehenn. A note on the complexity of dijkstra's algorithm for graphs with weighted vertices. Computers, IEEE Transactions on, 47(2):263, Feb 1998.
4. I. Chabini. Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Research Record: Journal of the Transportation Research Board, 1645(-1):170-175, 1998.
5. B. Champagne. Adaptive eigendecomposition of data covariance matrices based on first-order perturbations. Signal Processing, IEEE Transactions on, 42(10):2758-2770, Oct 1994.
6. Jaegul Choo, Shawn Bohn, and Haesun Park. Two-stage framework for visualization of clustered high dimensional data. In Visual Analytics Science and Technology, 2009. VAST 2009. IEEE Symposium on, pages 67-74, Oct. 2009.
7. Camil Demetrescu and Giuseppe F. Italiano. A new approach to dynamic all pairs shortest paths. J. ACM, 51(6):968-992, 2004.
8. J. W. Demmel. Applied numerical linear algebra. SIAM, 1997.
9. Daniele Frigioni, Alberto Marchetti-Spaccamela, and Umberto Nanni. Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms, 34(2):251-281, 2000.
10. G. H. Golub and C. F. van Loan. Matrix Computations, third edition. Johns Hopkins University Press, Baltimore, 1996.
11. M.H.C. Law and A.K. Jain. Incremental nonlinear dimensionality reduction by manifold learning. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 28(3):377-391, March 2006.
12. M.H.C. Law, N. Zhang, and A.K. Jain. Nonlinear Manifold Learning For Data Stream. In Proceedings of the Fourth SIAM International Conference on Data Mining, pages 33-44. Society for Industrial Mathematics, 2004.
13. R.B. Lehoucq, D.C. Sorensen, and C. Yang. ARPACK users' guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods. Society for Industrial and Applied Mathematics, 1998.
14. Chaoyi Pang, Guozhu Dong, and Kotagiri Ramamohanarao. Incremental maintenance of shortest distance and transitive closure in first-order logic and sql. ACM Trans. Database Syst., 30(3):698-721, 2005.
15. O. Samko, A.D. Marshall, and P.L. Rosin. Selection of the optimal parameter value for the isomap algorithm. Pattern Recognition Letters, 27(9):968-979, 2006.
16. Joshua B. Tenenbaum, Vin de Silva, and John C. Langford. A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science, 290(5500):2319-2323, 2000.
17. Dongfang Zhao and Li Yang. Incremental isometric embedding of high-dimensional data using connected neighborhood graphs. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 31(1):86-98, Jan. 2009.