IJPAM: Volume 83, No. 2 (2013)

ALGORITHM FOR FINDING MAXIMAL FREQUENT SETS

Eungchun Cho
Division of Mathematics and Sciences
Kentucky State University
Frankfort, KY, 40601, USA


Abstract. Given a set $X$ and a set $\mathcal{C} $ of subsets of $X$, subsets of $X$ covered by $k$ sets in $\mathcal{C} $ are called $k$-frequent. Frequent sets are of interest in large scale data analysis, pattern recognition and data mining. Characterization of maximal $k$-frequent sets in terms of equivalence relation and partial order is given. A general algorithm for finding maximal $k$-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
Year: 2013
Volume: 83
Issue: 2