项集格的有效遍历:文献综述

L. Troiano, Giacomo Scibelli
{"title":"项集格的有效遍历:文献综述","authors":"L. Troiano, Giacomo Scibelli","doi":"10.1109/ISDA.2013.6920703","DOIUrl":null,"url":null,"abstract":"The mining of itemsets passes thorugh an efficient traversal of lattice traversal. In this paper we point out some findings regarding the exploration of lattice itemsets which should drive the design of efficient data mining algorithms. This paper attempts to outline some findings for an efficient traversal of the itemset inclusion lattice, by looking at different problems investigated in literature, and to draw directions for the implementation of efficient search algorithms.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the efficient traversal of the itemset lattice: A literature review\",\"authors\":\"L. Troiano, Giacomo Scibelli\",\"doi\":\"10.1109/ISDA.2013.6920703\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The mining of itemsets passes thorugh an efficient traversal of lattice traversal. In this paper we point out some findings regarding the exploration of lattice itemsets which should drive the design of efficient data mining algorithms. This paper attempts to outline some findings for an efficient traversal of the itemset inclusion lattice, by looking at different problems investigated in literature, and to draw directions for the implementation of efficient search algorithms.\",\"PeriodicalId\":135313,\"journal\":{\"name\":\"2013 13th International Conference on Intellient Systems Design and Applications\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 13th International Conference on Intellient Systems Design and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISDA.2013.6920703\",\"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 13th International Conference on Intellient Systems Design and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISDA.2013.6920703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

项目集的挖掘通过一个有效的遍历晶格遍历。在本文中,我们指出了一些关于探索格项集的发现,这些发现将推动高效数据挖掘算法的设计。本文试图通过查看文献中研究的不同问题,概述项目集包含格的有效遍历的一些发现,并为有效搜索算法的实现绘制方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the efficient traversal of the itemset lattice: A literature review
The mining of itemsets passes thorugh an efficient traversal of lattice traversal. In this paper we point out some findings regarding the exploration of lattice itemsets which should drive the design of efficient data mining algorithms. This paper attempts to outline some findings for an efficient traversal of the itemset inclusion lattice, by looking at different problems investigated in literature, and to draw directions for the implementation of efficient search algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信