mahout-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "chao deng (JIRA)" <>
Subject [jira] Commented: (MAHOUT-108) Implementation of Assoication Rules learning by Apriori algorithm
Date Mon, 08 Jun 2009 05:46:07 GMT


chao deng commented on MAHOUT-108:

hi, everyone. The source code for apriori algorithm has finished, but how
can i submit it via svn? can anyone help me?

2009/3/5 chao deng (JIRA) <>

Name: chao deng
Career: Ph.D candidate on Computer Science
School: Harbin Institue of Technology (HIT)
Department: Computer Science & Technolgy School
Office: Machine Learning Group in Nature Compuation Lab
Post zip: 150001
Post Address: 319# Harbin Institute of Technology(HIT), P.R. China

> Implementation of Assoication Rules learning by Apriori algorithm
> -----------------------------------------------------------------
>                 Key: MAHOUT-108
>                 URL:
>             Project: Mahout
>          Issue Type: Task
>         Environment: Linux, Hadoop-0.17.1
>            Reporter: chao deng
>             Fix For: 0.2
>   Original Estimate: 504h
>  Remaining Estimate: 504h
> Target: Association Rules learning is a popular method for discovering interesting relations
between variables in large databases. Here, we would implement the Apriori algorithm using
Hadoop&Mapreduce parallel techniques.
> Applications: Typically, association rules  learning is used to discover regularities
between products in large scale transaction data in supermarkets. For example, the rule  "{onions,
patatoes}->beef" found in the sales data would indicate that if a customer buys onions
and potatoes together, he or she is likely to also buy beef. Such information can be used
as the basis for decisions about marketing activities. In addition to the market basket analysis,
association rules are employed today in many application areas including Web usage mining,
intrusion detection and bioinformatics.
> Apriori algorithm: Apriori is the best-known algorithm to mine association rules. It
uses a breadth-first search strategy to counting the support of itemsets and uses a candidate
generation function which exploits the downward closure property of support

This message is automatically generated by JIRA.
You can reply to this email to add a comment to the issue online.

View raw message