{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:35:49Z","timestamp":1648553749660},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T00:00:00Z","timestamp":1341446400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s13042-012-0111-y","type":"journal-article","created":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T18:15:08Z","timestamp":1341425708000},"page":"515-525","source":"Crossref","is-referenced-by-count":0,"title":["Concealing party-centric sensitive rules in a centralized data source"],"prefix":"10.1007","volume":"4","author":[{"given":"M.","family":"Rajalakshmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Purusothaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,5]]},"reference":[{"key":"111_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal D, Aggarwal C (2001) On the design and quantification of privacy preserving data mining algorithms. In: The Proceedings of 20th ACMSIGACT-SIGMOD-SIGART Symposium on Principles of database systems, CA, USA, pp 247\u2013255","DOI":"10.1145\/375551.375602"},{"key":"111_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami AN (1993) Mining association rules between sets of items in large databases. In: The Proceeding ACM SIGMOD International Conference on Management of Data, Washington, D.C., pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"111_CR3","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB Conference Santiago, Chile, pp 487\u2013499"},{"key":"111_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal R, Srikant R (2000) Privacy preserving data mining. In: Proceedings of ACM SIGMOD Conference on Management of Data (Texas, USA), pp 439\u2013450","DOI":"10.1145\/335191.335438"},{"key":"111_CR5","unstructured":"Angiulli F, Ianni G, Palopoli L (2001) On the complexity of mining association rules. In: Proceedings of Nono Convegno Nazionale su Sistemi Evoluti di asidi Dati (SEBD), pp. 177\u2013184"},{"key":"111_CR6","unstructured":"Atallah M, Bertino E, Elmagarmid A, Ibrahim M, Verykios VS (1999) Disclosure limitation of sensitive rules. In: Proceedings of the IEEE Knowledge and Data Exchange Workshop (KDEX\u201999). IEEE Computer Society, pp 45\u201352"},{"key":"111_CR7","doi-asserted-by":"crossref","unstructured":"Bertino E, Fovino I, Provenza L (2005) A framework for evaluating privacy preserving data mining algorithms. Data Mining Knowl Discov 11(2):121\u2013154","DOI":"10.1007\/s10618-005-0006-6"},{"key":"111_CR8","volume-title":"Data warehouse, data mining and OLAP","author":"A Berson","year":"2004","unstructured":"Berson A, Smith SJ (2004) Data warehouse, data mining and OLAP. Tata McGraw Hill Press, New Delhi"},{"issue":"4","key":"111_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s13042-010-0007-7","volume":"1","author":"B Biggio","year":"2010","unstructured":"Biggio B, Fumera G, Roli F (2010) Multiple classifier systems for robust classifier design in adversarial environments. Int J Mach Learn Cybern 1(4):27\u201341","journal-title":"Int J Mach Learn Cybern"},{"key":"111_CR10","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\u201319"},{"key":"111_CR11","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"1990","unstructured":"Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to algorithms. MIT Press, Cambridge"},{"key":"111_CR12","unstructured":"Fayyad U, Shapiro G, Smyth P, Uthrusamy R (1996) Advances in knowledge discovery and data mining, AAAI Press\/MIT Press, Menlo Park"},{"issue":"5","key":"111_CR13","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1109\/TKDE.2008.199","volume":"21","author":"A Gkoulalas-Divanis","year":"2009","unstructured":"Gkoulalas-Divanis A, Verykios S (2009) Exact knowledge hiding through database extension. IEEE Trans Knowl Data Eng 21(5):699\u2013713","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"111_CR14","unstructured":"Han J, Fu Y (1995) Discovery of multiple-level association rules from large databases. In: Proceedings of 1995 International Conference on Very Large Data Bases (VLDB'95), Z\u00fcrich, Switzerland, pp 420\u2013431"},{"key":"111_CR15","unstructured":"Han J, Kamber M (2001) Data mining: concepts and techniques, Morgan Kaufmann Publishers, San Francisco"},{"issue":"1","key":"111_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. IEEE Trans Data Mining Knowl Discov 8(1):53\u201387","journal-title":"IEEE Trans Data Mining Knowl Discov"},{"key":"111_CR17","unstructured":"Lee G, Chang C, Chen ALP (2004) Hiding sensitive patterns in association rules mining. In: Proceedings of the 28th Annual International Computer Software and Applications Conference (COMPSAC\u201904)"},{"key":"111_CR18","doi-asserted-by":"crossref","unstructured":"Lin D, Kedem ZM (2002) Pincer-search: an efficient algorithm for discovering the maximum frequent set. IEEE Trans Knowl Data Eng 14(3):553\u2013556","DOI":"10.1109\/TKDE.2002.1000342"},{"key":"111_CR19","doi-asserted-by":"crossref","unstructured":"Lindell Y, Pinkas B (2000) Privacy preserving data mining. Lecture Notes in Computer Science","DOI":"10.1007\/3-540-44598-6_3"},{"issue":"1","key":"111_CR20","doi-asserted-by":"crossref","first-page":"68","DOI":"10.4018\/jiit.2006010104","volume":"2","author":"R Nedunchezhian","year":"2006","unstructured":"Nedunchezhian R, Anbumani K (2006) Rapid privacy preserving algorithm for large databases international. J Intell Inform Technol 2(1):68\u201381","journal-title":"J Intell Inform Technol"},{"key":"111_CR21","unstructured":"Oliveira S, Zaiane O (2003) Privacy preserving clustering by data transformation. In: Proceedings of the 18th Brazilian Symposium on Databases (SBBD 2003), pp 304\u2013318"},{"key":"111_CR22","doi-asserted-by":"crossref","unstructured":"Saygin Y, Verykios S, Elmagarmid K (2002) Privacy preserving association rule mining. In: Proceedings of 12th International Workshop on Research Issues in data engineering: engineering e-commerce\/e-business systems (RIDE\u201902), San Jose, pp 151\u2013158","DOI":"10.1109\/RIDE.2002.995109"},{"key":"111_CR23","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining quantitative association rules in large relational tables. In: Proceedings of ACM SIGMOD International Conference on Management of Data, Montreal, Canada, pp 1\u201312","DOI":"10.1145\/233269.233311"},{"key":"111_CR24","unstructured":"Stanley R, Oliveira M, Zaiane O (2003) Protecting sensitive knowledge by data sanitization. In: Proceedings of Third IEEE International Conference on data mining (ICDM\u201903), Florida, pp 613\u2013616"},{"key":"111_CR25","unstructured":"Stanley R, Oliveira M, Zaiane R (2002) Privacy preserving frequent itemset mining. In: Proceedings of the IEEE international conference on privacy, security and data mining (PSDM\u201902), Maebashi, pp 43\u201354"},{"key":"111_CR26","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C (2004) Privacy-preserving data mining: why, how, and when. IEEE Security Priv 2(6):19\u201327","DOI":"10.1109\/MSP.2004.108"},{"issue":"4","key":"111_CR27","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/TKDE.2004.1269668","volume":"16","author":"S Verykios","year":"2004","unstructured":"Verykios S, Elmagarmid K, Bertino E, Saygin Y, Dasseni E (2004) Association rule hiding. IEEE Trans Knowl Data Eng 16(4):434\u2013447","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"111_CR28","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/974121.974131","volume":"33","author":"S Verykios","year":"2004","unstructured":"Verykios S, Bertino E, Provenza I, Saygin Y, Theodoridis Y (2004) State-of-the-Art in privacy preserving data mining. ACM SIGMOD Record 33(1):50\u201357","journal-title":"ACM SIGMOD Record"},{"key":"111_CR29","doi-asserted-by":"crossref","unstructured":"Wu Y, Chiang C, Chen A (2007) Hiding sensitive association rules with limited side effects. IEEE Trans Knowl Data Eng 19(1):29\u201342","DOI":"10.1109\/TKDE.2007.250583"},{"key":"111_CR30","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2000) Generating non-redundant association rules. In: The proceedings of The Sixth ACM SIGKDD International Conference on knowledge discovery and data mining, pp 34\u201343","DOI":"10.1145\/347090.347101"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-012-0111-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-012-0111-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-012-0111-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T10:28:45Z","timestamp":1561890525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-012-0111-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,5]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["111"],"URL":"https:\/\/doi.org\/10.1007\/s13042-012-0111-y","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,5]]}}}