4Vapnik VN. Statistical Learning Theory[ M ]. NY:Springer, 1998:732.
5Vapnik VN. The Nature of Statistical Eeaming Theory [ M ]. NY : Springer, 2000 ( 3 ).
6J. B. Tenenbaum,V. de Sitva,J. C. Langford. A Global Geometric Framework for Nonlinear Dimensionality Reduction [ J ]. Science,2000,290 ( 5500 ) : 2319 - 2323.
7Mikhail Belkin, Partha Niyogi. Laplaeian Eigenmaps and Spectral Techniques for Embedding and Clustering[ C ]. Boston : MIT Press,2001:586 - 691.
8Jan Tigges, Tobia Lakes, Patrick Hostert. Urban vegetation classification : Benefits of muhitemporat RapidEye satellite data [ J ]. Remote Sensing of Environment,2013,136:66 - 75.
5Friedman J H, Bentley J L, Finkel R A. An Algorithm for Finding Best Matches in Logarithmic Ex- pected time[J]. ACM Transactions on Mathmatical Software, 1077(3): 1-38.
6Yianilos P N. Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces [C]. The 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, 1993.
7Beckmann N, Kriegel H P, Schneider Ralf, et al. The R-tree: an Efficient and Robust Access Method for Points and Rectangles[C]. The 1990 ACM SIGMOD international Conference on Management of Data, New York, USA, 1990.
8Korn F, Pagel B U, Faloutsos C. On the "Dimensionality Curse" and the "Self-Similarity Blessing" [J]. IEEE Transactions on Knowledge and Data Engineering,2001, 13(1): 96-110.
9Beyer K, Goldstein J, Ramakrishnan R, et al. When is "Nearest Neighbor" Meaningful? [C]. ICDT'99, Jerusalem, Israel, 1999.
10Gionis A, Indyk P, Motwani R. Similarity Search in High Dimensions via Hashing[C]. The 25th International Conference on Very Large Data Bases, San Francisco, LA, USA, 1999.
