IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v36y2019i01ns0217595919500064.html
   My bibliography  Save this article

A Streaming Algorithm for k-Means with Approximate Coreset

Author

Listed:
  • Min Li

    (School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, P. R. China)

  • Dachuan Xu

    (Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing 100124, P. R. China)

  • Dongmei Zhang

    (School of Computer Science and Technology, Shandong Jianzhu University, Jinan 250101, P. R. China)

  • Tong Zhang

    (Department of Information and Operations Research, College of Applied Sciences, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing 100124, P.R. China)

Abstract

For computing the k-means clustering of the streaming and distributed big sparse data, we present an algorithm to obtain the sparse coreset for the k-means in polynomial time. This algorithm is mainly based on the explicit form of the center of mass and the approximate k-means. Because of the existence of the approximation, the coreset of the output inevitably has a factor, which can be controlled to be a very small constant.

Suggested Citation

  • Min Li & Dachuan Xu & Dongmei Zhang & Tong Zhang, 2019. "A Streaming Algorithm for k-Means with Approximate Coreset," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(01), pages 1-18, February.
    • Handle: RePEc:wsi:apjorx:v:36:y:2019:i:01:n:s0217595919500064
    DOI: 10.1142/S0217595919500064
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595919500064
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595919500064?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. Harold W. Kuhn, 1992. "An Efficient Algorithm for the Numerical Solution of the Generalized Weber Problem in Spatial Economics," Palgrave Macmillan Books, in: General Equilibrium Economics, chapter 9, pages 223-240, Palgrave Macmillan.
    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. Sai Ji & Dachuan Xu & Min Li & Yishui Wang, 2022. "Approximation algorithms for two variants of correlation clustering problem," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 933-952, July.
    2. Chenchen Wu & Donglei Du & Yue Kang, 0. "An approximation algorithm for stochastic multi-level facility location problem with soft capacities," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    3. Chenchen Wu & Donglei Du & Yue Kang, 2022. "An approximation algorithm for stochastic multi-level facility location problem with soft capacities," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1680-1692, October.
    4. Sai Ji & Dachuan Xu & Min Li & Yishui Wang, 0. "Approximation algorithms for two variants of correlation clustering problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.

    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:wsi:apjorx:v:36:y:2019:i:01:n:s0217595919500064. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

      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.