IJPAM: Volume 83, No. 2 (2013)
Division of Mathematics and Sciences
Kentucky State University
Frankfort, KY, 40601, USA
Abstract. Given a set and a set of subsets of , subsets of covered by sets in are called -frequent. Frequent sets are of interest in large scale data analysis, pattern recognition and data mining. Characterization of maximal -frequent sets in terms of equivalence relation and partial order is given. A general algorithm for finding maximal -frequent sets, efficient for wide range of practical applications, is given.
Received: September 26, 2012
AMS Subject Classification: 03E04, 06A07
Key Words and Phrases: frequent set, association rules, similarity, pattern recognition, data mining
Download paper from here.
DOI: 10.12732/ijpam.v83i2.7 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395