CBAR: an efficient method for mining association rules
β Scribed by Yuh-Jiuan Tsay; Jiunn-Yann Chiang
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 176 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0950-7051
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given a huge database, we address the problem of finding association rules for numeric attributes, such as (Balance # I ) O (CardLoan= yes), which implies that bank customers whose balances fall in a range I are likely to use card loan with a probability greater than p. The above rule is interesting
Due to the increasing use of very large databases and data warehouses, mining useful information and helpful knowledge from transactions is evolving into an important research area. Most conventional data-mining algorithms identify the relationships among transactions using binary values and ΓΏnd rul
AbstraΒ£t--Mining association rules from databases has attracted great interest because of its potentially very practical applications. Given a database, the problem of interest is how to mine association rules (which could describe patterns of consumers' behaviors) in an efficient and effective way.