Research Efficient Mining Algorithm Top-K Strong Association Pair

摘要：

Propose a candidate set in the case does not produce only scan through a database to extract the top-k strongly correlated item pairs method. Structural information using a relational database, an appropriate estimate of the effective threshold, so that the results in at least one project K to effectively solve the relational database on the TopK strongly related to the problem of mining projects, and without paying too much computational cost.

关键词： Top-K Strongly Correlated Item Pair mining algorithm

作者: Zhang Lingxiao Liu Ping Yang Xinfeng

作者单位: Computer Science and Technology Department Nanyang Institute of Technology Nanyang, China

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

会议地点: 太原

会议语种:英文

页码: 34-37

在线出版日期: 2011-02-26（万方平台首次上网日期，不代表论文的发表时间）