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

Since the algorithms of constraint frequent neighboring class set mining based on Apriori has some redundancy candidate constraint frequent neighboring class set and some repeated computing, so its efficiency isn’t improved. Hence, this paper proposes an algorithm of constraint frequent neighboring class set mining based on interval mapping, which may efficiently extract short constraint frequent neighboring class set from large spatial database via up search. The algorithm uses binary weights to change neighboring class set into integer, which is looked on as a spatial transaction, and it uses interval mapping to generate constraint frequent neighboring class set via up search, i.e. the algorithm creates an interval to map a range of generating candidate, up search is mapping candidate from minimum to maximum of the interval. The method is different from traditional up search or down-up search. The experimental result indicates that the algorithm is more efficient than the constraint frequent neighboring class set mining algorithm based on Apriori when mining short constraint frequent neighboring class set.

  Info
Periodical
Edited by
Qi Luo
Pages
1671-1675
DOI
10.4028/www.scientific.net/AMM.58-60.1671
Citation
G. Fang, J. Xiong, X. B. Tang, C. S. Tu, "An Algorithm of Constraint Frequent Neighboring Class Set Mining Based on Interval Mapping", Applied Mechanics and Materials, Vols. 58-60, pp. 1671-1675, 2011
Online since
June 2011
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: 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: 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