IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v402y2021ics0096300321000850.html
   My bibliography  Save this article

Fast kernel k-means clustering using incomplete Cholesky factorization

Author

Listed:
  • Chen, Li
  • Zhou, Shuisheng
  • Ma, Jiajun
  • Xu, Mingliang

Abstract

Kernel-based clustering algorithms can identify and capture the nonlinear structure in datasets, thereby achieving better performance than linear clustering. However, the large amount of memory involved in computing and storing the entire kernel matrix makes it difficult for kernel-based clustering to handle large-scale datasets. In this study, we prove that an incomplete Cholesky factorization (InCF) can generate an approximate matrix with rank s for a kernel matrix after s iterations. We also show that the approximation error decreases exponentially as the number of iterations increases when the exponential decay of the kernel matrix eigenvalues is sufficiently fast. We therefore employ InCF to accelerate kernel clustering and save memory space. The key idea of the proposed kernel k-means clustering using InCF is that the entire kernel matrix is approximated as the product of a low-rank matrix and its transpose. Then, linear k-means clustering is applied to the columns of the transpose of the low-rank matrix. We prove that the clustering error achieved by this method decreases exponentially as the rank of the approximate matrix increases. Experimental results show that the performance of the proposed algorithm is similar to that of the kernel k-means clustering algorithm, but the method can be applied to large-scale datasets.

Suggested Citation

  • Chen, Li & Zhou, Shuisheng & Ma, Jiajun & Xu, Mingliang, 2021. "Fast kernel k-means clustering using incomplete Cholesky factorization," Applied Mathematics and Computation, Elsevier, vol. 402(C).
  • Handle: RePEc:eee:apmaco:v:402:y:2021:i:c:s0096300321000850
    DOI: 10.1016/j.amc.2021.126037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321000850
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2021.126037?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wang, Kuaini & Cao, Jinde & Pei, Huimin, 2020. "Robust extreme learning machine in the presence of outliers by iterative reweighted algorithm," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fugang LI & Guangwen MA & Shijun CHEN & Weibin HUANG, 2021. "An Ensemble Modeling Approach to Forecast Daily Reservoir Inflow Using Bidirectional Long- and Short-Term Memory (Bi-LSTM), Variational Mode Decomposition (VMD), and Energy Entropy Method," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 35(9), pages 2941-2963, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:402:y:2021:i:c:s0096300321000850. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.