基于有向图基序分析的典型购买模式提取方法

Kazufumi Inafuku, Takayasu Fushimi, T. Satoh
{"title":"基于有向图基序分析的典型购买模式提取方法","authors":"Kazufumi Inafuku, Takayasu Fushimi, T. Satoh","doi":"10.1145/3011141.3011178","DOIUrl":null,"url":null,"abstract":"As online stores continue to expand their businesses, a huge number of customer purchase data can be obtained. When users purchase a product, almost all users tend to post reviews on it. Therefore review data can be treated as propinquity of purchase data. In this paper, we propose a novel method that extracts typical purchase patterns based on motif analysis of a directed graph constructed from review history data. We first construct a directed graph called a purchase history graph (PHG), where a node stands for an item and a directional edge is added between successively purchased two items in chronological order. Second we decompose all of the item nodes of PHG into weakly connected components (WCCs) and expect that each WCC consists of items that are sold by the same store. For each WCC, to extract frequently appearing local edge structures, we enumerate the number of 3-node motif patterns, which is a well-known notion in complex network science. These only express theoretic patterns; the actual typical ones are slightly more complicated. Thus, we construct motif vectors, which stand for how many individual patterns are contained in each WCC. Finally, we divide all of the WCCs into K clusters based on the similarity of the motif vectors. In the above procedure, we extract the typical purchase patterns of users. From our experimental evaluation using real review dataset, we confirm the validity of each step of our proposed method and discuss the results obtained from it.","PeriodicalId":247823,"journal":{"name":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Extraction method of typical purchase patterns based on motif analysis of directed graphs\",\"authors\":\"Kazufumi Inafuku, Takayasu Fushimi, T. Satoh\",\"doi\":\"10.1145/3011141.3011178\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As online stores continue to expand their businesses, a huge number of customer purchase data can be obtained. When users purchase a product, almost all users tend to post reviews on it. Therefore review data can be treated as propinquity of purchase data. In this paper, we propose a novel method that extracts typical purchase patterns based on motif analysis of a directed graph constructed from review history data. We first construct a directed graph called a purchase history graph (PHG), where a node stands for an item and a directional edge is added between successively purchased two items in chronological order. Second we decompose all of the item nodes of PHG into weakly connected components (WCCs) and expect that each WCC consists of items that are sold by the same store. For each WCC, to extract frequently appearing local edge structures, we enumerate the number of 3-node motif patterns, which is a well-known notion in complex network science. These only express theoretic patterns; the actual typical ones are slightly more complicated. Thus, we construct motif vectors, which stand for how many individual patterns are contained in each WCC. Finally, we divide all of the WCCs into K clusters based on the similarity of the motif vectors. In the above procedure, we extract the typical purchase patterns of users. From our experimental evaluation using real review dataset, we confirm the validity of each step of our proposed method and discuss the results obtained from it.\",\"PeriodicalId\":247823,\"journal\":{\"name\":\"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3011141.3011178\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3011141.3011178","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

随着网店业务的不断扩大,可以获得大量的顾客购买数据。当用户购买产品时,几乎所有用户都倾向于发表评论。因此,评审数据可以被视为采购数据的接近性。本文提出了一种基于有向图基序分析的典型购买模式提取方法。我们首先构造了一个被称为购买历史图(PHG)的有向图,其中一个节点代表一个项目,并且在连续购买的两个项目之间按时间顺序添加了一个方向边。其次,我们将PHG的所有物品节点分解为弱连接组件(WCC),并期望每个WCC由同一商店出售的物品组成。对于每个WCC,为了提取频繁出现的局部边缘结构,我们列举了复杂网络科学中众所周知的3节点基序模式的数量。这些只是表达理论模式;实际的典型案例要稍微复杂一些。因此,我们构建基序向量,它代表每个WCC中包含的单个模式的数量。最后,我们根据基序向量的相似性将所有wcc划分为K类。在上面的过程中,我们提取了用户的典型购买模式。通过对真实综述数据集的实验评估,我们验证了所提方法每一步的有效性,并讨论了所得到的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Extraction method of typical purchase patterns based on motif analysis of directed graphs
As online stores continue to expand their businesses, a huge number of customer purchase data can be obtained. When users purchase a product, almost all users tend to post reviews on it. Therefore review data can be treated as propinquity of purchase data. In this paper, we propose a novel method that extracts typical purchase patterns based on motif analysis of a directed graph constructed from review history data. We first construct a directed graph called a purchase history graph (PHG), where a node stands for an item and a directional edge is added between successively purchased two items in chronological order. Second we decompose all of the item nodes of PHG into weakly connected components (WCCs) and expect that each WCC consists of items that are sold by the same store. For each WCC, to extract frequently appearing local edge structures, we enumerate the number of 3-node motif patterns, which is a well-known notion in complex network science. These only express theoretic patterns; the actual typical ones are slightly more complicated. Thus, we construct motif vectors, which stand for how many individual patterns are contained in each WCC. Finally, we divide all of the WCCs into K clusters based on the similarity of the motif vectors. In the above procedure, we extract the typical purchase patterns of users. From our experimental evaluation using real review dataset, we confirm the validity of each step of our proposed method and discuss the results obtained from it.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信