基于布尔矩阵的最大频繁项集空间关联规则提取

Junming Chen, Guangfa Lin, Zhihai Yang
{"title":"基于布尔矩阵的最大频繁项集空间关联规则提取","authors":"Junming Chen, Guangfa Lin, Zhihai Yang","doi":"10.1109/GEOINFORMATICS.2011.5980870","DOIUrl":null,"url":null,"abstract":"Mining spatial association rules is one of the most important branches in the field of Spatial Data Mining (SDM). Because of the complexity of spatial data, a traditional method in extracting spatial association rules is to transform spatial database into general transaction database. The Apriori algorithm is one of the most commonly used methods in mining association rules at present. But a shortcoming of the algorithm is that its performance on the large database is inefficient. The present paper proposed a new algorithm by extracting maximum frequent itemsets based on a Boolean matrix. And a case study about extracting the spatial association rules between land cover and terrain factors was demonstrated to show the validation of the new algorithm. Finally, the conclusion was reached by the comparison between the Apriori algorithm and the new one which revealed that the new algorithm improves the efficiency of extracting spatial association rules.","PeriodicalId":413886,"journal":{"name":"2011 19th International Conference on Geoinformatics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Extracting spatial association rules from the maximum frequent itemsets based on Boolean matrix\",\"authors\":\"Junming Chen, Guangfa Lin, Zhihai Yang\",\"doi\":\"10.1109/GEOINFORMATICS.2011.5980870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mining spatial association rules is one of the most important branches in the field of Spatial Data Mining (SDM). Because of the complexity of spatial data, a traditional method in extracting spatial association rules is to transform spatial database into general transaction database. The Apriori algorithm is one of the most commonly used methods in mining association rules at present. But a shortcoming of the algorithm is that its performance on the large database is inefficient. The present paper proposed a new algorithm by extracting maximum frequent itemsets based on a Boolean matrix. And a case study about extracting the spatial association rules between land cover and terrain factors was demonstrated to show the validation of the new algorithm. Finally, the conclusion was reached by the comparison between the Apriori algorithm and the new one which revealed that the new algorithm improves the efficiency of extracting spatial association rules.\",\"PeriodicalId\":413886,\"journal\":{\"name\":\"2011 19th International Conference on Geoinformatics\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 19th International Conference on Geoinformatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GEOINFORMATICS.2011.5980870\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 19th International Conference on Geoinformatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GEOINFORMATICS.2011.5980870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

空间关联规则挖掘是空间数据挖掘领域的一个重要分支。由于空间数据的复杂性,传统的空间关联规则提取方法是将空间数据库转化为通用事务数据库。Apriori算法是目前最常用的关联规则挖掘方法之一。但该算法的缺点是在大型数据库上的性能低下。提出了一种基于布尔矩阵的最大频繁项集提取算法。最后以土地覆盖与地形因子的空间关联规则提取为例,验证了该算法的有效性。最后,通过与Apriori算法的比较得出结论,表明新算法提高了空间关联规则提取的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Extracting spatial association rules from the maximum frequent itemsets based on Boolean matrix
Mining spatial association rules is one of the most important branches in the field of Spatial Data Mining (SDM). Because of the complexity of spatial data, a traditional method in extracting spatial association rules is to transform spatial database into general transaction database. The Apriori algorithm is one of the most commonly used methods in mining association rules at present. But a shortcoming of the algorithm is that its performance on the large database is inefficient. The present paper proposed a new algorithm by extracting maximum frequent itemsets based on a Boolean matrix. And a case study about extracting the spatial association rules between land cover and terrain factors was demonstrated to show the validation of the new algorithm. Finally, the conclusion was reached by the comparison between the Apriori algorithm and the new one which revealed that the new algorithm improves the efficiency of extracting spatial association rules.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信