• Nenhum resultado encontrado

A pragmatic approach on association rule mining and its effective utilization in large databases

N/A
N/A
Protected

Academic year: 2017

Share "A pragmatic approach on association rule mining and its effective utilization in large databases"

Copied!
10
0
0

Texto

Loading

Referências

Documentos relacionados

Our research is a further step of the Tree Based Association Rule Mining (TBAR) algorithm, used in relational databases for finding the association rules .In

The work on association rules was extended from patterns [1,2,11] ,the authors explored data cube-based [2] rule mining algorithms on multidimensional databases, where

A false (ghost) rule is an association rule that was not among the rules mined from the original database. A solution that addresses all these three goals is called exact.

Association rule hiding is one of the techniques of privacy preserving data mining to protect the sensitive association rules generated by association rule mining.. This paper

The proposed algorithm was evaluated on three types of image data, and evaluation results shows superiority of the proposed algorithm over the original one, as well as over

In tradition approach association rule mining and probabilistic models are commonly used. Models like sequential modeling are effective in the recommendation [2]. Markov

All association rule mining algorithms like apriori algorithm and fp-growth algorithms are using mainly two steps in extracting the association rule. 1) Generation of

Thus the main aim of this research is to perform association rule from multiple heterogeneous data sources using multi agent system and then unifying the result to knowledge base