association rules (in data mining)

Association rules are if/then statements that help uncover relationships between seemingly unrelated data in a relational database or other information repository. An example of an association rule would be "If a customer buys a dozen eggs, he is 80% likely to also purchase milk."

An association rule has two parts, an antecedent (if) and a consequent (then). An antecedent is an item found in the data. A consequent is an item that is found in combination with the antecedent.

Association rules are created by analyzing data for frequent if/then patterns and using the criteria support and confidence to identify the most important relationships. Support is an indication of how frequently the items appear in the database. Confidence indicates the number of times the if/then statements have been found to be true.

In data mining, association rules are useful for analyzing and predicting customer behavior. They play an important part in shopping basket data analysis, product clustering, catalog design and store layout.

Programmers use association rules to build programs capable of machine learning.  Machine learning is a type of artificial intelligence (AI) that seeks to build programs with the ability to become more efficient without being explicitly programmed. 


See also: decision tree software, data analytics, data dredging, ad-hoc analysis

This was last updated in February 2011

Continue Reading About association rules (in data mining)

Dig Deeper on Predictive analytics

Join the conversation

1 comment

Send me notifications when other members comment.

Please create a username to comment.

since apriori algorithm needs association rules to be generated once the frequent itemset is found and apriori algorithm helps in data mining, i need to ask or you can say know that whether i can use apriori algorithm in C language to generate a program. Would it be of any use if we use it in C language programing. 


File Extensions and File Formats

Powered by: