ABCDEFGHIJKLM
1
2
LAB seminar - UNIST Data Mining Lab
3
4
DateType#PresenterContentConferenceResourceVideo
5
2023.03.24Paper presentationMinsik Lee"Peeling bipartite networks for dense subgraph discovery." WSDM 2018paperslidepresentation
6
StudyWoocheol ShinNetwork Analysis. Lecture 3. Random graphs.Lecturevideoslidepresentation
7
2023.03.31Paper presentationWoocheol Shin"Residual core maximization: An efficient algorithm for maximizing the size of the k-core."SDM 2020paperslidepresentation
8
StudyMinsik LeeNetwork Analysis. Lecture 4. Small world and dynamical growth models.Lecturevideoslidepresentation
9
2023.04.07Paper presentationDahee Kim"Effective and efficient relational community detection and search in large dynamic heterogeneous information networks." VLDB 2020paperslidepresentation
10
StudyDahee KimNetwork Analysis. Lec2. Power lawsLecturevideoslidepresentation
11
2023.04.14midterm week
12
2023.04.28StudyWoocheol ShinNetwork Analysis. Lecture 5. Centrality measures.Lecturevideoslidepresentation
13
2023.05.15Paper presentationDahee Kim "Scalable and Effective Conductance-based Graph Clustering"AAAI 2023paperslidepresentation
14
2023.05.22StudyMinsik LeeNetwork Analysis. Lecture 6. Link AnalysisLecturevideoslidepresentation
15
2023.06.07Paper presentationDahee Kim"Size-constrained Community Search on Large Networks: An Effective and Efficient Solution."TKDE 2023paperslidepresentation
16
2023.06.16Paper presentationSong Kim"Influential Community Search over Large Heterogeneous Information Networks"VLDB 2023paperslidepresentation
17
2023.06.23Paper presentationDahee Kim"Finding Top-k Important Edges on Bipartite Graphs: Ego-betweenness Centrality-based Approaches"ICDE 2023paperslidepresentation
18
Paper presentationSong Kim"Hypergraph clustering by iteratively reweighted modularity maximization"ANS 2020paperslidepresentation
19
2023.06.30Paper presentationMinsik Lee"Efficient Personalized Maximum Biclique Search"ICDE 2022paperslidepresentation
20
Study-MMDS chap5. Link AnalysisMMDSbook
21
2023.07.07Paper presentationJeonghan Son"A Fast Order-Based Approach for Core Maintenance"ICDE 2017paperslidepresentation
22
Paper presentationChanu Park"Finding the Best k in Core Decomposition"ICDE 2020paperslidepresentation
23
StudyWoocheol ShinMMDS chap6. Frequent ItemsetMMDSbook
24
2023.07.14Paper presentationWoocheol Shin"Quantifying Node Importance over Network Structural Stability"KDD 2023paperslidepresentation
25
Study
Dahee Kim, Minsik Lee
MMDS chap3. Finding Similar ItemsMMDSbook
26
2023.07.21Paper presentationDahee Kim"Fast unfolding of communities in large networks"JSTAT 2008paperslidepresentation
27
StudySong KimMMDS chap7. ClusteringMMDSbook
28
2023.07.28StudyDahee KimMMDS chap11. Dimensionality ReductionMMDSbook
29
Paper presentation-Road network paper brief review
30
2023.08.04StudyDahee KimMMDS chap8. Advertising on the Web
31
Paper presentationChanu Park"Targeted π‘˜-node Collapse Problem"VLDB 2022?paperslidepresentation
32
2023.08.11Paper presentationSong Kim"Densest Diverse Subgraphs- How to Plan a Successful Cocktail Party with Diversity"KDD 2023paperslidepresentation
33
Paper presentationHyewon Kim""Efficient Size-Bounded Community Search over Large NetworksVLDB 2021paperslidepresentation
34
Study-MMDS chap10. Mining Social-Network Graphs part1MMDSbook
35
2023.08.18Tutorial
Chanu Park,Jeonghan Son
Densest subgraph tutorialKDD 2015
36
Study-MMDS chap10. Mining Social-Network Graphs part2MMDSbook
37
2023.09.01Allindividual research sharing
38
2023.09.08Paper presentationSong Kim"Fast Top k simple shortest path"CIKM2010paperslidepresentation
39
3weeksAllpaper review
40
2023.10.06StudyWoocheol Shinprove why the greedy algorithm for maximizing a monotonic submodular function holds 1 βˆ’ 1/𝑒 approximation ratioslide
41
2023.10.27Paper presentationJeonghan SonTowards a β€œSwiss Army Knife” for Scalable User-Defined Temporal (π‘˜, 𝑋)-Core Analysispaperslide
42
2023.11.02Paper presentationSong KimModule identification in bipartite and directed networksAPS2007paperslidepresentation
43
2023.11.17Paper presentationDahee KimCo-guided Random Walk for Polarized Communities SearchCIKM2023paperslidepresentation
44
2023.11.24Paper presentationJeonghan Son"Hypercore_Maintenance_in_Dynamic_Hypergraphs"ICDE 2021paperslidepresentation
45
---------
46
2024.01.05Paper presentationSong Kim"Measuring and Improving the Core Resilience of Networks"SIGMOD2023paperslidepresentation
47
StudyWoocheol ShinMachine Learning with graph chap2,3
48
2024.01.12Paper presentationDahee Kim"ICS-GNN- lightweight interactive community search via graph neural network"VLDB2021paperslidepresentation
49
StudySong KimMachine Learning with graph chap4,5
50
2024.01.19Paper presentationSeongsik Hwang"k-core maximization"IJCAI 2019paperslidepresentation
51
StudyWoocheol ShinMachine Learning with graph chap6,7
52
2024.01.26Paper presentationHyewon Kim"Discovering Polarized Communities in Signed Networks"CIKM 2019paperslidepresentation
53
StudySeongsik HwangMachine Learning with graph chap8,9
54
2024.02.02StudyHyewon KimMachine Learning with graph chap10,11
55
StudySong kimSpectral graph theory chap 13
56
2024.02.08StudyDahee KimMachine Learning with graph chap12,13
57
StudyWoocheol ShinSpectral graph theory chap 14
58
2024.02.15StudyWoocheol ShinMachine Learning with graph chap14,15
59
Paper presentationSeongsik Hwang"Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks"WEA 2008paperslidepresentation
60
2024.02.23StudyDahee KimMachine Learning with graph chap16,17
61
StudySeongsik HwangSpectral graph theory chap 15
62
2024.03.04Paper presentation Seongsik Hwang"Maximizing (k, L)-Core With Edge Augmentation in Multilayer Graphs"TCSS 2023paperslide
63
2024.03.13Paper presentationWoocheol Shin"Local Centrality Minimization with Quality Guarantees"paper
64
StudySong KimBranch And Bound Algorithm
65
2024.03.22Paper presentationSong Kim"Uncovering the Largest Community in Social Networks at Scale"IJCAI 2023paper
66
2024.03.29Paper presentationHyewon Kim"Top-k Socio-Spatial Co-Engaged Location Selection for Social Users"TKDE 2023paper
67
2024.04.12Paper presentationHyewon Kim"Clique relaxations in social network analysis_ the maximum k-plex problem"paperslidepresentation
68
2024.04.23Paper presentationDahee Kim"Ollivier-Ricci Curvature-Based Method to Community Detection in Complex Networks"Scientific Reports 2019paperslide
69
----------
70
2024.06.20StudySeongsik HwangFibonacci heapslidepresentation
71
Paper presentationSong Kim"MCR-Tree: An Efficient Index for Multi-dimensional Core Search"SIGMOD 2024paperslidepresentation
72
2024.06.24StudyDahee KimDifferential privacysildepresentation
73
Hyewon KimCardinality estimation and HyperLogLogslide
74
2024.07.03StudyHyewon KimAmortized time complexity - CLRS3 - Ch 17
75
Paper presentationDahee KimNeural Attributed Community Search at Billion ScaleSIGMOD 2023paperslide
76
2024.07.10StudySeongsik HwangMaximum flow - CLRS3 - Ch 26
77
Paper presentationSong Kim"A Similarity-based Approach for Efficient Large Quasi-clique Detection"WWW 2024paperslide
78
2024.07.16StudyTaejoon HanLinear Programming - CLRS3 - Ch 29
79
Paper presentationSeongsik Hwang"What Is a Network Community?: A Novel Quality Function and Detection Algorithms"CIKM 2015paperslide
80
2024.07.23Paper presentationSeongsik Hwang"Scalable top-k structural diversity search"ICDE 2017paperslide
81
2024.07.30Paper presentationTaejoon Han"Fast Multilayer Core Decomposition and Indexing"ICDE 2024paperslide
82
2024.08.08StudySong KimRecommenation System - MMDS - Ch9
83
Paper presentationDahee Kim"Effective Individual Fairest Community Search over Heterogeneous Information Networks"arxiv 2024paper
84
2024.08.13StudyTaejoon HanDimensionality Reduction - MMDS - Ch 11
85
2024.08.21StudySong KimMining data streaming - MMDS - Ch 4
86
2024.08.27StudyHyewon KimMIT 6.034 Artificial Intelligence, Fall 2010 Lecture 16. Support Vector MachineLecturevideo
87
2024.09.03StudyTaejoon HanChap 9. Anomaly detection
88
2024.09.26Paper presentationSong Kim"Efficient Algorithms for Maximal π‘˜-Biplex Enumeration"SIGMOD 2022paperslide
89
Paper presentationDahee Kim"Efficient Community Search Based on Relaxed k-Truss Index"SIGIR 2024paperslide
90
Paper presentationHyewon Kim"Efficient Unsupervised Community Search with Pre-trained Graph Transformer"VLDB 2024paperslide
91
2024.10.10StudySong KimPSPACE: A class of problems beyonds NP - KT2 - Ch 9
92
Paper presentationDahee Kim"Graph Transformer Networks"NeurIPS 2019paperslidepresentation
93
2024.10.18οΏ½TutorialHyewon KimChatGPT Prompt Engineering for Developersvideoslide
94
2024.11.11TutorialSong KimQuantum algorithmslidepresentation
95
2024.11.14Study
Dahee Kim, Song Kim
Extending the limits of tractability - KT2 - Ch 10
96
2024.11.22Paper presentationSong Kim"Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach"SIGMOD 2023paperslidepresentation
97
2024.11.29Paper presentationSong Kim"Quantum Algorithm for the Maximum K-Plex Problem"ICDE 2024paperslidepresentation
98
2024.12.13Paper presentationHyewon Kim
"Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs"
FOCS 2022paperslide
99
StudyHyewon KimRandomized Algorithms - KT2 - Ch 10
100
2024.12.20StudySong KimRandomized Algorithms - KT2 - Ch 10