Scalable kernel K-means clustering with nystrom approximation: Relative-error bounds

被引：0
|
作者：
Wang, Shusen [1 ]
Gittens, Alex [2 ]
Mahoney, Michael W. [3 ]
机构：
[1] Department of Computer Science, Stevens Institute of Technology, Hoboken,NJ,07030, United States
[2] Computer Science Department, Rensselaer Polytechnic Institute, Troy,NY,12180, United States
[3] International Computer Science Institute, Department of Statistics, University of California at Berkeley, Berkeley,CA,94720, United States
来源：
Journal of Machine Learning Research | 2019年 / 20卷
关键词：
903.1 Information Sources and Analysis - 921 Mathematics - 921.1 Algebra - 921.5 Optimization Techniques - 921.6 Numerical Methods;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
95
引用
收藏
相关论文
共 50 条
  • [11] An Improved Kernel K-means Clustering Algorithm
    Liu, Yang
    Yin, Hong Peng
    Chai, Yi
    PROCEEDINGS OF 2016 CHINESE INTELLIGENT SYSTEMS CONFERENCE, VOL I, 2016, 404 : 275 - 280
  • [12] Scalable Fast Evolutionary k-means Clustering
    de Oliveira, Gilberto Viana
    Naldi, Murilo Coelho
    2015 BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS 2015), 2015, : 74 - 79
  • [13] The Nystrom Kernel Conjugate Gradient Algorithm Based on k-Means Sampling
    He, Fuliang
    Xiong, Kui
    Wang, Shiyuan
    IEEE ACCESS, 2020, 8 : 18716 - 18726
  • [14] Nystrom Method with Kernel K-means plus plus Samples as Landmarks
    Oglic, Dino
    Gartner, Thomas
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [15] KERNEL MATRIX TRIMMING FOR IMPROVED KERNEL K-MEANS CLUSTERING
    Tsapanos, Nikolaos
    Tefas, Anastasios
    Nikolaidis, Nikolaos
    Pitas, Ioannis
    2015 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2015, : 2285 - 2289
  • [16] Refined Learning Bounds for Kernel and Approximate k-Means
    Liu, Yong
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [17] Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search
    Moseley, Benjamin
    Wang, Joshua R.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), 2017, 30
  • [18] Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search
    Moseley, Benjamin
    Wang, Joshua R.
    JOURNAL OF MACHINE LEARNING RESEARCH, 2023, 24
  • [19] Ball k-Means: Fast Adaptive Clustering With No Bounds
    Xia, Shuyin
    Peng, Daowan
    Meng, Deyu
    Zhang, Changqing
    Wang, Guoyin
    Giem, Elisabeth
    Wei, Wei
    Chen, Zizhong
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2022, 44 (01) : 87 - 99
  • [20] Scalable k-means for large-scale clustering
    Ming, Yuewei
    Zhu, En
    Wang, Mao
    Liu, Qiang
    Liu, Xinwang
    Yin, Jianping
    INTELLIGENT DATA ANALYSIS, 2019, 23 (04) : 825 - 838
12345