Discovering Spatial High Utility Itemsets in Spatiotemporal Databases

R. U. Kiran, K. Zettsu, Masashi Toyoda, Philippe Fournier-Viger, P. K. Reddy, M. Kitsuregawa
{"title":"Discovering Spatial High Utility Itemsets in Spatiotemporal Databases","authors":"R. U. Kiran, K. Zettsu, Masashi Toyoda, Philippe Fournier-Viger, P. K. Reddy, M. Kitsuregawa","doi":"10.1145/3335783.3335789","DOIUrl":null,"url":null,"abstract":"In real-world databases, high utility itemset (HUI) is an important class of regularities. Most previous studies have focused on mining HUIs in transactional databases and did not consider the spatiotemporal characteristics of items. In this study, a more flexible model of spatial HUIs (SHUIs) that exist in spatiotemporal databases is proposed. In a spatiotemporal database (STD), an itemset is said to be an SHUI if its utility is not less than a user-specified minimum utility and the distance between any two of its items is not more than a user-specified maximum distance. Identifying SHUIs is very challenging because the generated itemsets do not satisfy the anti-monotonic property. In this study, we present two novel pruning techniques for reducing computational costs. Moreover, a fast single scan algorithm is presented for effectively evaluating all SHUIs in a STD. Furthermore, two case studies are presented, in which the proposed model is used to identify useful information in traffic congestion data and air pollution data.","PeriodicalId":180985,"journal":{"name":"Proceedings of the 31st International Conference on Scientific and Statistical Database Management","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 31st International Conference on Scientific and Statistical Database Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3335783.3335789","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

In real-world databases, high utility itemset (HUI) is an important class of regularities. Most previous studies have focused on mining HUIs in transactional databases and did not consider the spatiotemporal characteristics of items. In this study, a more flexible model of spatial HUIs (SHUIs) that exist in spatiotemporal databases is proposed. In a spatiotemporal database (STD), an itemset is said to be an SHUI if its utility is not less than a user-specified minimum utility and the distance between any two of its items is not more than a user-specified maximum distance. Identifying SHUIs is very challenging because the generated itemsets do not satisfy the anti-monotonic property. In this study, we present two novel pruning techniques for reducing computational costs. Moreover, a fast single scan algorithm is presented for effectively evaluating all SHUIs in a STD. Furthermore, two case studies are presented, in which the proposed model is used to identify useful information in traffic congestion data and air pollution data.
在时空数据库中发现空间高实用项集
在现实数据库中,高效用项集(high utility itemset, HUI)是一类重要的规则。以往的研究大多侧重于挖掘事务性数据库中的hui,而没有考虑项目的时空特征。本文提出了一种更灵活的时空数据库空间HUIs模型。在时空数据库(STD)中,如果一个项目集的效用不小于用户指定的最小效用,并且其中任意两个项目之间的距离不大于用户指定的最大距离,则该项目集被称为SHUI。由于生成的项集不满足反单调性,识别shui是非常具有挑战性的。在这项研究中,我们提出了两种新的修剪技术来降低计算成本。此外,本文还提出了一种快速的单次扫描算法,用于有效地评估STD中的所有shui,并给出了两个案例,其中该模型用于识别交通拥堵数据和空气污染数据中的有用信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信
小红书