Frequent Closed Itemsets Based Condensed Representations for Association Rules

Frequent Closed Itemsets Based Condensed Representations for Association Rules

Nicolas Pasquier
DOI: 10.4018/978-1-60566-404-0.ch013
(Individual Chapters)
No Current Special Offers


After more than one decade of researches on association rule mining, efficient and scalable techniques for the discovery of relevant association rules from large high-dimensional datasets are now available. Most initial studies have focused on the development of theoretical frameworks and efficient algorithms and data structures for association rule mining. However, many applications of association rules to data from different domains have shown that techniques for filtering irrelevant and useless association rules are required to simplify their interpretation by the end-user. Solutions proposed to address this problem can be classified in four main trends: constraint-based mining, interestingness measures, association rule structure analysis, and condensed representations. This chapter focuses on condensed representations that are characterized in the frequent closed itemset framework to expose their advantages and drawbacks.
Chapter Preview

Association Rule Mining

In order to improve the extraction efficiency, most algorithms for mining association rules operate on binary data represented in a transactional or binary format. This also enables the treatment of mixed data types, resulting from the integration of multiple data sources for example, with the same algorithm. The transactional and binary representations of the example dataset D, used as a support in the rest of the chapter, are shown in Table 1. In the transactional or enumeration format represented in Table 1(a) each object, called transaction or data line, contains a list of items. In the binary format represented in Table 1(b) each object2 is a bit vector and each bit indicates if the object contains the corresponding item or not.

Complete Chapter List

Search this Book: