Building the data warehouse of frequent itemsets in the DWFIST approach

  • Authors:
  • Rodrigo Salvador Monteiro;Geraldo Zimbrão;Holger Schwarz;Bernhard Mitschang;Jano Moreira de Souza

  • Affiliations:
  • Computer Science Department, Graduate School of Engineering, Federal University, of Rio de Janeiro, Rio de Janeiro, Brazil;Computer Science Department, Graduate School of Engineering, Federal University, of Rio de Janeiro, Rio de Janeiro, Brazil;Institute f. Parallel & Distributed Systems, University of Stuttgart, Stuttgart;Institute f. Parallel & Distributed Systems, University of Stuttgart, Stuttgart;Computer Science Department, Graduate School of Engineering, Federal University, of Rio de Janeiro, Rio de Janeiro, Brazil

  • Venue:
  • ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Some data mining tasks can produce such great amounts of data that we have to cope with a new knowledge management problem. Frequent itemset mining fits in this category. Different approaches were proposed to handle or avoid somehow this problem. All of them have problems and limitations. In particular, most of them need the original data during the analysis phase, which is not feasible for data streams. The DWFIST (Data Warehouse of Frequent ItemSets Tactics) approach aims at providing a powerful environment for the analysis of itemsets and derived patterns, such as association rules, without accessing the original data during the analysis phase. This approach is based on a Data Warehouse of Frequent Itemsets. It provides frequent itemsets in a flexible and efficient way as well as a standardized logical view upon which analytical tools can be developed. This paper presents how such a data warehouse can be built.