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

As present constraint frequent neighboring class set mining algorithms have some redundancy candidate constraint frequent neighboring class set and some repeated computing. And so this paper proposes an algorithm of constraint frequent neighboring class set mining based on downward search, which is suitable for mining long constraint frequent neighboring class set from large spatial database via downward search. The algorithm adopts binary arrangement to turn spatial instance into integer, which is regarded as a spatial transaction, and it uses candidate domain mapping to create constraint frequent neighboring class set via downward search, namely, the algorithm creates candidate domain and uses an integer in the domain to map a candidate, downward search is that this integer of mapping candidate is from maximum to minimum. The method is different from traditional down search or top-down search. The experimental result indicates that the algorithm is more efficient than present constraint frequent neighboring class set mining algorithm when mining long constraint frequent neighboring class set.

  Info
Periodical
Edited by
Honghua Tan
Pages
494-497
DOI
10.4028/www.scientific.net/AMM.66-68.494
Citation
C. S. Tu, "An Algorithm of Constraint Frequent Neighboring Class Set Mining Based on Downward Search", Applied Mechanics and Materials, Vols. 66-68, pp. 494-497, 2011
Online since
July 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:Since the algorithms of constraint frequent neighboring class set mining based on Apriori is unsuitable for mining any length constraint...
1676
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