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

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 225-226)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

1109-1112

DOI:

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

Citation:

C. S. Tu and G. Fang, "An Algorithm of Synchronous Mining Frequent Neighboring Class Set with Constraint Class Set", Advanced Materials Research, Vols. 225-226, pp. 1109-1112, 2011

Online since:

April 2011

Export:

Price:

$35.00

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

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