Documentation of 'ca.pfv.spmf.algorithms.frequentpatterns.charm.AlgoDCharm_Bitset' Java class
AlgoDCharm_Bitset
ca.pfv.spmf.algorithms.frequentpatterns.charm

Class AlgoDCharm_Bitset



  • public class AlgoDCharm_Bitset
    extends AlgoCharm_Bitset
    This is an implementation of the dCharm algorithm. The difference between DECLAT and CHARM is that dCharm utilizes diffsets instead of tidsets. In this implementation, diffsets are represented as bitsets. Note that this class is a subclass of the Charm algorithm because a lot of code is the same and we wanted to avoid redundancy. IMPORTANT: dCharm returns Itemsets annotated with their diffsets rather than tidsets when the user choose to keep the result in memory. dCharm was proposed by ZAKI (2000).

    See this article for details about dCharm:

    Mohammed Javeed Zaki, Ching-Jiu Hsiao: CHARM: An Efficient Algorithm for Closed Itemset Mining. SDM 2002. *

    and diffsets have been proposed in:

    M. J. Zaki and K. Gouda. Fast vertical mining using Diffsets. Technical Report 01-1, Computer Science Dept., Rensselaer Polytechnic Institute, March 2001. This version saves the result to a file or keep it into memory if no output path is provided by the user to the runAlgorithm method().
    See Also:
    TriangularMatrix, TransactionDatabase, Itemset, Itemsets
    • Constructor Detail

      • AlgoDCharm_Bitset

        public AlgoDCharm_Bitset()
    • Method Detail

      • printStats

        public void printStats()
        Print statistics about the algorithm execution to System.out.
        Overrides:
        printStats in class AlgoCharm_Bitset

DMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.