Benutzer: Gast  Login
Titel:

Conquering the Search Space for the Calculation of the Maximal Frequent Set

Dokumenttyp:
Technical Report
Autor(en):
Clara Nippl; Angelika Reiser; Bernhard Mitschang
Abstract:
The most time consuming operation in data mining applications is the computation of frequent itemsets. Since the search space is exponential, efficient pruning is necessary. On the other hand, data mining on large data volumes makes the coupling of mining with database systems increasingly important. In this paper, we propose a new operator to efficiently calculate the support of candidate itemsets within the database engine. Based on this operator, we propose a novel approach to reduce search c...     »
Stichworte:
Data Mining; Frequent Itemset Generation; Search Space
Jahr:
2000
Jahr / Monat:
2000-09-01 00:00:00
Seiten/Umfang:
16
 BibTeX