Documentation of 'ca.pfv.spmf.algorithms.sequential_rules.cmrules.AlgoAprioriTID_forCMRules' Java class
AlgoAprioriTID_forCMRules
ca.pfv.spmf.algorithms.sequential_rules.cmrules

Class AlgoAprioriTID_forCMRules



  • public class AlgoAprioriTID_forCMRules
    extends java.lang.Object
    This is an implementation of the AprioriTID algorithm that is modified to be used with the CMRules algorithm. AprioriTID was proposed in:

    Agrawal R, Srikant R. "Fast Algorithms for Mining Association Rules", VLDB. Sep 12-15 1994, Chile, 487-99,

    The Apriori algorithm finds all the frequents itemsets and their support in a binary context.
    • Constructor Detail

      • AlgoAprioriTID_forCMRules

        public AlgoAprioriTID_forCMRules(TransactionDatabase database,
                                         TriangularMatrix matrix)
        Constructor
        Parameters:
        database - the transaction database
        matrix - the triangular matrix
    • Method Detail

      • runAlgorithm

        public Itemsets runAlgorithm(int minsuppRelative,
                                     java.util.List<java.lang.Integer> listFrequentsSize1,
                                     java.util.Map<java.lang.Integer,java.util.Set<java.lang.Integer>> mapItemCount)
        Run the algorithm.
        Parameters:
        minsuppRelative - the minimum support threshold
        listFrequentsSize1 - the list of frequent itemsets of size 1
        mapItemCount - a map of items (key) and their tidset (value).
        Returns:
        the frequent itemsets
      • getItemsets

        public Itemsets getItemsets()
        Get the frequent itemsets.
        Returns:
        an object Itemsets containing the frequent itemsets.
      • setMaxItemsetSize

        public void setMaxItemsetSize(int maxItemsetSize)
        Set the maximum frequent itemset size to be discovered.
        Parameters:
        maxItemsetSize - the maximum size as a int.

DMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.