UNPKG

frequent-itemset

Version:

Use Apriori algorithm to calculate frequent itemset from a list of arrarys

45 lines (44 loc) 1.01 kB
{ "name": "frequent-itemset", "version": "1.0.5", "description": "Use Apriori algorithm to calculate frequent itemset from a list of arrarys", "main": "index.js", "scripts": { "pretest": "eslint . --fix", "test": "mocha -b --timeout 2000 --reporter spec test/*.test.js" }, "keywords": [ "frequent", "itemset", "frequentitemset", "Apriori", "algorithm", "arrarys" ], "author": "CCharlieLi", "license": "MIT", "engines": { "npm": ">=3.8.0", "node": ">=6.3.1" }, "dependencies": { "generatorics": "^1.1.0", "lodash": "^4.17.4" }, "devDependencies": { "chai": "^3.5.0", "eslint": "^3.18.0", "mocha": "^3.2.0" }, "directories": { "test": "test" }, "repository": { "type": "git", "url": "git+https://github.com/CCharlieLi/frequent-itemset.git" }, "bugs": { "url": "https://github.com/CCharlieLi/frequent-itemset/issues" }, "homepage": "https://github.com/CCharlieLi/frequent-itemset#readme" }