Class Eclat

  • All Implemented Interfaces:
    Algorithm

    @Reference(authors="M. J. Zaki, S. Parthasarathy, M. Ogihara, W. Li",
               title="New Algorithms for Fast Discovery of Association Rules",
               booktitle="Proc. 3rd ACM SIGKDD \'97 Int. Conf. on Knowledge Discovery and Data Mining",
               url="http://www.aaai.org/Library/KDD/1997/kdd97-060.php",
               bibkey="DBLP:conf/kdd/ZakiPOL97")
    public class Eclat
    extends AbstractFrequentItemsetAlgorithm
    Eclat is a depth-first discovery algorithm for mining frequent itemsets.

    Eclat discovers frequent itemsets by first transforming the data into a (sparse) column-oriented form, then performing a depth-first traversal of the prefix lattice, stopping traversal when the minimum support is no longer satisfied.

    This implementation is the basic algorithm only, and does not use diffsets. Columns are represented using a sparse representation, which theoretically is beneficial when the density is less than 1/31. This corresponds roughly to a minimum support of 3% for 1-itemsets. When searching for itemsets with a larger minimum support, it may be desirable to use a dense bitset representation instead and/or implement an automatic switching technique!

    Performance of this implementation is probably surpassed with a low-level C implementation based on SIMD bitset operations as long as support of an itemset is high, which are not easily accessible in Java.

    Reference:

    New Algorithms for Fast Discovery of Association Rules
    M. J. Zaki, S. Parthasarathy, M. Ogihara, W. Li
    Proc. 3rd ACM SIGKDD '97 Int. Conf. on Knowledge Discovery and Data Mining

    Since:
    0.7.0
    Author:
    Erich Schubert
    • Field Detail

      • LOG

        private static final Logging LOG
        Class logger.
      • STAT

        private static final java.lang.String STAT
        Prefix for statistics.
    • Constructor Detail

      • Eclat

        public Eclat​(double minsupp,
                     int minlength,
                     int maxlength)
        Constructor.
        Parameters:
        minsupp - Minimum support
        minlength - Minimum length
        maxlength - Maximum length
    • Method Detail

      • getInputTypeRestriction

        public TypeInformation[] getInputTypeRestriction()
        Description copied from interface: Algorithm
        Get the input type restriction used for negotiating the data query.
        Returns:
        Type restriction
      • extractItemsets

        private void extractItemsets​(DBIDs[] idx,
                                     int start,
                                     int minsupp,
                                     java.util.List<Itemset> solution)
      • extractItemsets

        private void extractItemsets​(DBIDs iset,
                                     DBIDs[] idx,
                                     int[] buf,
                                     int depth,
                                     int start,
                                     int minsupp,
                                     java.util.List<Itemset> solution)