Fast kernel matrix computation for big data clustering

被引：0
|
作者：
20153401191949
机构：
来源：
(1) Aristotle University of Thessaloniki, Thessaloniki, Greece | / Elsevier B.V., Netherlands期
关键词：
Kernel k-Means is a basis for many state of the art global clustering approaches. When the number of samples grows too big; however; it is extremely time-consuming to compute the entire kernel matrix and it is impossible to store it in the memory of a single computer. The algorithm of Approximate Kernel k-Means has been proposed; which works using only a small part of the kernel matrix. The computation of the kernel matrix; even a part of it; remains a significant bottleneck of the process. Some types of kernel; can be computed using matrix multiplication. Modern CPU architectures and computational optimization methods allow for very fast matrix multiplication; thus those types of kernel matrices can be computed much faster than others. © The Authors. Published by Elsevier B.V;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
112773
引用
收藏
相关论文
共 50 条
  • [21] Fast approximated relational and kernel clustering
    Schleif, Frank-Michael
    Zhu, Xibin
    Gisbrecht, Andrej
    Hammer, Barbara
    2012 21ST INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR 2012), 2012, : 1229 - 1232
  • [22] Fast and Scalable Big Data Trajectory Clustering for Understanding Urban Mobility
    Kumar, Dheeraj
    Wu, Huayu
    Rajasegarar, Sutharshan
    Leckie, Christopher
    Krishnaswamy, Shonali
    Palaniswami, Marimuthu
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2018, 19 (11) : 3709 - 3722
  • [23] The fast clustering algorithm for the big data based on K-means
    Xie, Ting
    Zhang, Taiping
    INTERNATIONAL JOURNAL OF WAVELETS MULTIRESOLUTION AND INFORMATION PROCESSING, 2020, 18 (06)
  • [24] Fast clustering algorithm of commodity association big data sparse network
    Pan, Hailan
    Yang, Xiaohuan
    INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT, 2021, 12 (04) : 667 - 674
  • [25] Fast clustering for sparse network of retail products associated big data
    Li T.-Y.
    Li F.
    Chen Y.
    Lyu X.-N.
    Li, Tao-Ying (ytaoli@126.com), 2018, Northeast University (33): : 1117 - 1122
  • [26] Fast clustering algorithm of commodity association big data sparse network
    Hailan Pan
    Xiaohuan Yang
    International Journal of System Assurance Engineering and Management, 2021, 12 : 667 - 674
  • [27] Fast spectral clustering of data using sequential matrix compression
    Chen, Bo
    Gao, Bin
    Liu, Tie-Yan
    Chen, Yu-Fu
    Ma, Wei-Ying
    MACHINE LEARNING: ECML 2006, PROCEEDINGS, 2006, 4212 : 590 - 597
  • [28] Fast kernel feature ranking using class separability for big data mining
    Zhiliang Liu
    The Journal of Supercomputing, 2016, 72 : 3057 - 3072
  • [29] Fast kernel feature ranking using class separability for big data mining
    Liu, Zhiliang
    JOURNAL OF SUPERCOMPUTING, 2016, 72 (08): : 3057 - 3072
  • [30] A Data Science and Engineering Solution for Fast k-Means Clustering of Big Data
    Dierckens, Karl E.
    Harrison, Adrian B.
    Leung, Carson K.
    Pind, Adrienne V.
    2017 16TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS / 11TH IEEE INTERNATIONAL CONFERENCE ON BIG DATA SCIENCE AND ENGINEERING / 14TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE AND SYSTEMS, 2017, : 925 - 932
12345