Minimal k-free representations of frequent sets

T. Calders, B. Goethals

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    32 Citaten (Scopus)


    Due to the potentially immense amount of frequent sets that can be generated from transactional databases, recent studies have demonstrated the need for concise representations of all frequent sets. These studies resulted in several successful algorithms that only generate a lossless subset of the frequent sets. In this paper, we present a unifying framework encapsulating most known concise representations. Because of the deeper understanding of the different proposals thus obtained, we are able to provide new, provably more concise, representations. These theoretical results are supported by several experiments showing the practical applicability.
    Originele taal-2Engels
    TitelKnowledge Discovery in Databases : PKDD 2003 (Proceedings 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003)
    RedacteurenN. Lavrac, D. Gamberger, H. Blockeel, L. Todorovski
    Plaats van productieBerlin
    ISBN van geprinte versie3-540-20085-1
    StatusGepubliceerd - 2003

    Publicatie series

    NaamLecture Notes in Computer Science
    ISSN van geprinte versie0302-9743


    Duik in de onderzoeksthema's van 'Minimal k-free representations of frequent sets'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit