P-ISOMAP: A new ISOMAP-based data visualization algorithm with less sensitivity to the neighborhood size

Tien Tzu Hsueh Pao/Acta Electronica Sinica

Volumn 34, Issue 8, 2006, Pages 1497-1501

  Shao, Chao ^a,b   Huang, Hou Kuan ^a   Zhao, Lian Wei ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b HENAN UNIVERSITY OF ECONOMICS AND LAW   (China)

Author keywords

Cost; ISOMAP; P ISOMAP; Residual variance; SOMST

Indexed keywords

ALGORITHMS; COSTS; DATABASE SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS); SENSITIVITY ANALYSIS; THRESHOLD LOGIC; TOPOLOGY; TREES (MATHEMATICS); VISUALIZATION;

DATA VISUALIZATION; ISOMAP ALGORITHMS; NEIGHBORHOOD GRAPHS; NEIGHBORHOOD SIZE; PRUNED ISOMAP; SECOND ORDER MINIMAL SPANNING TREES; SHORTCUT EDGES;

DATA PROCESSING;

EID: 33750222116     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. Tenenbaum J B, et al. A global geometric framework for nonlinear dimensionality reduction[J]. Science, 2000, 290(22): 2319-2323.
2. Balasubramanian M, et al. The isomap algorithm and topological stability[J]. Science, 2002, 295(5552): 7a-7.
3. Saxena A, et al. Non-linear dimensionality reduction by locally linear isomaps[A]. Pal N R, Kasabov N, Mudi R K, Pal S, Parui S K, Proc of the 11th International Conference on Neural Information Processing[C]. Calcutta: Springer Verlag, 2004. 1038-1043.
4. Lee J A, et al. Nonlinear projection with curvilinear distances: Isomap versus curvilinear distance analysis[J]. Neurocomputing, 2004, 57: 49-76.
5. Kouropteva O, et al. Selection of the optimal parameter value for the locally linear embedding algorithm[A]. Wang L, Halgamuge S K, Yao X. Proc of the 1st International Conference on Fuzzy Systems and Knowledge Discovery: Computational Intelligence for the E-Age[C]. Singapore, 2002. 359-363.
6. Carreira-Perpnán M A, et al. Proximity graphs for clustering and manifold learning[A]. Saul L K, Weiss Y, Bottou L. Advances in Neural Information Processing Systems 17[C]. Vancouver: MIT Press, 2004. 225-232.