|Title:||Mining frequent patterns in image databases with 9D-SPA representation||Authors:||Lee A.J.T.
|Keywords:||9D-SPA representation;Data mining;Spatial association rules;Spatial frequent patterns||Issue Date:||2009||Journal Volume:||82||Journal Issue:||4||Start page/Pages:||603-618||Source:||Journal of Systems and Software||Abstract:||
In this paper, we propose a novel algorithm, called 9DSPA-Miner, to mine frequent patterns from an image database, where every image is represented by the 9D-SPA representation. Our proposed method consists of three phases. First, we scan the database once and create an index structure. Next, the index structure is scanned to find all frequent patterns of length two. Finally, we use the frequent k-patterns (k ? 2) to generate candidate (k + 1)-patterns and check if the support of each candidate generated is not less than the user-specified minimum support threshold by using the index structure. Then, the steps in the third phase are repeated until no more frequent patterns can be found. Since the 9DSPA-Miner algorithm uses the characteristics of the 9D-SPA representation to prune most of impossible candidates, the experiment results demonstrate that it is more efficient and scalable than the modified Apriori method. ? 2008 Elsevier Inc. All rights reserved.
|Appears in Collections:||資訊管理學系|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.