sunithavanamala

// INTRODUCTION

/**
 * A BitVector is a fixed-length sequence of bits. It's an extremely
 * powerful class because of the huge number of ways that it allows the
 * bits to be accessed and modified. Algorithms that rely heavily on bit
 * manipulation can improve their performance by reducing the frequency
 * with which bit data needs to be moved between different data
 * structures; they can rely on BitVector for all the bit manipulations
 * they require.

sunithavanamala

// INTRODUCTION

/**
 * A BitVector is a fixed-length sequence of bits. It's an extremely
 * powerful class because of the huge number of ways that it allows the
 * bits to be accessed and modified. Algorithms that rely heavily on bit
 * manipulation can improve their performance by reducing the frequency
 * with which bit data needs to be moved between different data
 * structures; they can rely on BitVector for all the bit manipulations
 * they require.

sunithavanamala

import java.io.*;
import java.util.*;

/** The class encapsulates an implementation of the Apriori algorithm
 * to compute frequent itemsets.
 * 
 * Datasets contains integers (>=0) separated by spaces, one transaction by line, e.g.
 * 1 2 3
 * 0 9
 * 1 9