Skip to main content
Erschienen in: Cluster Computing 1/2019

08.03.2018

Lossless and robust privacy preservation of association rules in data sanitization

verfasst von: Geeta S. Navale, Suresh N. Mali

Erschienen in: Cluster Computing | Sonderheft 1/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Data sanitization is a novel research area that conceals the sensitive rules given by the experts present in the original database with the appropriate modifications and then emancipates the modified database so that unauthorized persons cannot discover the sensitive rules and so the confidentiality of data is conserved against data mining methods. This paper primarily focuses on building an effective sanitizing algorithm for hiding the sensitive rules given by the experts/users. In order to minimize the four sanitization research challenges such as hiding failure, information loss, false rule generation and modification degree, the proposed method uses Firefly optimization algorithm. The proposed sanitization method has been compared and examined with other existing sanitizing algorithms depicting considerable improvement in terms of four research challenges that in turn can secure the selected database.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Han, S., Ng, W.K.: Privacy-preserving genetic algorithms for rule discovery. In: Lecture Notes in Computer Science, pp. 407–417 (2007) Han, S., Ng, W.K.: Privacy-preserving genetic algorithms for rule discovery. In: Lecture Notes in Computer Science, pp. 407–417 (2007)
2.
Zurück zum Zitat Kuo, R.J., Chao, C.M., Chiu, Y.T.: Application of particle swarm optimization to association rule mining. Appl. Soft Comput. 11(1), 326–336 (2011)CrossRef Kuo, R.J., Chao, C.M., Chiu, Y.T.: Application of particle swarm optimization to association rule mining. Appl. Soft Comput. 11(1), 326–336 (2011)CrossRef
3.
Zurück zum Zitat Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: The Annual International Cryptology Conference on Advances in Cryptology, pp. 36–54 (2000) Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: The Annual International Cryptology Conference on Advances in Cryptology, pp. 36–54 (2000)
4.
Zurück zum Zitat Lin, C.W., Hong, T.P., Chang, C.C., Wang, S.L.: A greedy-based approach for hiding sensitive itemsets by transaction insertion. J. Inf. Hiding Multimed. Signal Process. 4, 201–227 (2013) Lin, C.W., Hong, T.P., Chang, C.C., Wang, S.L.: A greedy-based approach for hiding sensitive itemsets by transaction insertion. J. Inf. Hiding Multimed. Signal Process. 4, 201–227 (2013)
5.
Zurück zum Zitat Lin, C.W., Hong, T.P., Yang, K.T., Wang, S.L.: The GA-based algorithms for optimizing hiding sensitive itemsets through transaction deletion. Appl. Intell. 42(2), 210–230 (2015)CrossRef Lin, C.W., Hong, T.P., Yang, K.T., Wang, S.L.: The GA-based algorithms for optimizing hiding sensitive itemsets through transaction deletion. Appl. Intell. 42(2), 210–230 (2015)CrossRef
6.
Zurück zum Zitat Pears, R., Koh, Y.S.: Weighted association rule mining using particle swarm optimization. Lect. Notes Comput. Sci. 7104, 327–338 (2012)CrossRef Pears, R., Koh, Y.S.: Weighted association rule mining using particle swarm optimization. Lect. Notes Comput. Sci. 7104, 327–338 (2012)CrossRef
7.
Zurück zum Zitat Sarath, K.N.V.D., Ravi, V.: Association rule mining using binary particle swarm optimization. Eng. Appl. Artif. Intell. 26, 1832–1840 (2013)CrossRef Sarath, K.N.V.D., Ravi, V.: Association rule mining using binary particle swarm optimization. Eng. Appl. Artif. Intell. 26, 1832–1840 (2013)CrossRef
8.
Zurück zum Zitat Shen, M., Zhan, Z.H., Chen, W.N., Gong, Y.J., Zhang, J., Li, Y.: Bi-velocity discrete particle swarm optimization and its application to multi cast routing problem in communication networks. IEEE Trans. Ind. Electron. 61(12), 7141–7151 (2014)CrossRef Shen, M., Zhan, Z.H., Chen, W.N., Gong, Y.J., Zhang, J., Li, Y.: Bi-velocity discrete particle swarm optimization and its application to multi cast routing problem in communication networks. IEEE Trans. Ind. Electron. 61(12), 7141–7151 (2014)CrossRef
9.
Zurück zum Zitat Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: ACM Sigkdd International Conference on Knowledge Discovery and Data Mining, pp. 217–228 (2002) Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: ACM Sigkdd International Conference on Knowledge Discovery and Data Mining, pp. 217–228 (2002)
10.
Zurück zum Zitat Islam, Z., Brankovic, L.: Privacy preserving data mining: a noise addition frame work using a novel clustering technique. Knowl. Based Syst. 24(8), 1214–1223 (2011)CrossRef Islam, Z., Brankovic, L.: Privacy preserving data mining: a noise addition frame work using a novel clustering technique. Knowl. Based Syst. 24(8), 1214–1223 (2011)CrossRef
12.
Zurück zum Zitat Menhas, M.I., Fei, M., Wang, L., Fu, X.: A novel hybrid binary PSO algorithm. Lect. Notes Comput. Sci. 6728, 93–100 (2011)CrossRef Menhas, M.I., Fei, M., Wang, L., Fu, X.: A novel hybrid binary PSO algorithm. Lect. Notes Comput. Sci. 6728, 93–100 (2011)CrossRef
13.
Zurück zum Zitat Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31(3), 264–323 (1999)CrossRef Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31(3), 264–323 (1999)CrossRef
14.
Zurück zum Zitat Mooney, C.H., Roddick, J.F.: Sequential pattern mining—approaches and algorithms. ACM Comput. Surv. 45(2), 1–39 (2013)CrossRefMATH Mooney, C.H., Roddick, J.F.: Sequential pattern mining—approaches and algorithms. ACM Comput. Surv. 45(2), 1–39 (2013)CrossRefMATH
15.
Zurück zum Zitat Oliveira, S.R.M., Zaane, O.R.: Privacy preserving frequent itemset mining. In: IEEE International Conference on Privacy, Security and Data Mining, pp. 43–54. (2002) Oliveira, S.R.M., Zaane, O.R.: Privacy preserving frequent itemset mining. In: IEEE International Conference on Privacy, Security and Data Mining, pp. 43–54. (2002)
16.
Zurück zum Zitat Pandya, B.K., Dixit, K., Singh, U.K., Bunkar, K.: Effectiveness of multiplicative data perturbation for privacy preserving data mining. Int. J. Adv. Res. Comput. Sci. 5(6), 112–115 (2014) Pandya, B.K., Dixit, K., Singh, U.K., Bunkar, K.: Effectiveness of multiplicative data perturbation for privacy preserving data mining. Int. J. Adv. Res. Comput. Sci. 5(6), 112–115 (2014)
17.
Zurück zum Zitat Verykios, V.S., Bertino, E., Fovino, I.N., Provenza, L.P., Saygin, Y., Theodoridis, Y.: State-of-the-art in privacy preserving data mining. ACM Sigmod Rec. 33, 50–57 (2004)CrossRef Verykios, V.S., Bertino, E., Fovino, I.N., Provenza, L.P., Saygin, Y., Theodoridis, Y.: State-of-the-art in privacy preserving data mining. ACM Sigmod Rec. 33, 50–57 (2004)CrossRef
18.
Zurück zum Zitat Fouad, M.R., Elbassioni, K., Bertino, E.: A supermodularity-based differential privacy preserving algorithm for data anonymization. IEEE Trans. Knowl. Data Eng. 26(7), 1591–1601 (2014)CrossRef Fouad, M.R., Elbassioni, K., Bertino, E.: A supermodularity-based differential privacy preserving algorithm for data anonymization. IEEE Trans. Knowl. Data Eng. 26(7), 1591–1601 (2014)CrossRef
19.
Zurück zum Zitat Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving distributed data mining. ACM Sigkdd Explor. 4, 1–7 (2003) Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving distributed data mining. ACM Sigkdd Explor. 4, 1–7 (2003)
20.
Zurück zum Zitat Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley Longman Publishing Co.Inc, Boston (1989)MATH Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley Longman Publishing Co.Inc, Boston (1989)MATH
21.
Zurück zum Zitat Sweeney, L.: k-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl. Based Syst 10, 557–570 (2002)MathSciNetCrossRefMATH Sweeney, L.: k-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl. Based Syst 10, 557–570 (2002)MathSciNetCrossRefMATH
22.
Zurück zum Zitat Hajian, S., Domingo-Ferrer, J., Farrs, O.: Generalization-based privacy preservation and discrimination prevention in data publishing and mining. Data Min. Knowl. Discov. 28(5–6), 1158–1188 (2014)MathSciNetCrossRefMATH Hajian, S., Domingo-Ferrer, J., Farrs, O.: Generalization-based privacy preservation and discrimination prevention in data publishing and mining. Data Min. Knowl. Discov. 28(5–6), 1158–1188 (2014)MathSciNetCrossRefMATH
25.
Zurück zum Zitat Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: The International Conference on Very Large DataBase, San Francisco pp. 487–499 (1994b) Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: The International Conference on Very Large DataBase, San Francisco pp. 487–499 (1994b)
26.
Zurück zum Zitat Agrawal, R., Srikant R.: Mining sequential patterns. In: The International Conference on Data Engineering, pp. 3–14 (1995) Agrawal, R., Srikant R.: Mining sequential patterns. In: The International Conference on Data Engineering, pp. 3–14 (1995)
27.
Zurück zum Zitat Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E.: Hiding association rules by using confidence and support. In: International Workshop on Information Hiding, pp. 369–383 (2001) Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E.: Hiding association rules by using confidence and support. In: International Workshop on Information Hiding, pp. 369–383 (2001)
28.
Zurück zum Zitat Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. Lect. Notes Comput. Sci. 3876, 265–284 (2006)MathSciNetCrossRefMATH Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. Lect. Notes Comput. Sci. 3876, 265–284 (2006)MathSciNetCrossRefMATH
29.
Zurück zum Zitat Chen, M.S., Han, J., Yu, P.S.: Data mining: an overview from a database perspective. IEEE Trans. Knowl. Data Eng. 8(6), 866–883 (1996)CrossRef Chen, M.S., Han, J., Yu, P.S.: Data mining: an overview from a database perspective. IEEE Trans. Knowl. Data Eng. 8(6), 866–883 (1996)CrossRef
30.
Zurück zum Zitat Quinlan, J.R.: C4.5: programs for machine learning. Morgan Kaufmann Publishers Inc, San Francisco (1993) Quinlan, J.R.: C4.5: programs for machine learning. Morgan Kaufmann Publishers Inc, San Francisco (1993)
32.
Zurück zum Zitat Agrawal, R., Srikant, R.: Privacy-preserving data mining. ACM Sigmod Rec. 29, 439–450 (2000)CrossRef Agrawal, R., Srikant, R.: Privacy-preserving data mining. ACM Sigmod Rec. 29, 439–450 (2000)CrossRef
33.
Zurück zum Zitat Aggarwal, C.C., Pei, J., Zhang, B.: On privacy preservation against adversarial data mining. In: ACM Sigkdd International Conference on Knowledge Discovery and Data Mining, pp. 510–516 (2006) Aggarwal, C.C., Pei, J., Zhang, B.: On privacy preservation against adversarial data mining. In: ACM Sigkdd International Conference on Knowledge Discovery and Data Mining, pp. 510–516 (2006)
34.
Zurück zum Zitat Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure limitation of sensitive rules. In: The Workshop on Knowledge and Data Engineering Exchange, pp.45–52 (1999) Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure limitation of sensitive rules. In: The Workshop on Knowledge and Data Engineering Exchange, pp.45–52 (1999)
35.
Zurück zum Zitat Bonam, J., Reddy, A.R., Kalyani, G.: Privacy preserving in association rule mining by data distortion using PSO. In: ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India—vol. II, pp. 551–558 (2014) Bonam, J., Reddy, A.R., Kalyani, G.: Privacy preserving in association rule mining by data distortion using PSO. In: ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India—vol. II, pp. 551–558 (2014)
36.
Zurück zum Zitat Zuo, X., Zhang, G., Tan, W.: Self-adaptive learning PSO-based deadline constrained task scheduling for hybrid IaaS cloud. IEEE Trans. Autom. Sci. Eng. 11(2), 564–573 (2014)CrossRef Zuo, X., Zhang, G., Tan, W.: Self-adaptive learning PSO-based deadline constrained task scheduling for hybrid IaaS cloud. IEEE Trans. Autom. Sci. Eng. 11(2), 564–573 (2014)CrossRef
37.
Zurück zum Zitat Zhi, X.H., Xing, X.L., Qang, Q.X., Zhang, L.H.: A discrete PSO method for generalized TSP problem. In: IEEE International Conference on Machine Learning and Cybernetics, pp. 2378–2383 (2004) Zhi, X.H., Xing, X.L., Qang, Q.X., Zhang, L.H.: A discrete PSO method for generalized TSP problem. In: IEEE International Conference on Machine Learning and Cybernetics, pp. 2378–2383 (2004)
38.
Zurück zum Zitat Lin, J.C.W., Liu, Q., Fournier-Viger, P., Hong, T.P., Voznak, M., Zhan, J.: A sanitization approach for hiding sensitive itemsets based on particle swarm optimization. Eng. Appl. Artif. Intell. 53, 1–18 (2016)CrossRef Lin, J.C.W., Liu, Q., Fournier-Viger, P., Hong, T.P., Voznak, M., Zhan, J.: A sanitization approach for hiding sensitive itemsets based on particle swarm optimization. Eng. Appl. Artif. Intell. 53, 1–18 (2016)CrossRef
39.
Zurück zum Zitat Bhatar, K.: investigating and modeling the effect of laser intensity and nonlinear regime of the fiber on the optical link. J. Optical Commun. 38, 341–353 (2016) Bhatar, K.: investigating and modeling the effect of laser intensity and nonlinear regime of the fiber on the optical link. J. Optical Commun. 38, 341–353 (2016)
41.
Zurück zum Zitat Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)MathSciNetCrossRef Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)MathSciNetCrossRef
42.
Zurück zum Zitat Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp. 1942–1948 (1995) Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
43.
Zurück zum Zitat Kennedy, J., Eberhart, R.: A discrete binary version of particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, pp. 4104–4108 (1997) Kennedy, J., Eberhart, R.: A discrete binary version of particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, pp. 4104–4108 (1997)
44.
Zurück zum Zitat Lin, C.W., Yang, L., Fournier-Viger, P., Wu, M.T., Hong, T.P., Wang, S.L.: A swarm-based approach to mine high-utility itemsets. Multi discip. Soc. Netw. Res. pp. 572–581 (2015b) Lin, C.W., Yang, L., Fournier-Viger, P., Wu, M.T., Hong, T.P., Wang, S.L.: A swarm-based approach to mine high-utility itemsets. Multi discip. Soc. Netw. Res. pp. 572–581 (2015b)
45.
Zurück zum Zitat Wu, Y.H., Chiang, C.M., Chen, A.L.P.: Hiding sensitive association rules with limited side effects. IEEE Trans. Knowl. Data Eng. 19, 29–42 (2007)CrossRef Wu, Y.H., Chiang, C.M., Chen, A.L.P.: Hiding sensitive association rules with limited side effects. IEEE Trans. Knowl. Data Eng. 19, 29–42 (2007)CrossRef
46.
Zurück zum Zitat Zaki, M.: SPADE: an efficient algorithm for mining frequent sEquences. Mach. Learn. 42(1–2), 31–60 (2001)CrossRefMATH Zaki, M.: SPADE: an efficient algorithm for mining frequent sEquences. Mach. Learn. 42(1–2), 31–60 (2001)CrossRefMATH
47.
Zurück zum Zitat Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Trans. Evol. Comput. 3(4), 287–297 (1999)CrossRef Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Trans. Evol. Comput. 3(4), 287–297 (1999)CrossRef
48.
Zurück zum Zitat Holland, J.H.: adaptation in natural and artificial systems. MIT Press, Cambridge (1992)CrossRef Holland, J.H.: adaptation in natural and artificial systems. MIT Press, Cambridge (1992)CrossRef
49.
Zurück zum Zitat Hong, T.P., Wang, C.Y., Tao, Y.H.: A new incremental data mining algorithm using pre-large itemsets. Intell. Data Anal. 5, 111–129 (2001) Hong, T.P., Wang, C.Y., Tao, Y.H.: A new incremental data mining algorithm using pre-large itemsets. Intell. Data Anal. 5, 111–129 (2001)
50.
Zurück zum Zitat Hong, T.P., Lin, C.W., Yang, K.T., Wang, S.L.: Using TF-IDF to hide sensitive itemsets. Appl. Intell. 38(4), 502–510 (2012)CrossRef Hong, T.P., Lin, C.W., Yang, K.T., Wang, S.L.: Using TF-IDF to hide sensitive itemsets. Appl. Intell. 38(4), 502–510 (2012)CrossRef
51.
Zurück zum Zitat Giannotti, F., Lakshmanan, L.V.S., Monreale, A., Pedreschi, D., Wang, H.: Privacy-preserving mining of association rules from outsourced transaction databases. IEEE Syst. J. 7(3), 385–395 (2013)CrossRef Giannotti, F., Lakshmanan, L.V.S., Monreale, A., Pedreschi, D., Wang, H.: Privacy-preserving mining of association rules from outsourced transaction databases. IEEE Syst. J. 7(3), 385–395 (2013)CrossRef
52.
Zurück zum Zitat Pathak, K., Chaudhari, N.S., Tiwari, A.: Privacy preserving association rule mining by introducing concept of impact factor. In: proceedings of IEEE conference Industrial Electronics and Applications (ICIEA), pp. 1458–1461 (2012) Pathak, K., Chaudhari, N.S., Tiwari, A.: Privacy preserving association rule mining by introducing concept of impact factor. In: proceedings of IEEE conference Industrial Electronics and Applications (ICIEA), pp. 1458–1461 (2012)
53.
Zurück zum Zitat Wang, H., Yi, C.: Privacy-Preservation Association Rules Mining Based on Fuzzy Correlation. In: proceedings of International Conference on Fuzzy Systems and Knowledge discovery, pp. 757–760 (2012) Wang, H., Yi, C.: Privacy-Preservation Association Rules Mining Based on Fuzzy Correlation. In: proceedings of International Conference on Fuzzy Systems and Knowledge discovery, pp. 757–760 (2012)
55.
Zurück zum Zitat Domadiya, N.H., Rao, U.P.: Hiding Sensitive Association Rules to Maintain Privacy and Data Quality in Database. (2013) Domadiya, N.H., Rao, U.P.: Hiding Sensitive Association Rules to Maintain Privacy and Data Quality in Database. (2013)
56.
Zurück zum Zitat Modi, C.N., Rao, U.P., Patel, D.R.: Maintaining privacy and data quality in privacy preserving association rule mining. In: proceedings of International Conference on Computing, Communication and Networking Technologies, (2010) Modi, C.N., Rao, U.P., Patel, D.R.: Maintaining privacy and data quality in privacy preserving association rule mining. In: proceedings of International Conference on Computing, Communication and Networking Technologies, (2010)
57.
Zurück zum Zitat Li, L., Lu, R., Choo, K.K.R., Datta, A., Shao, J.: Privacy-preserving outsourced association rule mining on vertically partitioned databases. IEEE Trans. Inf. Forensics Secur. 11(8), 1847–1861 (2016)CrossRef Li, L., Lu, R., Choo, K.K.R., Datta, A., Shao, J.: Privacy-preserving outsourced association rule mining on vertically partitioned databases. IEEE Trans. Inf. Forensics Secur. 11(8), 1847–1861 (2016)CrossRef
58.
Zurück zum Zitat Dehkordi, M.N., Badie, K., Zadeh, A.K.: A novel method for privacy preserving in association rule mining based on genetic algorithms. J. Softw. 4(6), 555–562 (2009)CrossRef Dehkordi, M.N., Badie, K., Zadeh, A.K.: A novel method for privacy preserving in association rule mining based on genetic algorithms. J. Softw. 4(6), 555–562 (2009)CrossRef
59.
Zurück zum Zitat Rajalaxmi, R.R.: A novel sanitization approach for privacy preserving utility itemset mining. Comput. Inf. Sci. 1(2), 77 (2008) Rajalaxmi, R.R.: A novel sanitization approach for privacy preserving utility itemset mining. Comput. Inf. Sci. 1(2), 77 (2008)
60.
Zurück zum Zitat Ravi, A.T., Chitra, S.: privacy preserving data mining using differential evolution—artificial bee colony algorithm. Int. J. Appl. Eng. Res. 9(23), 21575–21584 (2014) Ravi, A.T., Chitra, S.: privacy preserving data mining using differential evolution—artificial bee colony algorithm. Int. J. Appl. Eng. Res. 9(23), 21575–21584 (2014)
61.
Zurück zum Zitat Tomar, A., Dubey, A.K., Richhariya, V.: Novel Sensitive Information Preserving Mining (SIPM) algorithm for association rule mining in centralized database. In: International Conference on Emerging Trends in Networks and Computer Communications (ETNCC), Udaipur, pp. 392–397 (2011) Tomar, A., Dubey, A.K., Richhariya, V.: Novel Sensitive Information Preserving Mining (SIPM) algorithm for association rule mining in centralized database. In: International Conference on Emerging Trends in Networks and Computer Communications (ETNCC), Udaipur, pp. 392–397 (2011)
62.
Zurück zum Zitat Tian, Y., Liu, D., Yuan, D., Wang, K.: A discrete PSO for two-stage assembly scheduling problem. Int. J. Adv. Manuf. Technol. 66(1–4), 481–499 (2013)CrossRef Tian, Y., Liu, D., Yuan, D., Wang, K.: A discrete PSO for two-stage assembly scheduling problem. Int. J. Adv. Manuf. Technol. 66(1–4), 481–499 (2013)CrossRef
Metadaten
Titel
Lossless and robust privacy preservation of association rules in data sanitization
verfasst von
Geeta S. Navale
Suresh N. Mali
Publikationsdatum
08.03.2018
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe Sonderheft 1/2019
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-018-2176-1

Weitere Artikel der Sonderheft 1/2019

Cluster Computing 1/2019 Zur Ausgabe