{"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}
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.