IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7353151.html
   My bibliography  Save this article

Clustering Merchants and Accurate Marketing of Products Using the Segmentation Tree Vector Space Model

Author

Listed:
  • Xuwu Ding
  • Zhong Wu
  • Meng Li
  • Hangjun Che

Abstract

Using social commerce users as the data source, a reasonable and effective interest expression mechanism is used to construct an interest graph of sample users to achieve the purpose of clustering merchants and users as well as realizing accurate marketing of products. By introducing an improved vector space model, the segmentation tree vector space model, to express the interests of the target user group and, on this basis, using the complex network analysis tool Gephi to construct an interest graph, based on the user interest graph, we use Python to implement the K-means algorithm and the users of the sample set according to interest topics for community discovery. The experimental results show that the interests of the sample users are carefully divided, each user is divided into different thematic communities according to different interests, and the constructed interest graph is more satisfactory. The research design of the social commerce user interest mapping scheme is highly feasible, reasonable, and effective and provides new ideas for the research of interest graph, and the boundaries of thematic communities based on interests are clear.

Suggested Citation

  • Xuwu Ding & Zhong Wu & Meng Li & Hangjun Che, 2022. "Clustering Merchants and Accurate Marketing of Products Using the Segmentation Tree Vector Space Model," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-11, March.
  • Handle: RePEc:hin:jnlmpe:7353151
    DOI: 10.1155/2022/7353151
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7353151.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7353151.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/7353151?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:7353151. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.