发布求助
文献互助 智能选刊 最新文献

挖掘top-k强相关项对，不考虑最小相关阈值

IF 0.6 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
International Journal of Knowledge-Based and Intelligent Engineering Systems Pub Date : 2006-04-01 DOI:10.5555/1239607.1239609
HeZengyou, XuXiaofei, DengShengchun
{"title":"挖掘top-k强相关项对，不考虑最小相关阈值","authors":"HeZengyou, XuXiaofei, DengShengchun","doi":"10.5555/1239607.1239609","DOIUrl":null,"url":null,"abstract":"Given a user-specified minimum correlation threshold and a transaction database, the problem of mining strongly correlated item pairs is to find all item pairs with Pearson's correlation coefficien...","PeriodicalId":44076,"journal":{"name":"International Journal of Knowledge-Based and Intelligent Engineering Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2006-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Mining top-k strongly correlated item pairs without minimum correlation threshold\",\"authors\":\"HeZengyou, XuXiaofei, DengShengchun\",\"doi\":\"10.5555/1239607.1239609\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a user-specified minimum correlation threshold and a transaction database, the problem of mining strongly correlated item pairs is to find all item pairs with Pearson's correlation coefficien...\",\"PeriodicalId\":44076,\"journal\":{\"name\":\"International Journal of Knowledge-Based and Intelligent Engineering Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2006-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Knowledge-Based and Intelligent Engineering Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5555/1239607.1239609\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Knowledge-Based and Intelligent Engineering Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5555/1239607.1239609","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

给定用户指定的最小关联阈值和一个事务数据库，挖掘强相关项对的问题是找到具有Pearson相关系数的所有项对。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
Mining top-k strongly correlated item pairs without minimum correlation threshold
Given a user-specified minimum correlation threshold and a transaction database, the problem of mining strongly correlated item pairs is to find all item pairs with Pearson's correlation coefficien...
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Knowledge-Based and Intelligent Engineering Systems
International Journal of Knowledge-Based and Intelligent Engineering Systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
2.10
自引率
0.00%
发文量
22
×
引用
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学术官方微信