Title: Summary of k-means Algorithm and Its Deformation

Keynote Speaker: Xu Dachuan

Abstract: k-means algorithm is a commonly-seen problem in computer science and optimal grouping. k-means clustering algorithm, as one of the most valued and simplest clustering analysis methods, is widely used in data mining. In this report, it mainly introduces the classical k-mean algorithm and its deformation & application in different forms and fields, and summarizes the issues remained to be studied in k-mean algorithm.

Speaker Introduction: Xu Dachuan, professional responsibility professor of "Operational Research and Cybernetics", College of Applied Sciences, Beijing University of Technology, and doctoral supervisor; deputy director of the Blockchain Research Center of Beijing University of Technology. In 2002, he received his Doctor of Science from the Institute of Computational Mathematics and Scientific/Engineering Computing of the Academy of Mathematics and Systems Science, Chinese Academy of Sciences. In 2004, he finished his post-doctoral career at the Institute of Applied Mathematics, AMSS, CAS. He has visited Stanford University, University of New Brunswick, Simon Fraser University, and Chinese University of Hong Kong.  He shows great interests in machine learning and optimization, optimal grouping, approximation algorithm, robust optimization, algorithmic game theory, and supply chain management. He serves as chairman of the Mathematical Programming Branch of Operations Research Society of China, deputy secretary general/director of the Operations Research Society of China, director of the Chinese Mathematical Society, and vice chairman of the Beijing Operations Research Society. He is an editor or a guest editor of Applied Mathematics and Computation and Algorithmica. He has won the first prize of the Young Paper Award of the Operations Research Society of China, and the Newcomer Award of Operations Research of the Operations Research Society of China; presided over six projects and one sub-project of the Natural Science Foundation of China; published the Approximation Algorithm for Facility Location Problem and published more than 100 academic papers in journals such as Mathematical Programming.

Inviter: Li Guojun, professor of School of Mathematics

Time: 9:00, May 24 (Friday)

Location: Hall 1032, Block B, Zhixin Building, Central Campus

Hosted by: School of Mathematics, Shandong University