Clustering Merchants and Accurate Marketing of Products Using the Segmentation Tree Vector Space Model
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 vec...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2022
|
Subjects: | |
Online Access: | View Fulltext in Publisher |
LEADER | 02268nam a2200361Ia 4500 | ||
---|---|---|---|
001 | 10.1155-2022-7353151 | ||
008 | 220425s2022 CNT 000 0 und d | ||
020 | |a 1024123X (ISSN) | ||
245 | 1 | 0 | |a Clustering Merchants and Accurate Marketing of Products Using the Segmentation Tree Vector Space Model |
260 | 0 | |b Hindawi Limited |c 2022 | |
856 | |z View Fulltext in Publisher |u https://doi.org/10.1155/2022/7353151 | ||
520 | 3 | |a 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. © 2022 Xuwu Ding et al. | |
650 | 0 | 4 | |a Analysis tools |
650 | 0 | 4 | |a Clusterings |
650 | 0 | 4 | |a Commerce |
650 | 0 | 4 | |a Complex network analysis |
650 | 0 | 4 | |a Complex networks |
650 | 0 | 4 | |a Data-source |
650 | 0 | 4 | |a Expression mechanism |
650 | 0 | 4 | |a Graph-based |
650 | 0 | 4 | |a K-means clustering |
650 | 0 | 4 | |a Marketing |
650 | 0 | 4 | |a Python |
650 | 0 | 4 | |a Social commerces |
650 | 0 | 4 | |a Trees (mathematics) |
650 | 0 | 4 | |a User groups |
650 | 0 | 4 | |a Users' interests |
650 | 0 | 4 | |a Vector space models |
650 | 0 | 4 | |a Vector spaces |
700 | 1 | |a Ding, X. |e author | |
700 | 1 | |a Li, M. |e author | |
700 | 1 | |a Wu, Z. |e author | |
773 | |t Mathematical Problems in Engineering |