An Algorithm of Constraint Frequent Neighboring Class Set Mining Based on Downward Search

Abstract:

Article Preview

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:

$35.00

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

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