基于个性化阈值的多序列效用挖掘

Wensheng Gan, Jerry Chun‐wei Lin, Jiexiong Zhang, Philip S. Yu
{"title":"基于个性化阈值的多序列效用挖掘","authors":"Wensheng Gan, Jerry Chun‐wei Lin, Jiexiong Zhang, Philip S. Yu","doi":"10.1145/3362070","DOIUrl":null,"url":null,"abstract":"Utility-oriented pattern mining is an emerging topic, since it can reveal high-utility patterns from different types of data, which provides more information than the traditional frequency/confidence-based pattern mining models. The utilities of various items/objects are not exactly equal in realistic situations; each item/object has its own utility or importance. In general, the user considers a uniform minimum utility (minutil) threshold to identify the set of high-utility sequential patterns (HUSPs). This is unable to find the interesting patterns while the minutil is set extremely high or low. We first design a new utility mining framework namely USPT for mining high-Utility Sequential Patterns across multi-sequences with individualized Thresholds. Each item in the designed framework has its own specified minimum utility threshold. Based on the lexicographic-sequential tree and the utility-array structure, the USPT framework is presented to efficiently discover the HUSPs. With the upper-bounds on utility, several pruning strategies are developed to prune the unpromising candidates early in the search space. Several experiments are conducted on both real-life and synthetic datasets to show the performance of the designed USPT algorithm, and the results show that USPT could achieve good effectiveness and efficiency for mining HUSPs with individualized minimum utility thresholds.","PeriodicalId":93404,"journal":{"name":"ACM/IMS transactions on data science","volume":"277 1-2 1","pages":"1 - 29"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Utility Mining across Multi-Sequences with Individualized Thresholds\",\"authors\":\"Wensheng Gan, Jerry Chun‐wei Lin, Jiexiong Zhang, Philip S. Yu\",\"doi\":\"10.1145/3362070\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Utility-oriented pattern mining is an emerging topic, since it can reveal high-utility patterns from different types of data, which provides more information than the traditional frequency/confidence-based pattern mining models. The utilities of various items/objects are not exactly equal in realistic situations; each item/object has its own utility or importance. In general, the user considers a uniform minimum utility (minutil) threshold to identify the set of high-utility sequential patterns (HUSPs). This is unable to find the interesting patterns while the minutil is set extremely high or low. We first design a new utility mining framework namely USPT for mining high-Utility Sequential Patterns across multi-sequences with individualized Thresholds. Each item in the designed framework has its own specified minimum utility threshold. Based on the lexicographic-sequential tree and the utility-array structure, the USPT framework is presented to efficiently discover the HUSPs. With the upper-bounds on utility, several pruning strategies are developed to prune the unpromising candidates early in the search space. Several experiments are conducted on both real-life and synthetic datasets to show the performance of the designed USPT algorithm, and the results show that USPT could achieve good effectiveness and efficiency for mining HUSPs with individualized minimum utility thresholds.\",\"PeriodicalId\":93404,\"journal\":{\"name\":\"ACM/IMS transactions on data science\",\"volume\":\"277 1-2 1\",\"pages\":\"1 - 29\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM/IMS transactions on data science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3362070\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM/IMS transactions on data science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3362070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

面向实用的模式挖掘是一个新兴的主题,因为它可以从不同类型的数据中揭示高实用模式,这比传统的基于频率/置信度的模式挖掘模型提供更多的信息。在现实情境中,各种道具/对象的效用并不完全相等;每个项目/对象都有自己的用途或重要性。通常,用户会考虑一个统一的最小效用(minutil)阈值来识别一组高效用顺序模式(husp)。当分值设置得非常高或非常低时,这将无法找到有趣的模式。我们首先设计了一个新的实用挖掘框架,即USPT,用于挖掘具有个性化阈值的多序列的高实用序列模式。所设计框架中的每个项都有自己指定的最小实用阈值。基于字典序树结构和效用数组结构,提出了一种USPT框架来有效地发现husp。根据效用的上界,提出了几种修剪策略,以便在搜索空间的早期对没有希望的候选对象进行修剪。在实际数据集和合成数据集上进行了实验,验证了所设计的USPT算法的性能,结果表明,USPT算法对于具有个性化最小效用阈值的husp挖掘具有良好的有效性和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Utility Mining across Multi-Sequences with Individualized Thresholds
Utility-oriented pattern mining is an emerging topic, since it can reveal high-utility patterns from different types of data, which provides more information than the traditional frequency/confidence-based pattern mining models. The utilities of various items/objects are not exactly equal in realistic situations; each item/object has its own utility or importance. In general, the user considers a uniform minimum utility (minutil) threshold to identify the set of high-utility sequential patterns (HUSPs). This is unable to find the interesting patterns while the minutil is set extremely high or low. We first design a new utility mining framework namely USPT for mining high-Utility Sequential Patterns across multi-sequences with individualized Thresholds. Each item in the designed framework has its own specified minimum utility threshold. Based on the lexicographic-sequential tree and the utility-array structure, the USPT framework is presented to efficiently discover the HUSPs. With the upper-bounds on utility, several pruning strategies are developed to prune the unpromising candidates early in the search space. Several experiments are conducted on both real-life and synthetic datasets to show the performance of the designed USPT algorithm, and the results show that USPT could achieve good effectiveness and efficiency for mining HUSPs with individualized minimum utility thresholds.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信