pdf

A fast algorithm for mining constrained maximum frequent patterns

  • 2013-09-22
  • 161.88KB
  • Points it Requires : 2

In order to avoid users having to obtain useful result sets through \"secondary mining\", this paper proposes a new constrained maximum frequent pattern mining algorithm CSMFP-Max. The CSMFP-Max algorithm is based on CFP trees and symmetric matrices. In the mining process, it adopts multiple pruning strategies and combines top-down and bottom-up bidirectional search strategies, which greatly reduces the size of the candidate set and avoids the generation of unnecessary conditional CFP trees. Theoretical analysis and experimental results show that the CSMFP-Max algorithm is an efficient constrained maximum frequent pattern mining algorithm with good time and space efficiency.

unfold

You Might Like

Uploader
rubyonrails
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×