Affiliation:
1. The University of Auckland, New Zealand
2. Auckland University of Technology, New Zealand
Abstract
Association rule mining discovers relationships among items in a transactional database. Most approaches assume that all items within a dataset have a uniform distribution with respect to support. However, this is not always the case, and weighted association rule mining (WARM) was introduced to provide importance to individual items. Previous approaches to the weighted association rule mining problem require users to assign weights to items. In certain cases, it is difficult to provide weights to all items within a dataset. In this paper, the authors propose a method that is based on a novel Valency model that automatically infers item weights based on interactions between items. The authors experiment shows that the weighting scheme results in rules that better capture the natural variation that occurs in a dataset when compared with a miner that does not employ a weighting scheme. The authors applied the model in a real world application to mine text from a given collection of documents. The use of item weighting enabled the authors to attach more importance to terms that are distinctive. The results demonstrate that keyword discrimination via item weighting leads to informative rules.
Reference42 articles.
1. Agrawal, R., Imielinski, T., & Swami, A. N. (1993). Mining association rules between sets of items in large databases. In P. Buneman & S. Jajodia (Eds.), Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (pp. 207-216). New York, NY: ACM.
2. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In J. B. Bocca, M. Jarke, & C. Zaniolo (Eds.), Proceedings of the 20th International Conference on Very Large Data Bases (pp. 487-499). San Francisco, CA: Morgan Kaufmann Publishers.
3. Antonie, M.-L., & Zaiane, O. R. (2002). Text document categorization by term association. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM ’02) (pp. 19-26). Washington, DC: IEEE Computer Society.
4. Ashrafi, M. Z., Taniar, D., & Smith, K. A. (2004). ODAM: An Optimized Distributed Association Rule Mining Algorithm. IEEE Distributed Systems Online, 5(3).
5. Redundant association rules reduction techniques
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献