Skip to main content
Erschienen in: Data Mining and Knowledge Discovery 3/2005

01.11.2005 | Original Article

GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets

verfasst von: Karam Gouda, Mohammed J. Zaki

Erschienen in: Data Mining and Knowledge Discovery | Ausgabe 3/2005

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We present GenMax, a backtrack search based algorithm for mining maximal frequent itemsets. GenMax uses a number of optimizations to prune the search space. It uses a novel technique called progressive focusing to perform maximality checking, and diffset propagation to perform fast frequency computation. Systematic experimental comparison with previous work indicates that different methods have varying strengths and weaknesses based on dataset characteristics. We found GenMax to be a highly efficient method to mine the exact set of maximal patterns.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Agrawal, R., Aggarwal, C., and Prasad, V. 2000. Depth first generation of long patterns. In 7th Int'l Conference on Knowledge Discovery and Data Mining, pp. 108–118. Agrawal, R., Aggarwal, C., and Prasad, V. 2000. Depth first generation of long patterns. In 7th Int'l Conference on Knowledge Discovery and Data Mining, pp. 108–118.
Zurück zum Zitat Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, Fayyad, U. et al. (Eds.), Menlo Park, CA: AAAI Press, pp. 307–328. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, Fayyad, U. et al. (Eds.), Menlo Park, CA: AAAI Press, pp. 307–328.
Zurück zum Zitat Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In ACM SIGMOD Conf. on Management of Data, pp. 85–93. Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In ACM SIGMOD Conf. on Management of Data, pp. 85–93.
Zurück zum Zitat Burdick, D., Calimlim, M., and Gehrke, J. 2001. MAFIA: A maximal frequent itemset algorithm for transactional databases. In IEEE Intl. Conf. on Data Engineering, pp. 443–452. Burdick, D., Calimlim, M., and Gehrke, J. 2001. MAFIA: A maximal frequent itemset algorithm for transactional databases. In IEEE Intl. Conf. on Data Engineering, pp. 443–452.
Zurück zum Zitat Goethals, B., and Zaki, M. 2003. Advances in frequent itemset mining implementations: Report on FIMI'03. SIGKDD Explorations, 6(1):109–117.CrossRef Goethals, B., and Zaki, M. 2003. Advances in frequent itemset mining implementations: Report on FIMI'03. SIGKDD Explorations, 6(1):109–117.CrossRef
Zurück zum Zitat Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., and Sharma, R. 2003. Discovering all most specific sentences. ACM Transactions on Database Systems, 28(2):140–174.CrossRef Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., and Sharma, R. 2003. Discovering all most specific sentences. ACM Transactions on Database Systems, 28(2):140–174.CrossRef
Zurück zum Zitat Han, J., Pei, J., and Yin, Y. 2000. Mining frequent patterns without candidate generation. In ACM SIGMOD Conf. on Management of Data, pp. 1–12. Han, J., Pei, J., and Yin, Y. 2000. Mining frequent patterns without candidate generation. In ACM SIGMOD Conf. on Management of Data, pp. 1–12.
Zurück zum Zitat Lin, D.-L., and Kedem, Z.M. 1998. Pincer-search: A new algorithm for discovering the maximum frequent set. In 6th Intl. Conf. on Extending Database Technology, pp. 105–119. Lin, D.-L., and Kedem, Z.M. 1998. Pincer-search: A new algorithm for discovering the maximum frequent set. In 6th Intl. Conf. on Extending Database Technology, pp. 105–119.
Zurück zum Zitat Yellin, D. 1994. An algorithm for dynamic subset and intersection testing. Theoretical Computer Science, 129:397–406.CrossRefMathSciNet Yellin, D. 1994. An algorithm for dynamic subset and intersection testing. Theoretical Computer Science, 129:397–406.CrossRefMathSciNet
Zurück zum Zitat Zaki, M.J. 2000. Generating non-redundant association rules. In 6th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 34–43. Zaki, M.J. 2000. Generating non-redundant association rules. In 6th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 34–43.
Zurück zum Zitat Zaki, M.J., and Gouda, K. 2003. Fast vertical mining using Diffsets. In 9th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 326–335. Zaki, M.J., and Gouda, K. 2003. Fast vertical mining using Diffsets. In 9th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 326–335.
Zurück zum Zitat Zaki, M.J., and Hsiao, C.-J. 2002. CHARM: An efficient algorithm for closed itemset mining. In 2nd SIAM International Conference on Data Mining, pp. 457–473. Zaki, M.J., and Hsiao, C.-J. 2002. CHARM: An efficient algorithm for closed itemset mining. In 2nd SIAM International Conference on Data Mining, pp. 457–473.
Metadaten
Titel
GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets
verfasst von
Karam Gouda
Mohammed J. Zaki
Publikationsdatum
01.11.2005
Verlag
Springer US
Erschienen in
Data Mining and Knowledge Discovery / Ausgabe 3/2005
Print ISSN: 1384-5810
Elektronische ISSN: 1573-756X
DOI
https://doi.org/10.1007/s10618-005-0002-x

Weitere Artikel der Ausgabe 3/2005

Data Mining and Knowledge Discovery 3/2005 Zur Ausgabe

Premium Partner