| dc.identifier.citation | [1]. Wang, E.T and Lee Guanling. An efficient sanitization algorithm for balancing information privacy and knowledge discovery in association patterns mining. Data & Knowledge Engineering. pp. 463–484, 2008. [2]. Aris Gkoulalas-Divanis., Vassilios S. Verykios.Association Rule Hiding for Data Mining. Springer, 2010. [3]. R. Agrawal and R. Srikant. Privacy preserving data mining. SIGMOD Record, pp. 439–450, 2000. [4]. Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, pp. 36–54, 2000. [5]. M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, and V. S. Verykios. Disclosure limitation of sensitive rules. In Proceedings of the 1999 IEEE Knowledge and Data EngineeringExchange Workshop (KDEX). pp. 45–52, 1999. [6]. Agrawal, R., Srikant, R. Fast Algorithms for Mining Association Rules in Large Databases. In Proceedings of the 20 th International Conference on Very Large Data Bases, pp. 487-499, 1994. [7]. Han, J., Pei, J., Yin, Y. Mining Frequent Patterns without Candidate Generation. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, , pp. 1-12, 2000. [8]. Alaa Kh. Juma’a, Sufyan T. F Al-janabi, Nazar A. Ali. Hiding sensitive frequent itemsets over privacy preserving distributed data. raf. j. of comp & math’s., vol. 10, no. 1, pp. 91-101, 2013. [9]. Al-Khafaji, K, H. and Al-saidi A. N. A new algorithm to preserve sensitive frequent itemsets in horizontal and vertical database. eng&tech. journal vol.31, part (B). No.6. , pp. 755-769, 2013 [10]. Lin, C. W et al. A greedy-based approach for hiding sensitive itemsets by transaction insertion. Journal of Information hiding and multimedia signal processing. Vol 4, Number 4, pp. 201-214, 2013. [11]. Lin Jun-lin., Cheng yung-wei. Privacy preserving itemset mining through noisy items. Expert system with Applications. pp. 5711-5717, 2008. [12]. Fayyad, Usama et al. From Data Mining to Knowledge Discovery in Database. American Association for Artificial Intelligence. , pp. 37-54, 1996. [13]. Hughes, Dominic and Shmatikov, Vitaly. Information Hiding, Anonymity and Privacy: A Modular Approach. Journal of computer security. pp. 3 – 36. 2004. [14]. Sun X, Yu PS. A border-based approach for hidingsensitivefrequent itemsets. In: Proceedings of IEEEInternational Conference on Data Mining. Houston,TX; pp. 426–433, 2005. [15]. Sun X, Yu PS. Hiding sensitive frequent itemsets by aborder-based approach.Comput Sci Eng, vol.1, 74– 94, 2007. [16]. Moustakidesa GV, Verykios VS. A Maxmin approach for hiding frequent itemsets. Data Knowledge Engineering, Vol. 65, 75–89, 2008. [17]. S.R.M. Oliveira, O.R. Zaıane. Privacy preserving frequent itemset mining, in: Proceedings of the IEEE ICDM Workshop on Privacy,Security, and Data Mining, Maebashi City, Japan, pp. 43–54, 2002. [18]. Gunawan Dedi and Lee Guanling. Heuristic Approach on Protecting Frequent Sensitive Itemset in Parallel Computing Environment. Proceeding of International Conference on Pure and Applied Research. Malang, Indonesia. 2015 [19]. IBM Synthetics data generator. http://synthdatagen.codeplex.com/wikipage?title=Generating%20Transactions&referringTitle=Using%20SyntheticDataGenerator. | in_ID |
