10/8 Mining and Learning with Graphs: Clustering, Hypergraphs, and Representation Learning (황지영 교수/KAIST 전산학부)

작성자
kaistsoftware
작성일
2020-10-05 15:35
조회
12093
  • 강사 : 황지영 교수 (KAIST 전산학부) 
  • 일시 : 2020. 10. 8 (목) 17:00~18:30
Graphs are useful tools to model real-world data that is best represented by a set of objects and the relationships between the objects, e.g., WWW, social networks, and biological networks among others. This talk mainly focuses on mining and learning methods for graphs with three specific topics: clustering, hypergraphs, and representation learning. Traditional clustering algorithms, such as K-Means, output a clustering that is disjoint and exhaustive, i.e., every single data point is assigned to exactly one cluster. However, in many real-world datasets, clusters can overlap and there are often outliers that do not belong to any cluster. We propose NEO-K-Means (Non-Exhaustive, Overlapping K-Means) that captures the issues of overlap and non-exhaustiveness in a unified manner. Complex relationships among entities can be modeled very effectively using hypergraphs. Hypergraphs model real-world data by allowing a hyperedge to include two or more entities. We propose a semi-supervised clustering framework for hypergraphs that is able to easily incorporate not only multiple attributes of the entities but also auxiliary relationships among the entities from diverse sources. Furthermore, by showing the close relationship between the hypergraph normalized cut and the weighted kernel K-Means, we also develop an efficient multilevel hypergraph clustering method which provides a good initialization with our semi-supervised multi-view clustering algorithm. On a web graph, a node indicates a web page and a directed edge indicates a hyperlink between the web pages. The hyperlinks are created for different reasons, and thus, may play different roles in the graph. We formally define a hyperlink classification problem in web search by classifying hyperlinks into three classes based on their roles: navigation, suggestion, and action. We approach the hyperlink classification problem from a structured graph embedding (also known as representation learning) perspective, and show that we can solve the problem by modifying the recently proposed knowledge graph embedding techniques.
전체 143
번호 제목 작성자 작성일 추천 조회
공지사항
2025년 봄학기 콜로퀴엄 일정 안내
kaistsoftware | 2025.02.27 | 추천 0 | 조회 11258
kaistsoftware 2025.02.27 0 11258
72
12/9 Speech Communication in Everyday Life (송지은 교수/KAIST 인문사회과학부)
kaistsoftware | 2021.12.06 | 추천 0 | 조회 12724
kaistsoftware 2021.12.06 0 12724
71
12/2 Multilingual and Cross-Lingual Analysis of Neural Machine Translation Models (김재명 연구원/NAVER LABS Europe, France)
kaistsoftware | 2021.12.01 | 추천 0 | 조회 12761
kaistsoftware 2021.12.01 0 12761
70
11/25 Modeling Species Interactions and Distributions Under Imperfect Detection (서유진 박사/Brown Univ.)
kaistsoftware | 2021.11.22 | 추천 0 | 조회 11735
kaistsoftware 2021.11.22 0 11735
69
11/18 Introduction to Advanced Computational Imaging Techniques (김민혁 교수/KAIST 전산학부)
kaistsoftware | 2021.11.17 | 추천 0 | 조회 11364
kaistsoftware 2021.11.17 0 11364
68
11/11 Intelligent Positive Computing for Digital Wellbeing (이의진 교수/KAIST 전산학부)
kaistsoftware | 2021.11.15 | 추천 0 | 조회 11546
kaistsoftware 2021.11.15 0 11546
67
11/4 Human and Data in NLP Pipeline (강동엽 교수/Dept. of CSE, Univ. of Minnesota, USA)
kaistsoftware | 2021.11.03 | 추천 0 | 조회 11706
kaistsoftware 2021.11.03 0 11706
66
10/28 Skinner box에서 AI 챗봇까지: 교수-학습의 변화 (허선영 교수/서울신학대 교수학습개발센터)
kaistsoftware | 2021.10.27 | 추천 0 | 조회 11832
kaistsoftware 2021.10.27 0 11832
65
10/14 미래 모빌리티 서비스를 위한 딥러닝 기술 (이재길 교수/KAIST 전산학부)
kaistsoftware | 2021.10.13 | 추천 0 | 조회 10813
kaistsoftware 2021.10.13 0 10813
64
9/16 Cross-Modal Learning (진소영 박사/CSAIL, MIT, USA)
kaistsoftware | 2021.09.24 | 추천 0 | 조회 14726
kaistsoftware 2021.09.24 0 14726
63
2021년 가을학기 콜로퀴엄 일정 안내
kaistsoftware | 2021.09.08 | 추천 0 | 조회 13642
kaistsoftware 2021.09.08 0 13642