透過您的圖書館登入
IP:3.133.87.156
  • 學位論文

Topological Data Analysis with Combinatorial Laplacian for Data Clustering

Topological Data Analysis with Combinatorial Laplacian for Data Clustering

指導教授 : 樂美亨

摘要


none

關鍵字

none

並列摘要


This thesis attempts to combine machine learning and topological data analysis (TDA). We exam the machine that only learned the original data without interruption to face various testing data under linear transformation by adding Betti number as an additional feature. Our experiments are based on the theory of homology group by constructing simplicial complexes of images and the discrete version of the Hodge theorem with higher-order Laplacian matrices. This approach performs well and represents the importance concerning topological structure of the image itself. We believe that TDA is a good supporter to help machine learning models dealing with more complicated data rather than pouring more and more different cases for training. In the future, we would pay more attention to the application and the theory of TDA combined with diverse models.

參考文獻


[1] GOLDBERG, Timothy E. Combinatorial Laplacians of simplicial complexes. Senior Thesis, Bard College, 2002.
[2] WANG, Rui; NGUYEN, Duc Duy; WEI, Guo-Wei. Persistent spectral graph. International journal for numerical methods in biomedical engineering, 2020, 36.9: e3376.
[3] GUILLEMIN, Victor; HAINE, Peter. Differential Forms. World Scientific, 2019.
[4] Polterovich, L., Rosen, D., Samvelyan, K., Zhang, J. (2020). Topological Persistence in Geometry and Analysis (Vol. 74). American Mathematical Soc..
[5] ZOMORODIAN, Afra; CARLSSON, Gunnar. Computing persistent homology. Discrete Computational Geometry, 2005, 33.2: 249-274.