IJPAM: Volume 78, No. 2 (2012)


Eungchun Cho
Kentucky State University
Frankfort, KY, 40601, USA

Abstract. Given a collection $\mathcal{U}$ of subsets of a finite set $X$, subsets of $X$ that are covered by many sets in $\mathcal{U}$ are called frequent sets. Frequent sets are of interest in many applications, statistics, machine learning, pattern recognition and data mining. Characterizations of maximal frequent sets in terms of equivalence relation and partial ordering, and an algorithm of finding them are given.

Received: April 7, 2012

AMS Subject Classification: 06A06, 62D05, 03E75

Key Words and Phrases: frequent set, partial order, pattern recognition, data mining, machine learning

Download paper from here.

Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2012
Volume: 78
Issue: 2