An Associative Memory for Association Rule Mining

Vicente Oswaldo Baez Monroy, Simon E. M. O'Keefe
{"title":"An Associative Memory for Association Rule Mining","authors":"Vicente Oswaldo Baez Monroy, Simon E. M. O'Keefe","doi":"10.1109/IJCNN.2007.4371304","DOIUrl":null,"url":null,"abstract":"Association rule mining is a thoroughly studied problem in data mining. Its solution has been aimed for by approaches based on different strategies involving, for instance, the use of novel data structures to represent the knowledge discovered, the transformation of the input data to speed up the process, the exploitation of the itemset properties either to traverse the possible itemset search space optimally or to form compact representation of the frequent itemsets employed for the generation of the corresponding final rules, and others. Surprisingly, biologically-inspired approaches have rarely been proposed. In this work, we focus on investigating if a type of mapping neural network, better known as an associative memory, is suitable for association rule mining. In particular, our aim is to determine if itemset support can be estimated from the knowledge embedded in the weight matrix of a trained associative memory in order to generate further association rules from such a knowledge.","PeriodicalId":350091,"journal":{"name":"2007 International Joint Conference on Neural Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Joint Conference on Neural Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.2007.4371304","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Association rule mining is a thoroughly studied problem in data mining. Its solution has been aimed for by approaches based on different strategies involving, for instance, the use of novel data structures to represent the knowledge discovered, the transformation of the input data to speed up the process, the exploitation of the itemset properties either to traverse the possible itemset search space optimally or to form compact representation of the frequent itemsets employed for the generation of the corresponding final rules, and others. Surprisingly, biologically-inspired approaches have rarely been proposed. In this work, we focus on investigating if a type of mapping neural network, better known as an associative memory, is suitable for association rule mining. In particular, our aim is to determine if itemset support can be estimated from the knowledge embedded in the weight matrix of a trained associative memory in order to generate further association rules from such a knowledge.
一种用于关联规则挖掘的关联内存
关联规则挖掘是数据挖掘中一个被深入研究的问题。它的解决方案是通过基于不同策略的方法来实现的,例如,使用新的数据结构来表示发现的知识,转换输入数据以加快过程,利用项目集属性来优化遍历可能的项目集搜索空间或形成用于生成相应最终规则的频繁项目集的紧凑表示,等等。令人惊讶的是,很少有人提出生物学启发的方法。在这项工作中,我们的重点是研究一种映射神经网络,更广为人知的是联想记忆,是否适合于关联规则挖掘。特别是,我们的目标是确定是否可以从训练的联想记忆的权重矩阵中嵌入的知识中估计项集支持度,以便从这样的知识中生成进一步的关联规则。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信