挖掘兴趣购买模式:一种颗粒计算方法

Yingjie Lv, Yijun Li, Di Song
{"title":"挖掘兴趣购买模式:一种颗粒计算方法","authors":"Yingjie Lv, Yijun Li, Di Song","doi":"10.1109/ICSSSM.2007.4280167","DOIUrl":null,"url":null,"abstract":"Nowadays, information technologies are widely used in business. Enterprises hope to make good use of the advanced technologies to analyze customer purchase behavior for better marketing. So it has become a hot issue to find interesting customer purchase patterns in a large amount of information. This paper proposes a method of granular computing to mine interesting purchase patterns. The granule represents a set of tuples that have the same attribute value in the database. For all tuples involved in interesting purchase patterns, we can represent them by using existing granules or creating new granules by logical operations (AND or OR) among existing granules. And then we use these granules to generate interesting patterns. This method not only can improve performance efficiently without scanning database repeatedly, but it is easier to understand for users and improves process flexibility. Especially for some complicated user demands, some high-level concepts which users take interest in don't exist in the database, but we can generate new granules by OR operations to represent them. So it's very convenient to mine interesting purchase patterns using granular computing.","PeriodicalId":153603,"journal":{"name":"2007 International Conference on Service Systems and Service Management","volume":"94 45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Mining Interesting Purchase Patterns: A Method of Granular Computing\",\"authors\":\"Yingjie Lv, Yijun Li, Di Song\",\"doi\":\"10.1109/ICSSSM.2007.4280167\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, information technologies are widely used in business. Enterprises hope to make good use of the advanced technologies to analyze customer purchase behavior for better marketing. So it has become a hot issue to find interesting customer purchase patterns in a large amount of information. This paper proposes a method of granular computing to mine interesting purchase patterns. The granule represents a set of tuples that have the same attribute value in the database. For all tuples involved in interesting purchase patterns, we can represent them by using existing granules or creating new granules by logical operations (AND or OR) among existing granules. And then we use these granules to generate interesting patterns. This method not only can improve performance efficiently without scanning database repeatedly, but it is easier to understand for users and improves process flexibility. Especially for some complicated user demands, some high-level concepts which users take interest in don't exist in the database, but we can generate new granules by OR operations to represent them. So it's very convenient to mine interesting purchase patterns using granular computing.\",\"PeriodicalId\":153603,\"journal\":{\"name\":\"2007 International Conference on Service Systems and Service Management\",\"volume\":\"94 45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Service Systems and Service Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSSSM.2007.4280167\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Service Systems and Service Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSSM.2007.4280167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

如今,信息技术被广泛应用于商业。企业希望利用先进的技术来分析顾客的购买行为,从而更好地进行营销。因此,如何从海量的信息中发现有趣的顾客购买模式成为一个热点问题。提出了一种基于粒度计算的有趣购买模式挖掘方法。颗粒表示数据库中具有相同属性值的一组元组。对于所有涉及有趣购买模式的元组,我们可以通过使用现有的颗粒或通过在现有颗粒之间的逻辑操作(AND或or)创建新的颗粒来表示它们。然后我们用这些颗粒来生成有趣的图案。这种方法不仅可以在不重复扫描数据库的情况下有效地提高性能,而且用户更容易理解,提高了流程的灵活性。特别是对于一些复杂的用户需求,一些用户感兴趣的高级概念在数据库中不存在,但我们可以通过OR操作生成新的颗粒来表示它们。因此,使用颗粒计算来挖掘有趣的购买模式是非常方便的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mining Interesting Purchase Patterns: A Method of Granular Computing
Nowadays, information technologies are widely used in business. Enterprises hope to make good use of the advanced technologies to analyze customer purchase behavior for better marketing. So it has become a hot issue to find interesting customer purchase patterns in a large amount of information. This paper proposes a method of granular computing to mine interesting purchase patterns. The granule represents a set of tuples that have the same attribute value in the database. For all tuples involved in interesting purchase patterns, we can represent them by using existing granules or creating new granules by logical operations (AND or OR) among existing granules. And then we use these granules to generate interesting patterns. This method not only can improve performance efficiently without scanning database repeatedly, but it is easier to understand for users and improves process flexibility. Especially for some complicated user demands, some high-level concepts which users take interest in don't exist in the database, but we can generate new granules by OR operations to represent them. So it's very convenient to mine interesting purchase patterns using granular computing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信