IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-981-16-8656-6_67.html
   My bibliography  Save this book chapter

A Summary of User Profile Research Based on Clustering Algorithm

In: Liss 2021

Author

Listed:
  • Lizhi Peng

    (Beijing Institute of Graphic Communication)

  • Yangping Du

    (Beijing Institute of Graphic Communication)

  • Shuihai Dou

    (Beijing Institute of Graphic Communication)

  • Ta Na

    (Beijing Institute of Graphic Communication)

  • Xianyang Su

    (Beijing Institute of Graphic Communication)

  • Ye Liu

    (Beijing Institute of Graphic Communication)

Abstract

Clustering algorithm is applicable to calculate and analyze the potential characteristics of users’ data. The results of clustering can analyze the features of user profile, digitize them and construct a new user profile, which is an important basis for achieving accurate marketing and service to users and improving the experience of users in various fields at present. The article mainly provides an overview of the definition of user profile and classical clustering algorithms, summarizes the application of clustering algorithms in user profile, sorts out the advantages and disadvantages of the algorithm in the application, and puts forward some current problems of clustering algorithms applied to user profile, and prospects the future research directions. The relevant review in this paper can provide help for the subsequent research, which is related to user profile based on clustering algorithm.

Suggested Citation

  • Lizhi Peng & Yangping Du & Shuihai Dou & Ta Na & Xianyang Su & Ye Liu, 2022. "A Summary of User Profile Research Based on Clustering Algorithm," Lecture Notes in Operations Research, in: Xianliang Shi & Gábor Bohács & Yixuan Ma & Daqing Gong & Xiaopu Shang (ed.), Liss 2021, pages 758-769, Springer.
    • Handle: RePEc:spr:lnopch:978-981-16-8656-6_67
    DOI: 10.1007/978-981-16-8656-6_67
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:lnopch:978-981-16-8656-6_67. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.