|Title:||On the Computational Hardness of A Form of Density-Based Clustering: From Static to Dynamic|
|Date:||March 9, 2018 (Friday)|
|Time:||4:00 p.m. - 5:00 p.m.|
|Venue:||Room 121, 1/F, Ho Sin-hang Engineering Building,
The Chinese University of Hong Kong,
|Speaker:||Prof. Yufei Tao
Department of Computer Science and Engineering
The Chinese University of Hong Kong
The talk is about a popular form of density-based clustering that is known under the name "DBSCAN". Progress has been made in recent years towards understanding its computational hardness. We will discuss the current lower and upper bounds, covering (i) both the static and dynamic (including "insertion-only", and "insertions plus deletions") settings, and (ii) both the exact and approximate versions.
Yufei Tao is a Professor in the Department of Computer Science and Engineering, The Chinese University of Hong Kong. He served as an associate editor of ACM Transactions on Database Systems (TODS) from 2008 to 2015, and of IEEE Transactions on Knowledge and Data Engineering (TKDE) from 2012 to 2014. He served as a PC co-chair of International Conference on Data Engineering (ICDE) 2014. He gave a keynote speech at International Conference on Database Theory (ICDT) 2016. He received two best-paper awards at SIGMOD (in 2013 and 2015, respectively), and a Google Faculty Research Award in 2017. He is an ACM distinguished scientist.
Tea, coffee and cookies will be provided after seminar.
Enquiries: Ms. Crystal Tam at tel. 3943 8439
For more information, please refer to http://www.cse.cuhk.edu.hk/seminar.