关键词: 数据挖掘, 关联规则, 高置信度, 规则树

Abstract: In some fields of image association rules mining，it is necessary to mine some high confident association rules，which possibly require low support.A method is proposed to mine high confident association rule，while considering support threshold.In order to figure out the problem，the approach uses bSQ（bit Sequential） grid image data format，then rules tree is adopted to avoid the cost of producing large frequent itemsets.Finally，priority in mining association rules from multi-images and image data cube are used to efficiently mine pixel rank association rules from multi-images.The experiment shows the proposed approach could efficiently mine high confident association rules from image data，further validate its feasibility.

Key words: Data Mining, association rules, high confidence, rules tree