A Query-Driven Interesting Rule Discovery Using Associations and Spanning Operations
In practice, users may often want interesting rules that are also related with user goals . This paper describes a technique of mining useful rules both interesting and related to user goals. According to the degree of relevancy to a user goal, a database can be divided into the five views: from the view positively related to the user goal to the view unrelated. To each such view, our novel technique of data mining can be applied. The union and join operations in SQL, unlike the traditional approaches which apply association and prunning operations to one view, are applied to one or more of those views. While the pattern association operation joins patterns over the different attributes, the pattern spanning operation unions patterns over the same attributes. The combination of two operations keeps both confidence and supportiveness measures together, and differenciation of query views enables us to produce the desired level of interestingness and relevancy.
KeywordsData Mining Association Rule Point Pattern Pattern Association Union Operation
Unable to display preview. Download preview PDF.
- [AAB+96]R. Agrawal, A. Arning, T. Bollinger, M. Mehta, J. Shafer, and R. Srikant The Quest data mining system. In Proc. of Intl Conf. on Knowledge Discovery in Databases and Data Mining,Portland, Oregon, 1996.Google Scholar
- [AIS93]R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Sushil Jajodia, editor, Proc. of the ACM SIGMOD Conf. on Management of Data, pages 207-216, Washington D.C., 1993.Google Scholar
- [BMUT97]S. Brin, R Motwani, J. Ullman, and S. Tsur. Dynamic itemset counting and implication rules. In Peckman, editor, Proc. of the ACM SIGMOD Conf. on Management of Data, pages 255 - 264, Tucson, Arizona, 1997.Google Scholar
- [EKSX96]M. Ester, H-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noises. In Proc. of Int’l Conf. on Knowledge Discovery in Databases and Data Mining, 1996.Google Scholar
- [Fag90]R. Fagin. Finite model theory — a personal perspective. In S. Abiteboul and P. Kanellakis, editors, Proc. Int’l Conf on Database Theory, 1990.Google Scholar
- LSW97] B. Lent, A. Swami, and J. Widom. Clustering association rules. In Intl. Conf. on Data Engineering, 1997.Google Scholar
- [PT98]B. Padmanabhan and A. Tuzhilin. A belief-driven method for discovering unexpected patterns. In Proc. of Int’l Conf. on Knowledge Discovery in Databases and Data Mining, pages 94 - 100, 1998.Google Scholar
- [SA96]R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. of the ACM SIGMOD Conf. on Management of Data, 1996.Google Scholar
- [STA98]S. Sarawagi, S. Thomas, and R. Agrawal. Integrating association rule mining with relational database systems: Alternatives and implications. In Proc. of the ACM SIGMOD Conf. on Management of Data, 1998.Google Scholar
- [WTL98]K. Wang, S.H.W. Tay, and B. Liu. Interestingness-based interval merger for numeric association rules. In Data Mining and Knowledge Discovery, pages 121 - 127, 1998.Google Scholar