{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:37Z","timestamp":1740107857663,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T00:00:00Z","timestamp":1549670400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503092"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00500-019-03829-3","type":"journal-article","created":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T01:27:25Z","timestamp":1549675645000},"page":"12779-12797","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["Hiding sensitive itemsets with multiple objective optimization"],"prefix":"10.1007","volume":"23","author":[{"given":"Jerry Chun-Wei","family":"Lin","sequence":"first","affiliation":[]},{"given":"Yuyu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Binbin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"given":"Youcef","family":"Djenouri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,9]]},"reference":[{"key":"3829_CR1","unstructured":"Agrawal R, Srikant R (1994a) Quest synthetic data generator. IBM Almaden Research Center. \n http:\/\/www.Almaden.ibm.com\/cs\/quest\/syndata.html"},{"key":"3829_CR2","unstructured":"Agrawal R, Srikant R (1994b) Fast algorithms for mining association rules in large databases. In: The international conference on very large data base. pp 487\u2013499"},{"key":"3829_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: ACM international conference on management of data, vol 29. pp 439\u2013450","DOI":"10.1145\/342009.335438"},{"issue":"3","key":"3829_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.3233\/IDA-160817","volume":"20","author":"P Cheng","year":"2016","unstructured":"Cheng P, Lee I, Lin CW, Pan JS (2016) Association rule hiding based on evolutionary multi-objective optimization. Intell Data Anal 20(3):495\u2013514","journal-title":"Intell Data Anal"},{"key":"3829_CR5","doi-asserted-by":"crossref","unstructured":"Cheung DW, Han J, Ng VT, Wong CY (1996) Maintenance of discovered association rules in large databases: an incremental updating technique. In: The international conference on data engineering. pp 106\u2013114","DOI":"10.1109\/ICDE.1996.492094"},{"key":"3829_CR6","doi-asserted-by":"crossref","unstructured":"Cheung DW, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules. In: The international conference on database systems for advanced applications. pp 185\u2013194","DOI":"10.1142\/9789812819536_0020"},{"issue":"2","key":"3829_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton C, Kantarcioglu M, Vaidya J, Lin X, Zhu MY (2002) Tools for privacy preserving distributed data mining. SIGKDD Explor 4(2):28\u2013347","journal-title":"SIGKDD Explor"},{"key":"3829_CR8","doi-asserted-by":"crossref","unstructured":"Dasseni E, Verykios VS, Elmagarmid AK, Bertino E (2001) Hiding association rules by using confidence and support. In: The international workshop on information hiding. pp 369\u2013383","DOI":"10.1007\/3-540-45496-9_27"},{"issue":"2","key":"3829_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agrawal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"3829_CR10","doi-asserted-by":"crossref","unstructured":"Derigs U, Kabath M, Zils M (1999) Adaptive genetic algorithms: a methodology for dynamic autoconfiguration of genetic search algorithms. Meta-Heuristics. pp 231\u2013248","DOI":"10.1007\/978-1-4615-5775-3_16"},{"key":"3829_CR11","doi-asserted-by":"crossref","unstructured":"Dwork C, McSherry F, Nissim K, Smith A (2006) Calibrating noise to sensitivity in private data analysis. In: Theory of cryptography conference, vol 3876. pp 265\u2013284","DOI":"10.1007\/11681878_14"},{"key":"3829_CR12","doi-asserted-by":"crossref","unstructured":"Emmerich M, Beume N, Naujoks B (2005) An EMO algorithm using the hypervolume measure as selection criterion. In: The international conference on evolutionary multi-criterion optimization. pp 62\u201376","DOI":"10.1007\/978-3-540-31880-4_5"},{"issue":"3","key":"3829_CR13","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s11047-018-9685-y","volume":"17","author":"MTM Emmerich","year":"2018","unstructured":"Emmerich MTM, Deutz AH (2018) A tutorial on multiobjective optimization: fundamentals and evolutionary methods. Nat Comput 17(3):585\u2013609","journal-title":"Nat Comput"},{"key":"3829_CR14","unstructured":"Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: formulation, discussion and generalization. In: The international conference on genetic algorithms. pp 416\u2013423"},{"key":"3829_CR15","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Gomariz A, Gueniche T, Soltani A, Deng Z (2016) The SPMF open-source data mining library version 2. In: Joint European conference on machine learning and knowledge discovery in databases. pp 36\u201340","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"3829_CR16","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley Longman Publishing Co., Inc, Boston"},{"key":"3829_CR17","doi-asserted-by":"crossref","unstructured":"Han S, Ng WK (2007) Privacy-preserving genetic algorithms for rule discovery. In: The international conference on data warehousing and knowledge discovery. pp 407\u2013417","DOI":"10.1007\/978-3-540-74553-2_38"},{"issue":"1","key":"3829_CR18","doi-asserted-by":"publisher","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. Data Min Knowl Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"issue":"5","key":"3829_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/app8050783","volume":"8","author":"ASMT Hasan","year":"2018","unstructured":"Hasan ASMT, Jiang Q, Chen H, Wang S (2018) A new approach to privacy-preserving multiple independent data publishing. Appl Sci 8(5):1\u201322","journal-title":"Appl Sci"},{"key":"3829_CR20","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence. MIT Press, Cambridge"},{"key":"3829_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.3233\/IDA-2001-5203","volume":"5","author":"TP Hong","year":"2001","unstructured":"Hong TP, Wang CY, Tao YH (2001) A new incremental data mining algorithm using pre-large itemsets. Intell Data Anal 5:111\u2013129","journal-title":"Intell Data Anal"},{"issue":"4","key":"3829_CR22","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/s10489-012-0377-5","volume":"38","author":"TP Hong","year":"2012","unstructured":"Hong TP, Lin CW, Yang KT, Wang SL (2012) Using TF-IDF to hide sensitive itemsets. Appl Intell 38(4):502\u2013510","journal-title":"Appl Intell"},{"key":"3829_CR23","doi-asserted-by":"crossref","unstructured":"Hongcheng T (2012) An improved adaptive genetic algorithm. In: Knowledge discovery and data mining. pp 717\u2013723","DOI":"10.1007\/978-3-642-27708-5_99"},{"key":"3829_CR24","first-page":"289","volume":"41","author":"G Kalyani","year":"2017","unstructured":"Kalyani G, Chandra Sekhara Rao MVP, Janakiramaiah B (2017) Decision tree based data reconstruction for privacy preserving classification rule mining. Informatica 41:289\u2013304","journal-title":"Informatica"},{"key":"3829_CR25","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks. pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"3829_CR26","doi-asserted-by":"crossref","unstructured":"Knowles J, Corne D (1999) The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation. In: The congress on evolutionary computation. pp 98\u2013105","DOI":"10.1109\/CEC.1999.781913"},{"key":"3829_CR27","first-page":"201","volume":"4","author":"CW Lin","year":"2013","unstructured":"Lin CW, Hong TP, Chang CC, Wang SL (2013) A greedy-based approach for hiding sensitive itemsets by transaction insertion. J Inf Hiding Multimed Signal Process 4:201\u2013227","journal-title":"J Inf Hiding Multimed Signal Process"},{"key":"3829_CR28","first-page":"1","volume":"398269","author":"CW Lin","year":"2014","unstructured":"Lin CW, Zhang B, Yang KT, Hong TP (2014) Efficiently hiding sensitive itemsets with transaction deletion based on genetic algorithms. Sci World J 398269:1\u201313","journal-title":"Sci World J"},{"issue":"2","key":"3829_CR29","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10489-014-0590-5","volume":"42","author":"CW Lin","year":"2015","unstructured":"Lin CW, Hong TP, Yang KT, Wang SL (2015) The GA-based algorithms for optimizing hiding sensitive itemsets through transaction deletion. Appl Intell 42(2):210\u2013230","journal-title":"Appl Intell"},{"issue":"C","key":"3829_CR30","first-page":"1","volume":"53","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Liu Q, Fournier-Viger P (2016) A sanitization approach for hiding sensitive itemsets based on particle swarm optimization. Eng Appl Artif Intell 53(C):1\u201318","journal-title":"Eng Appl Artif Intell"},{"key":"3829_CR31","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.engappai.2018.10.010","volume":"77","author":"JCW Lin","year":"2019","unstructured":"Lin JCW, Yang L, Fournier-Viger P, Hong TP (2019) Mining of skyline patterns by considering both frequent and utility constraints. Eng Appl Artif Intell 77:229\u2013238","journal-title":"Eng Appl Artif Intell"},{"key":"3829_CR32","doi-asserted-by":"crossref","unstructured":"Lindell Y, Pinkas B (2000) Privacy preserving data mining. In: The annual international cryptology conference on advances in cryptology. pp 36\u201354","DOI":"10.1007\/3-540-44598-6_3"},{"key":"3829_CR33","first-page":"1","volume":"4945152","author":"F Liu","year":"2018","unstructured":"Liu F, Li T (2018) A clustering k-anonymity privacy-preserving method for wearable IoT devices. Secur Commun Netw 4945152:1\u20138","journal-title":"Secur Commun Netw"},{"issue":"4","key":"3829_CR34","first-page":"28","volume":"1","author":"D Marco","year":"2004","unstructured":"Marco D, Sabrina O, Thomas S (2004) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"3829_CR35","doi-asserted-by":"publisher","first-page":"10562","DOI":"10.1109\/ACCESS.2017.2706947","volume":"5","author":"R Mendes","year":"2017","unstructured":"Mendes R, Vilela JP (2017) Privacy-preserving data mining: methods, metrics, and applications. IEEE Access 5:10562\u201310582","journal-title":"IEEE Access"},{"issue":"9","key":"3829_CR36","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1080\/08839514.2016.1268038","volume":"30","author":"FN Motlagh","year":"2016","unstructured":"Motlagh FN, Sajedi H (2016) MOSAR: a multi-objective strategy for hiding sensitive association rules using genetic algorithm. Appl Artif Intell 30(9):823\u2013843","journal-title":"Appl Artif Intell"},{"key":"3829_CR37","unstructured":"Oliveira SRM, Za\u00efane OR (2002) Privacy preserving frequent itemset mining. In: IEEE international conference on privacy, security and data mining. pp 43\u201354"},{"key":"3829_CR38","doi-asserted-by":"crossref","unstructured":"Ping G, Chunbo X, Yi C, Jing L, Yanqing L (2014) Adaptive ant colony optimization algorithm. In: The international conference on mechatronics and control. pp 95\u201398","DOI":"10.1109\/ICMC.2014.7231524"},{"key":"3829_CR39","unstructured":"Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: The international conference on genetic algorithms, vol 2, no 1. pp 93\u2013100"},{"issue":"3","key":"3829_CR40","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221\u2013248","journal-title":"Evol Comput"},{"issue":"4","key":"3829_CR41","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359","journal-title":"J Glob Optim"},{"key":"3829_CR42","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/974121.974131","volume":"33","author":"VS Verykios","year":"2004","unstructured":"Verykios VS, Bertino E, Fovino IN, Provenza LP, Saygin Y, Theodoridis Y (2004) State-of-the-art in privacy preserving data mining. ACM SIGMOD Record 33:50\u201357","journal-title":"ACM SIGMOD Record"},{"key":"3829_CR43","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TKDE.2007.250583","volume":"19","author":"YH Wu","year":"2007","unstructured":"Wu YH, Chiang CM, Chen ALP (2007) Hiding sensitive association rules with limited side effects. IEEE Trans Knowl Data Eng 19:29\u201342","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"3829_CR44","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"3829_CR45","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pareto evolutionary algorithm. In: Evolutionary methods for design, optimization and control with applications to industrial problems. pp 95\u2013100"},{"issue":"6","key":"3829_CR46","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1109\/TSMCB.2009.2015956","volume":"39","author":"ZH Zhan","year":"2009","unstructured":"Zhan ZH, Zhang J, Li Y, Chung HSH (2009) Adaptive particle swarm optimization. IEEE Trans Syst Man Cybern B 39(6):1362\u20131381","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"6","key":"3829_CR47","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-03829-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03829-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03829-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T19:06:32Z","timestamp":1581188792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-03829-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,9]]},"references-count":47,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["3829"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-03829-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2019,2,9]]},"assertion":[{"value":"9 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there are no conflicts of interest in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}