{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:14:07Z","timestamp":1781104447851,"version":"3.54.1"},"reference-count":29,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,10,1]]},"abstract":"<p>Distributed association rule mining is an integral part of data mining that extracts useful information hidden in distributed data sources. As local frequent itemsets are globalized from data sources, sensitive information about individual data sources needs high protection. Different privacy preserving data mining approaches for distributed environment have been proposed but in the existing approaches, collusion among the participating sites reveal sensitive information about the other sites. In this paper, the authors propose a collusion-free algorithm for mining global frequent itemsets in a distributed environment with minimal communication among sites. This algorithm uses the techniques of splitting and sanitizing the itemsets and communicates to random sites in two different phases, thus making it difficult for the colluders to retrieve sensitive information. Results show that the consequence of collusion is reduced to a greater extent without affecting mining performance and confirms optimal communication among sites.<\/p>","DOI":"10.4018\/jiit.2010100103","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T15:15:21Z","timestamp":1297782921000},"page":"30-45","source":"Crossref","is-referenced-by-count":8,"title":["Collusion-Free Privacy Preserving Data Mining"],"prefix":"10.4018","volume":"6","author":[{"given":"M.","family":"Rajalakshmi","sequence":"first","affiliation":[{"name":"Coimbatore Institute of Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T.","family":"Purusothaman","sequence":"additional","affiliation":[{"name":"Government College of Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Pratheeba","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jiit.2010100103-0","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast Algorithms for Mining Association Rules. In Proceedings of the 20th VLDB Conference, Santiago, Chile (pp. 487-499)."},{"key":"jiit.2010100103-1","doi-asserted-by":"crossref","unstructured":"Ashrafi, M., Taniar, D., & Smith, K. (2004). ODAM: An Optimized Distributed Association Rule Mining Algorithm. IEEE Distributed Systems Online, 5(3).","DOI":"10.1109\/MDSO.2004.1285877"},{"issue":"1","key":"jiit.2010100103-2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.4018\/jiit.2005010104","article-title":"Privacy-Preserving Distributed Association Rule Mining Algorithm.","volume":"1","author":"M.Ashrafi","year":"2005","journal-title":"International Journal of Intelligent Information Technologies"},{"key":"jiit.2010100103-3","unstructured":"Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., & Verykios, V. S. (1999). Disclosure limitation of sensitive rules. In Proceedings of the IEEE Knowledge and Data Exchange Workshop (KDEX'99), (pp. 45-52). Washington, DC: IEEE Computer Society."},{"key":"jiit.2010100103-4","doi-asserted-by":"publisher","DOI":"10.1109\/69.553158"},{"key":"jiit.2010100103-5","unstructured":"Clifton, C. (2001). Secure Multiparty Computation Problems and Their Applications: A Review and Open Problems. In Proceedings of the Workshop on New Security Paradigms, Cloudcroft, NM."},{"key":"jiit.2010100103-6","unstructured":"Clifton, C., Kantarcioglu, M., & Vaidya, J. (2004). Defining privacy for data mining. In Data Mining, Next generation challenges and future directions."},{"key":"jiit.2010100103-7","unstructured":"Clifton, C., & Marks, D. (1996). Security and Privacy Implications of Data Mining. In Proceedings of the ACM SIGMOD Workshop on Data Mining and Knowledge Discovery (pp. 15-19)."},{"key":"jiit.2010100103-8","author":"O.Goldreich","year":"1998","journal-title":"Secure Multiparty Computation"},{"key":"jiit.2010100103-9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., & Wigderson. (1987). How to play any mental game - a completeness theorem for protocols with honest majority. In Proceedings of the 19th ACM Symposium on the Theory of Computing (pp. 218-229).","DOI":"10.1145\/28395.28420"},{"key":"jiit.2010100103-10","unstructured":"Han, J., & Kamber, M. (2001). Data Mining: Concepts and Technique. San Fracisco: Morgan Kaufmann Publishers."},{"key":"jiit.2010100103-11","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"jiit.2010100103-12","doi-asserted-by":"crossref","unstructured":"Inan, A., Saygyn, Y., Savas, E., Hintoglu, A. A., & Levi, A. (2006). Privacy preserving clustering on horizontally portioned data. In Proceedings of the 22nd International Conference on Data Engineering Workshops (ICDEW'06).","DOI":"10.1109\/ICDEW.2006.115"},{"key":"jiit.2010100103-13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"jiit.2010100103-14","unstructured":"Lee, G., Chang, C., & Chen, A. L. P. (2004). Hiding sensitive patterns in association rules mining. In Proceedings of the 28th Annual International Computer Software and Applications Conference."},{"key":"jiit.2010100103-15","doi-asserted-by":"crossref","unstructured":"Lin, D., & Kedem, Z. M. (1998). Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set. In Proceedings of the 6th International Conference on Extending Database Technology (EDBT), Valencia, Spain (pp. 105-119).","DOI":"10.1007\/BFb0100980"},{"key":"jiit.2010100103-16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1000342"},{"key":"jiit.2010100103-17","doi-asserted-by":"crossref","unstructured":"Lindell, Y., & Pinkas, B. (2009). Secure Multiparty Computation for Privacy-Preserving Data Mining. Journal of Privacy and Confidentiality, 59-98.","DOI":"10.29012\/jpc.v1i1.566"},{"key":"jiit.2010100103-18","unstructured":"Luo, W. (2006). An Algorithm for Privacy-preserving Quantitative Association Rules Mining. In Proceedings of the 2nd IEEE International Symposium."},{"issue":"1","key":"jiit.2010100103-19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.4018\/jiit.2006010104","article-title":"Rapid Privacy Preserving Algorithm for Large Databases.","volume":"2","author":"R.Nedunchezhian","year":"2006","journal-title":"International Journal of Intelligent Information Technologies"},{"key":"jiit.2010100103-20","unstructured":"Saygin, Y., Verykios, S., & Elmagarmid, K. (2002). Privacy Preserving Association Rule Mining. In Proceedings of the 12th International Workshop on Research Issues in Data Engineering: Engineering E-Commerce\/E-Business Systems (RIDE'02), San Jose, CA (pp. 151-158)."},{"key":"jiit.2010100103-21","unstructured":"Stanley, R., Oliveira, M., & Za\u201d\u0131ane, R. (2003). Algorithms for Balancing Privacy and Knowledge Discovery in Association Rule Mining. In Proceedings of the Seventh International Database Engineering and Applications Symposium (IDEAS\u201903), Hong Kong, China (pp. 54-65)."},{"key":"jiit.2010100103-22","doi-asserted-by":"crossref","unstructured":"Vaidya, J., & Clifton, C. (2002). Privacy Preserving Association Rule Mining in Vertically Partioned data. In Proceedings of ACM SIGKDD \u201902.","DOI":"10.1145\/775047.775142"},{"key":"jiit.2010100103-23","author":"J.Vaidya","year":"2004","journal-title":"Privacy-Preserving Data Mining: Why, How, and When"},{"key":"jiit.2010100103-24","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974131"},{"key":"jiit.2010100103-25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269668"},{"key":"jiit.2010100103-26","unstructured":"Wang, S., Lee, Y., Billis, S., & Jafari, A. (2004). Hiding Sensitive Items in Privacy Preserving Association Rule Mining. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics."},{"key":"jiit.2010100103-27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.250583"},{"key":"jiit.2010100103-28","doi-asserted-by":"crossref","unstructured":"Yao, A. C. (1986). How to generate and exchange secret. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (pp. 162-167).","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["International Journal of Intelligent Information Technologies"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=46962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T16:50:49Z","timestamp":1654102249000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jiit.2010100103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,10,1]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,10]]}},"URL":"https:\/\/doi.org\/10.4018\/jiit.2010100103","relation":{},"ISSN":["1548-3657","1548-3665"],"issn-type":[{"value":"1548-3657","type":"print"},{"value":"1548-3665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,1]]}}}