VDPC: Variational Density Peak Clustering Algorithm
College of Information Engineering, Yangzhou University(扬州大学信息工程学院);Institute of Scientific and Technical Information of China(中国科学技术信息研究所);School of Computer Science and Engineering, Nanyang Technological University(南洋理工大学计算机科学与工程学院);College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院);Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly, Nanyang Technological University(南洋理工大学-不列颠哥伦比亚大学老年人积极生活卓越联合研究中心);Joint NTU-WeBank Research Centre on Fintech, Nanyang Technological University(南洋理工大学-微众银行金融科技联合研究中心)
Yizhang Wang, Di Wang, You Zhou, Xiaofeng Zhang, Chai Quek
The widely applied density peak clustering (DPC) algorithm makes an intuitive cluster formation assumption that cluster centers are often surrounded by data points with lower local density and far away from other data points with higher local density. However, this assumption suffers from one limitation that it is often problematic when identifying clusters with lower density because they might be easily merged into other clusters with higher density. As a result, DPC may not be able to identify clusters with variational density. To address this issue, we propose a variational density peak clustering (VDPC) algorithm, which is designed to systematically and autonomously perform the clustering task on datasets with various types of density distributions. Specifically, we first propose a novel method to identify the representatives among all data points and construct initial clusters based on the identified representatives for further analysis of the clusters' property. Furthermore, we divide all data points into different levels according to their local density and propose a unified clustering framework by combining the advantages of both DPC and DBSCAN. Thus, all the identified initial clusters spreading across different density levels are systematically processed to form the final clusters. To evaluate the effectiveness of the proposed VDPC algorithm, we conduct extensive experiments using 20 datasets including eight synthetic, six real-world and six image datasets. The experimental results show that VDPC outperforms two classical algorithms (i.e., DPC and DBSCAN) and four state-of-the-art extended DPC algorithms.
Variational Co-embedding Learning for Attributed Network Clustering
Data Science Institute, University of Technology Sydney(悉尼科技大学数据科学研究所);School of Information Technology, Deakin University(迪肯大学信息技术学院);School of Computer Science and Engineering, University of New South Wales(新南威尔士大学计算机科学与工程学院);School of Computer Science, University of Technology Sydney(悉尼科技大学计算机科学学院)
Learning Robust Representation for Clustering through Locality Preserving Variational Discriminative Network
Center for Data Science, Peking University(北京大学数据科学中心);MOE Key Laboratory of Computational Linguistic, School of EECS, Peking University(北京大学信息科学技术学院计算语言学教育部重点实验室);Mizuho Securities Co.,Ltd(瑞穗证券株式会社)
Large Scale Clustering with Variational EM for Gaussian Mixture Models
University of Oldenburg(奥尔登堡大学)
本文提出了一个初步的(预审查)版本的次线性变分算法各向同性高斯混合模型(GRESS)。TPAMI(doi:10.1109/TPAMI.2021.3133763)在论文"A Variational EM Acceleration for Efficient Clustering at Very Large Scales"中公布了针对具有对角协方差阵(而不是各向同性聚类)的GARCH的算法的进一步发展及其相应的基准测试结果。我们请读者参考TPAMI论文,而不是这个更早的arXiv版本(TPAMI论文也是开放获取的)。本文附带了公开的源代码(参见https://github.com/variational-sublinear-clustering)。请注意,TPAMI论文不再包含8000万微小图像数据集的基准测试,因为我们遵循数据集创建者的呼吁,停止使用该数据集。该项目的目的(产生了这个arXiv版本和后来的TPAMI论文)是探索当前的效率和大规模限制,以拟合用于聚类的参数模型到数据分布。为了降低计算复杂度,我们使用了一个基于截断变分EM的聚类目标(这降低了许多聚类的复杂性)与coreset目标(这降低了许多数据点的复杂性)相结合。我们使用有效的coreset建设和有效的播种,将理论上的次线性复杂度收益转化为一个有效的算法。在标准的大规模集群基准测试的应用中,我们观察到了与已经非常高效的…
Variational Graph Generator for Multi-View Graph Clustering
University of Electronic Science and Technology of China(电子科技大学);Virginia Tech(弗吉尼亚理工大学);Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China(电子科技大学深圳高等研究院);Sichuan University(四川大学);Shantou University(汕头大学);University of Illinois Chicago(伊利诺伊大学芝加哥分校);Lehigh University(理海大学)
A Deep Variational Approach to Clustering Survival Data
ETH Zürich(苏黎世联邦理工学院);Human Technopole(人类技术园);University Hospital Basel(巴塞尔大学医院);University Children’s Hospital Basel(巴塞尔大学儿童医院);University of Zürich(苏黎世大学);Politecnico di Milano(米兰理工大学);St. Gallen Cantonal Hospital(圣加仑州立医院)
University of Oxford(牛津大学);University of Cambridge(剑桥大学);University College London(伦敦大学学院);Health Data Research UK(英国健康数据研究中心);The Alan Turing Institute(艾伦·图灵研究所);University of Manchester(曼彻斯特大学)
Clustering by Contour coreset and variational quantum eigensolver
School of Computing and Information Systems, The University of Melbourne(墨尔本大学计算与信息系统学院);School of Physics, The University of Melbourne(墨尔本大学物理学院);Data61, CSIRO(澳大利亚联邦科学与工业研究组织 Data61)
VICatMix: variational Bayesian clustering and variable selection for discrete biomedical data
MRC Biostatistics Unit University of Cambridge East Forvie Building(医学研究理事会生物统计学单位剑桥大学东部大楼);MRC Biostatistics Unit and CRUK Cambridge Centre Ovarian Programme and Cambridge Institute of Therapeutic Immunology and Infectious Disease (CITIID) University of Cambridge(医学研究理事会生物统计学单位和癌症研究英国委员会剑桥中心卵巢计划及剑桥治疗免疫学和传染病研究所(CITIID)剑桥大学)
Interpretable Spectral Variational AutoEncoder (ISVAE) for time series clustering
Universidad Carlos III de Madrid(马德里卡洛斯三世大学);Instituto de Investigación Sanitaria Gregorio Marañón(格雷戈里奥·马拉尼翁卫生研究所);Evidence Based Behaviour (eB2)(循证行为(eB2));Oxford-Man Institute of Quantitative Finance, University of Oxford(牛津大学牛津-曼氏定量金融研究所)
Federated Learning via Variational Bayesian Inference: Personalization, Sparsity and Clustering
School of Artificial Intelligence, Xidian University(西安电子科技大学人工智能学院);LSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院);Noah’s Ark Lab, Huawei(华为诺亚实验室)
Physically Interpretable Representation Learning with Gaussian Mixture Variational AutoEncoder (GM-VAE)
Institute for Computational and Mathematical Engineering, Stanford University(计算与数学工程研究所,斯坦福大学);Department of Mechanical Engineering, Stanford University(机械工程系,斯坦福大学);National Renewable Energy Laboratory(国家可再生能源实验室);Ann and H.J. Smead Department of Aerospace Engineering Sciences, University of Colorado, Boulder(安与H.J.斯迈德航空航天工程科学系,科罗拉多大学,博尔德)