Title

誤差最小降維模型於流形之分析

Translated Titles

Error Minimizing Dimensional Reduction based on Manifold Analysis

DOI

10.6342/NTU201601542

Authors

梁文寧

Key Words

流形分析 ; 誤差最小法 ; 降維 ; Manifold Learning ; Error Minimizing ; Dimensional Reduction

PublicationName

臺灣大學生物環境系統工程學研究所學位論文

Volume or Term/Year and Month of Publication

2016年

Academic Degree Category

碩士

Advisor

胡明哲

Content Language

英文

Chinese Abstract

本研究主要目的是要呈現一個新的流形分析降維方法,透過分析得到原始地圖的每一點之間的距離矩陣後,誤差最小法是透過最小化變形地圖的與原始地圖的距離矩陣誤差,在低維空間去建構新的變形座標矩陣,若是誤差趨近於零,新的座標矩陣就能完整保留原始座標矩陣的距離特性。 本研究使用了台北市做案例分析,由於台北市本身豐富的多樣化地理環境與密集的城市建築,點與點之間路徑的距離不可能皆為直線距離,透過原始座標系統與交通路網建構出一個台北市的距離矩陣,透過MDS與誤差最小化方法分別作出新的變形變量圖,而這個變量圖就是以距離為主要變數將台北市的每個座標點重新分配位置,希望能在維持台北市地圖結構與維持距離屬性之間取得平衡。

English Abstract

The research presents the new method for manifold analysis. Error Minimizing method is a dimensional reduction method that find the new node coordinate by seeking minimal error. the error is equal to the square of new distance over the square of original distance. The new distance will be accordant with original distance when error is close to 0, therefore the new node coordinate in new 2-D space maintain the characteristic. As a research case, Taipei city has diverse geographical environment and the great dense of buildings, therefore the real path between two nodes can not be a straight line. The research is committed to develop a cartogram which the distance between two nodes will change according to the real distance constructed by traffic route for automobile. obtain the balance of that maintain the structure of the map and maintain the characteristic of distance.

Topic Category 生物資源暨農學院 > 生物環境系統工程學研究所
生物農學 > 生物科學
Reference
  1. [2]. Pearson, K. (1901). LIII. On lines and planes of closest fit to systems of points in space. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 2(11), 559-572.
    連結:
  2. [3]. Eckart, C., & Young, G. (1936). The approximation of one matrix by another of lower rank. Psychometrika, 1(3), 211-218.
    連結:
  3. [5]. Turk, M., & Pentland, A. (1991). Eigenfaces for recognition. Journal of cognitive neuroscience, 3(1), 71-86.
    連結:
  4. [6]. Tenenbaum, J. B., De Silva, V., & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. science, 290(5500), 2319-2323.
    連結:
  5. [7]. Diamantaras, K. I., & Kung, S. Y. (1996). Principal component neural networks: theory and applications. John Wiley & Sons, Inc..
    連結:
  6. [8]. Scholkopf, B., Smola, A., & Muller, K. R. (1997). Kernel principal component analysis. In Artificial Neural Networks—ICANN'97 (pp. 583-588). Springer Berlin Heidelberg.
    連結:
  7. [11]. Roweis, S. T., & Saul, L. K. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500), 2323-2326.
    連結:
  8. [12]. Gastner, M. T., & Newman, M. E. (2004). Diffusion-based method for producing density-equalizing maps. Proceedings of the National Academy of Sciences of the United States of America, 101(20), 7499-7504.
    連結:
  9. [13]. Seung, H. S., & Lee, D. D. (2000). The manifold ways of perception. Science, 290(5500), 2268-2269.
    連結:
  10. [15]. Vellido, A., Garcia, D. L., & Nebot, A. (2013). Cartogram visualization for nonlinear manifold learning models. Data Mining and Knowledge Discovery, 27(1), 22-54.
    連結:
  11. [17]. Burges, C. J. (2010). Dimension reduction: A guided tour. Now Publishers Inc.
    連結:
  12. [18]. Kruskal, J. B. (1964). Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika, 29(1), 1-27.
    連結:
  13. [19]. Kruskal, J. B., & Wish, M. (1978). Multidimensional scaling (Vol. 11). Sage.
    連結:
  14. [1]. 邱國益,2008,「流形學習之應用的概觀研究」,逢甲大學應用數學學系碩士班碩士論文。
  15. [4]. LJP, P. E., & Van Den, H. H. (2007). Dimensionality Reduction: A Comparative Review. Tech. Rrep.
  16. [9]. Burges, C. J. (1998). A tutorial on support vector machines for pattern recognition. Data mining and knowledge discovery, 2(2), 121-167.
  17. [10]. Saul, L. K., & Roweis, S. T. (2000). An introduction to locally linear embedding. unpublished. Available at: http://www. cs. toronto. edu/~ roweis/lle/publications. html.
  18. [14]. Cayton, L. (2005). Algorithms for manifold learning. Univ. of California at San Diego Tech. Rep, 1-17.
  19. [16]. Patwari, N., Hero III, A. O., & Pacholski, A. (2005, August). Manifold learning visualization of network traffic data. In Proceedings of the 2005 ACM SIGCOMM workshop on Mining network data (pp. 191-196). ACM.