Clustering Merchants and Accurate Marketing of Products Using the Segmentation Tree Vector Space Model
Xuwu Ding,
Zhong Wu,
Meng Li and
Hangjun Che
Mathematical Problems in Engineering, 2022, vol. 2022, 1-11
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.
Date: 2022
References: Add references at CitEc
Citations:
Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/7353151.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/7353151.xml (application/xml)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:7353151
DOI: 10.1155/2022/7353151
Access Statistics for this article
More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().