Mining top-k strongly correlated item pairs without minimum correlation threshold

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

引用次数: 0

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...

查看原文本刊更多论文

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

给定用户指定的最小关联阈值和一个事务数据库，挖掘强相关项对的问题是找到具有Pearson相关系数的所有项对。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

International Journal of Knowledge-Based and Intelligent Engineering Systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-

CiteScore

2.10

自引率

0.00%

发文量