在发布数据库中挖掘分层时态关联规则

Guo-Cheng Lan, T. Hong, Pei-Shan Wu, S. Tsumoto
{"title":"在发布数据库中挖掘分层时态关联规则","authors":"Guo-Cheng Lan, T. Hong, Pei-Shan Wu, S. Tsumoto","doi":"10.1109/ICCI-CC.2013.6622291","DOIUrl":null,"url":null,"abstract":"Different from the existing studies, this work presents a new kind of rules with the concept of a hierarchy of time granules, namely hierarchical temporal association rules. The lifespan of an item in a time granule is calculated from the publication time of the item to the end time in the time granule. A three-phase mining framework is proposed to effectively and efficiently find this kind of rules from a temporal database. The experimental results show the performance of the proposed algorithm under the item lifespan definition.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Mining hierarchical temporal association rules in a publication database\",\"authors\":\"Guo-Cheng Lan, T. Hong, Pei-Shan Wu, S. Tsumoto\",\"doi\":\"10.1109/ICCI-CC.2013.6622291\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Different from the existing studies, this work presents a new kind of rules with the concept of a hierarchy of time granules, namely hierarchical temporal association rules. The lifespan of an item in a time granule is calculated from the publication time of the item to the end time in the time granule. A three-phase mining framework is proposed to effectively and efficiently find this kind of rules from a temporal database. The experimental results show the performance of the proposed algorithm under the item lifespan definition.\",\"PeriodicalId\":130244,\"journal\":{\"name\":\"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCI-CC.2013.6622291\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCI-CC.2013.6622291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

与已有研究不同的是,本文提出了一种新的时间粒层次概念的规则,即层次时间关联规则。时间颗粒中项目的生命周期是从项目的发布时间到时间颗粒中的结束时间计算的。提出了一种三阶段挖掘框架,从时态数据库中高效地发现这类规则。实验结果表明了该算法在项目寿命定义下的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mining hierarchical temporal association rules in a publication database
Different from the existing studies, this work presents a new kind of rules with the concept of a hierarchy of time granules, namely hierarchical temporal association rules. The lifespan of an item in a time granule is calculated from the publication time of the item to the end time in the time granule. A three-phase mining framework is proposed to effectively and efficiently find this kind of rules from a temporal database. The experimental results show the performance of the proposed algorithm under the item lifespan definition.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信