Browse > Article

A Study on the Advanced Association Rules Algorithm of n-Items  

황현숙 (부경대학교 경영정보학과)
어윤양 (부경대학교 경영학부)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.27, no.4, 2002 , pp. 29-39 More about this Journal
Abstract
The transaction tables of the existing association algorithms have two column attributes : It is composed of transaction identifier (Transaction_id) and an item identifier (item). In this kind of structure, as the volume of data becomes larger, the performance for the SQL query statements came applicable decreases. Therefore, we propose advanced association rules algorithm of n-items which can transact multiple items (Transaction_id, Item 1, Item 2…, Item n). In this structure, performance hours can be contracted more than the single item structures, because count can be computed by query of the input transaction tables. Our experimental results indicate that performance of the n items structure is up to 2 times better than the single item. As a result of this paper, the proposed algorithm can be applied to internet shopping, searching engine and etc.
Keywords
Association Rules; Database Mining; SQL query statement; Basket Data Analysis; Support and Confidence;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Applying Data Mining Techniques to a Health insurance Information System /
[ Marisa, I.;S.Viveros;J.P. Nearhos;M.J. Rothman ] / Proceeding of the 22nd VLDB Conference
2 Mining Associtions between Sets of Items in Massive Databases /
[ Srikant, R.;T. Imielinski;A. Swami ] / Proceedings of ACM SIGMOD
3 Mining association rules between sets of itrms in large databases /
[ Agrawal, R.;T. Imielinski;A. Swami ] / Proceeding of ACM SIGMOD Conference in Management of Data
4 Mining Generalized Association rulesw and Sequential Patterns Using SQL Queries /
[ Thomas, S.;S. Sarawagi ] / Proceedings of the 4th Int'l Conference on Knowledge Discoveryj in Databases and Data Mining
5 Dynamic Itemset Counting and Implication rules for market basket data /
[ Brin, S.;R. Motwani, J.D. Ullman;S. Tsur ] / Proceeding of ACM SIGMOD Conference on Management of Data
6 An Extension to SQL for Mining Assocition Rules /
[ Meo, R.;G. Pasila;S. Ceri ] / Data Mining and Knowledge Discovery   DOI   ScienceOn
7 Beyond Market Baskets: Generalizing Association Rules to Drpendence Rules /
[ Craig, S.;B. Sergey;M. Rajeev ] / Data Mining and Knowledge Discovery   DOI   ScienceOn
8 Mining Quantitative Association Rules in Large Relational Tables /
[ Srikant, R.;R. Agrawal ] / Proceedings of ACM SIGMOD
9 Integrating Assocition Rule Mining with Relational Database Systems : Alternatives and Implications /
[ Sarawagi, S.;S. Thomas;R. Agrawal ] / Data Mining and Knowledge Discovery   DOI   ScienceOn
10 Set-oriented mining of association rules /
[ Houtsma, M;A. Swami ] / Proceedingd of 11th International Conference on Data Engineerig
11 Mining Business Databbases /
[ Ronals, J.B.;T. Khabaza ] / Communications of the ACM
12 Fast algorithms for Mining Association Rules /
[ Agrawal, R.;R. Srikant ] / Proceeding of the 20th VLDB Conference
13 /
[ Deker, K.M.;F. Sergio ] / Technical Overview : A Report on Data Mining
14 /
[ Berson, A;S. Smith ] / Data Warehousing, Data Mining and OLAP
15 /
[ Adriaans, P.;D. Zantiage ] / Data Mining