An Algorithm of Synchronous Mining Frequent Neighboring Class Set with Constraint Class Set

Cheng Sheng  Tu; Gang Fang

doi:10.4028/www.scientific.net/AMR.225-226.1109

Paper Titles

A Feasible Algorithm for Designing Biorthogonal Binary Finitely Supported Multiwavelet Functions
p.1092

A Novel Improved Edge Detection Method
p.1096

Harmony Search Algorithm and its Application to Product Module Identification
p.1100

An Improved Text Similarity Calculation Algorithm Based on VSM
p.1105

An Algorithm of Synchronous Mining Frequent Neighboring Class Set with Constraint Class Set
p.1109

Arithmetic Expression Evaluation in Membrane Computing with Priority
p.1115

Combines Speed Servocontrol Based on RBF
p.1120

Analysis of Regenerative Index of Depreciated Aluminum Products
p.1125

Inventory Management of Medical Equipment Vendors under the Uncertain Demand
p.1129

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 225-226An Algorithm of Synchronous Mining Frequent...

An Algorithm of Synchronous Mining Frequent Neighboring Class Set with Constraint Class Set

Abstract:

Due to these reasons that present frequent neighboring class set mining algorithms are unsuitable for extracting any length frequent neighboring class set with constraint class set, this paper proposes an algorithm of synchronous mining frequent neighboring class set with constraint class set, which is suitable for mining any length frequent neighboring class set with constraint class set in large spatial database. The algorithm creates mining database through digitization method, and then gains candidate frequent neighboring class set with constraint class set via synchronous search strategy, namely, it uses computing (k-1)-subset of k-non frequent neighboring class set with constraint class set to generate candidate frequent neighboring class set, meanwhile, it also uses connecting (l+1)-superset of l-frequent neighboring class sets to generate candidate frequent neighboring class set with constraint class set, it only need scan database once to extract frequent neighboring class set with constraint class set. The result of experiment indicates that the algorithm is faster and more efficient than present algorithms when mining any length frequent neighboring class set with constraint class set.