The week's pick
Reseach Article
Hiding Sensitive Association Rules on Stars
| Emerging Trends in Computer Science and Information Technology (ETCSIT2012) |
| Foundation of Computer Science USA |
| ETCSIT - Number 1 |
| April 2012 |
| Authors: R. D. Chintamani, I. F. Shaikh, A. D. Waghmare |
| 6fa78806-e78f-4073-83d7-01e5803a0bb3 |
R. D. Chintamani, I. F. Shaikh, A. D. Waghmare . Hiding Sensitive Association Rules on Stars. Emerging Trends in Computer Science and Information Technology (ETCSIT2012). ETCSIT, 1 (April 2012), 16-19.
Abstract
Current technology for association rules hiding mostly applies to data stored in a single transaction table. This work presents a novel algorithm for hiding sensitive association rules in data warehouses. A data warehouse is typically made up of multiple dimension tables and a fact table as in a star schema. Based on the strategies of reducing the confidence of sensitive association rule and without constructing the whole joined table, the proposed algorithm can effectively hide multi-relational association rules. Examples and analyses are given to demonstrate the efficacy of the approach.
References
- R. Agrawal, T. Imielinski and A. Swami, "Mining Association Rules between Sets of Items in Large Databases", Proceedings of ACM SIGMOD International Conference on Management of Data, 207– 216, 1993.
- R. Agrawal and R. Srikant. "Fast Algorithms for Mining Association Rules in Large Databases. ", Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, 487-499, 1994.
- E. Dasseni, V. Verykios, A. Elmagarmid and E. Bertino, "Hiding Association Rules by Using Confidence and Support" in Proceedings of 4th Information Hiding Workshop, 369-383, Pittsburgh, PA, 2001.
- L. Dehaspe and L. De Raedt. "Mining Association Rules in Multiple Relations", Proceedings of the 7th International Workshop on Inductive Logic Programming, 125–132. 1997.
- J. F. Guo, W. F. Bian, and J. Li, "Multi-relational Association Mining with Guidance of User", Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 704-709, 2007.
- V. C. Jensen, N. Soparkar, "Frequent Itemset Counting Across Multiple Tables", Proceedings of the 4th Pacific-Asia Conference of Knowledge Discovery and Data Mining, Current Issues and New Applications, 49?61, 2000.
- K. K. Ng, W. C. Fu, K. Wang, "Mining Association Rules from Stars", Proceedings of the 2002 IEEE International Conference on Data Mining, 322?329, 2002.
- S. Nijssen and J. Kok, "Faster Association Rules for Multiple Relations", Proceedings of the 17th International Joint Conference on Artificial Intelligence, 891?896, 2001.
- V. Verykios, A. Elmagarmid, E. Bertino, Y. Saygin, and E. Dasseni, "Association Rules Hiding", IEEE Transactions on Knowledge and Data Engineering, Vol. 16, No. 4, 434-447, April 2004.
- S. L. Wang, D. Patel, A. Jafari, and T. P. Hong, "Hiding Collaborative Recommendation Association Rule", Applied Intelligence, Volume 27, No. 1, 67-77, August 2007.
- S. L. Wang, T. Z. Lai, T. P. Hong, and Y. L. Wu, "Hiding Collaborative Recommendation Association Rules on Horizontally Partitioned Data", Intelligent Data Analysis, Vol. 14, No. 1, January 2010, 47 –67.
- L. J. Xu, K. L. Xie, "A Novel Algorithm for Frequent Itemset Mining in Data Warehouses", Journal of Zhejang University Science A, 7(2), 216-224, 2006.
Index Terms
Keywords