학과 세미나 및 콜로퀴엄
This is part of an informal seminar series to be given by Mr. Jaehong Kim, who has been studying the book "Hodge theory and Complex Algebraic Geometry Vol 1 by Claire Voisin" for a few months. There will be 6-8 seminars during Spring 2024, and it will summarize about 70-80% of the book.
We provide general upper and lower bounds for the Gromov–Hausdorff distance d_GH(S^m, S^n) between spheres S^m and S^n (endowed with the round metric) for 0 <= m < n <= 1. Some of these lower bounds are based on certain topological ideas related to the Borsuk–Ulam theorem. Via explicit constructions of (optimal) correspondences, we prove that our lower bounds are tight in the cases of d_GH(S^0, S^n), d_GH(S^m, S^\infty), d_GH(S^1, S^2), d_GH(S^1, S^3), and d_GH(S^2, S^3). We also formulate a number of open questions.
This is part of an informal seminar series to be given by Mr. Jaehong Kim, who has been studying the book "Hodge theory and Complex Algebraic Geometry Vol 1 by Claire Voisin" for a few months. There will be 6-8 seminars during Spring 2024, and it will summarize about 70-80% of the book.
1. 데이터 분석 업무의 이해(김준범)- 데이터 분석가의 역할 소개
2. 초거대 언어 모델 동향(김정섭)-GPT-3 부터 Llama-3까지 이미 우리 삶 속에 깊숙이 자리잡은 초거대 언어 모델의 동향
3. 데이터 분석가에서 공직으로 오게된 과정과 앞으로의 계획(심규석)-
삼성화재에서의 데이터 분석 및 AI 모델링 업무, 행정안전부에서의 데이터 분석과제 기획·관리 및 공무원의 데이터 분석 역량지원 업무 전반에 관한 설명과 함께 각 기관을 지원하게 된 동기, 지원방법, 준비사항 등
This is part of an informal seminar series to be given by Mr. Jaehong Kim, who has been studying the book "Hodge theory and Complex Algebraic Geometry Vol 1 by Claire Voisin" for a few months. There will be 6-8 seminars during Spring 2024, and it will summarize about 70-80% of the book.
Link prediction (LP), inferring the connectivity between nodes, is a significant research area in graph data, where a link represents essential information on relationships between nodes. Although graph neural network (GNN)-based models have achieved high performance in LP, understanding why they perform well is challenging because most comprise complex neural networks. We employ persistent homology (PH), a topological data analysis method that helps analyze the topological information of graphs, to explain the reasons for the high performance. We propose a novel method that employs PH for LP (PHLP) focusing on how the presence or absence of target links influences the overall topology. The PHLP utilizes the angle hop subgraph and new node labeling called degree double radius node labeling (Degree DRNL), distinguishing the information of graphs better than DRNL. Using only a classifier, PHLP performs similarly to state-of-the-art (SOTA) models on most benchmark datasets. Incorporating the outputs calculated using PHLP into the existing GNN-based SOTA models improves performance across all benchmark datasets. To the best of our knowledge, PHLP is the first method of applying PH to LP without GNNs. The proposed approach, employing PH while not relying on neural networks, enables the identification of crucial factors for improving performance.
https://arxiv.org/abs/2404.15225
