https://github.com/ankushkhanna/hadoop-apriori

Finding frequent pair using Apriori on Hadoop cascading.
https://github.com/ankushkhanna/hadoop-apriori

Last synced: 28 days ago
JSON representation

Finding frequent pair using Apriori on Hadoop cascading.

• Host: GitHub
• URL: https://github.com/ankushkhanna/hadoop-apriori
• Owner: AnkushKhanna
• Created: 2014-11-03T15:41:43.000Z (about 10 years ago)
• Default Branch: master
• Last Pushed: 2017-11-09T17:19:13.000Z (almost 7 years ago)
• Last Synced: 2024-03-19T04:31:23.588Z (8 months ago)
• Language: Java
• Size: 7.78 MB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
hadoop-apriori

==============

Finding frequent pair using Apriori on Hadoop cascading.

Original data of 1.5 GB was processed and broken down into important information such as:

Sessions    Products-visited("|" separated)

Apriori algorithm is runned on information above and create L1 and L2 files. 

Runned sequentially producing L1 and using L1 via DistributedCache to produce L2. All process run on hadoop.