Welcome to MINDS!

Established in 2020, POSTECH Mathematical Institute for Data Science (MINDS) is the community of researchers in the areas of fundamental data science, machine learning, artificial intelligence, scientific computing, and humanitarian data science. MINDS mission is to provide a platform for collaboration among researchers and to provide various opportunities for students in data science. MINDS also aims to use our data science research to serve our local and global communities pursuing humanitarian data science.

News

🌟 DACON Ranker Special Lecture: Winning Strategies for AI Competitions 🌟 2023.11.30

3nd POSTECH&Peking SIAM Student Chapter Joint Conference 2023.11.01

2023 PSSC Summer Camp 2023.10.04

[POSTECH(포항공과대학교) 수리 데이터과학 연구소 연구계약직 공고]-상시모집 2023.07.25

[POSTECH(포항공과대학교) 수리 데이터과학 연구소 연구계약직 공고] 2023.07.14

[POSTECH(포항공과대학교) 수리 데이터과학 연구소 연구교수 채용 공고] 2023.06.12

Seminar | Joint seminar for probability and mathematical biology 2023.05.02

[POSTECH(포항공과대학교) 수리 데이터과학 연구소 연구계약직 공고] 2023.02.15

Upcoming Events

Schedule

MINDS SEMINAR

MINDS-CM2LA Seminar Series | Woo-Jin Kim (KAIST) - Persistence Diagrams at the Crossroads of Algebra and Combinatorics

MINDS SEMINAR

period : 2023-12-12 ~ 2023-12-12

time : 17:00:00 ~ 18:00

개최 장소 : Math Bldg 404 & Online streaming (Zoom)

Topic : Persistence Diagrams at the Crossroads of Algebra and Combinatorics

개요

Date	2023-12-12 ~ 2023-12-12	Time	17:00:00 ~ 18:00
Speaker	Woo-Jin Kim	Affiliation	KAIST
Place	Math Bldg 404 & Online streaming (Zoom)	Streaming link	ID : 688 896 1076 / PW : 54321
Topic	Persistence Diagrams at the Crossroads of Algebra and Combinatorics
Contents	Persistent Homology (PH) is a method used in Topological Data Analysis (TDA) to extract multiscale topological features from data. Via PH, the multiscale topological features of a given dataset are encoded into a persistence module (indexed by a totally ordered set) and in turn, summarized by a persistence diagram. In order to extend PH so as to be able to study wider types of data (e.g. time-varying point clouds), variations of the indexing set of persistence modules must inevitably occur, leading for example to multiparameter persistence modules, i.e. persistence modules indexed by the n-dimensional grid. It is however not always evident how to define a notion of persistence diagram for such variants. This talk will introduce a generalized notion of persistence diagram for such variants which arises through exploiting both the principle of inclusion and exclusion from combinatorics and the canonical map from the limit to the colimit of a diagram of vector spaces (these being notions from category theory). We also discuss (1) how the generalized persistence diagram subsumes some other well-known invariants of multiparameter persistence modules and (2) algorithmic considerations for computing the generalized persistence diagram.