Paper Title:
An Algorithm of Constraint Frequent Neighboring Class Set Mining Based on Filling Class Set
  Abstract

Since the algorithms of constraint frequent neighboring class set mining based on Apriori is unsuitable for mining any length constraint frequent neighboring class set and has some redundancy computing, this paper proposes an algorithm of constraint frequent neighboring class set mining based on filling class set, which may efficiently extract any length constraint frequent neighboring class set from large spatial database. The algorithm uses binary conversion to turn neighboring class set into integer, and regards these integers as mining spatial database, and it uses double search strategy to generate constraint frequent neighboring class set, namely, one is that the algorithm uses two k-constraint frequent neighboring class sets to connect (k+1)-candidate constraint frequent neighboring class set, the other is that it also uses filling virtual class set of (k+1)-candidate constraint frequent neighboring class set to generate another candidate. In whole mining course the algorithm need only scan database once. The experimental result indicates that the algorithm is more efficient than the constraint frequent neighboring class set mining algorithm based on Apriori when mining any length constraint frequent neighboring class set.

  Info
Periodical
Edited by
Qi Luo
Pages
1676-1680
DOI
10.4028/www.scientific.net/AMM.58-60.1676
Citation
C. S. Tu, "An Algorithm of Constraint Frequent Neighboring Class Set Mining Based on Filling Class Set", Applied Mechanics and Materials, Vols. 58-60, pp. 1676-1680, 2011
Online since
June 2011
Authors
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Gang Fang, Hong Ying, Jiang Xiong, Yuan Bin Wu
Abstract:In this paper, the purpose is to find a method that can be more suited to facial expression change and also improve the recognition rate. The...
808
Authors: Cheng Sheng Tu, Gang Fang
Abstract:Due to these reasons that present frequent neighboring class set mining algorithms are unsuitable for extracting any length frequent...
1109
Authors: Gang Fang, Jiang Xiong, Xiao Bin Tang, Cheng Sheng Tu
Abstract:Since the algorithms of constraint frequent neighboring class set mining based on Apriori has some redundancy candidate constraint frequent...
1671
Authors: Cheng Sheng Tu
Abstract:As present constraint frequent neighboring class set mining algorithms have some redundancy candidate constraint frequent neighboring class...
494
Authors: Hui Wang
Chapter 5: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:We present a new algorithm for mining maximal frequent itemsets, MaxMining, from big transaction databases. MaxMining employs the depth-first...
1765