Skip to content
Python Implementation of Apriori Algorithm for finding Frequent sets and Association Rules
Branch: master
Clone or download
Latest commit 804020f Jan 5, 2017
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.gitignore Ignore *.swp and *.pyc Jul 6, 2016
.travis.yml Use requirements.txt to keep track Python package list Jul 6, 2016
INTEGRATED-DATASET.csv First Commit Dec 5, 2011
README.md
apriori.py Print itemsets sorted by support and confidence rules by confidence Jul 1, 2015
mit-license Adding MIT-License Aug 7, 2013
requirements.txt Use requirements.txt to keep track Python package list Jul 6, 2016
tesco.csv Add small dataset about buying transaction Jul 6, 2016
test_apriori.py Test running Apriori to get items and rules as result Jul 6, 2016

README.md

Python Implementation of Apriori Algorithm

Build Status

The code attempts to implement the following paper:

Agrawal, Rakesh, and Ramakrishnan Srikant. "Fast algorithms for mining association rules." Proc. 20th int. conf. very large data bases, VLDB. Vol. 1215. 1994.

List of files

  1. apriori.py
  2. INTEGRATED-DATASET.csv
  3. README(this file)

The dataset is a copy of the “Online directory of certified businesses with a detailed profile” file from the Small Business Services (SBS) dataset in the NYC Open Data Sets <http://nycopendata.socrata.com/>_

Usage

To run the program with dataset provided and default values for minSupport = 0.15 and minConfidence = 0.6

python apriori.py -f INTEGRATED-DATASET.csv

To run program with dataset

python apriori.py -f INTEGRATED-DATASET.csv -s 0.17 -c 0.68

Best results are obtained for the following values of support and confidence:

Support : Between 0.1 and 0.2

Confidence : Between 0.5 and 0.7

License

MIT-License


You can’t perform that action at this time.