Database Reference
In-Depth Information
39. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular
graphs. SIAM Journal of Scientific Computing, 20(1):359-392, 1998.
40. A. Katsarou, A. Gkoulalas-Divanis, and V. S. Verykios. Reconstruction-based classification
rule hiding through controlled data modification. In Proceedings of the 5th IFIP Conference
on Artificial Intelligence Applications and Innovations (AIAI), 2009.
41. R.
Kohavi,
C.
Brodley,
B.
Frasca,
L.
Mason,
and
Z.
Zheng.
KDD-Cup
2000
organizers'
report:
Peeling
the
onion.
SIGKDD
Explorations,
2(2):86-98,
2000.
http://www.ecn.purdue.edu/KDDCUP.
42. G. Lee, C. Y. Chang, and A. L. P. Chen. Hiding sensitive patterns in association rules mining.
In Proceedings of the 28th International Computer Software and Applications Conference
(COMPSAC), pages 424-429, 2004.
43. Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3):36-54,
2000.
44. D. Luenberger. Introduction to Linear and Non-Linear Programming. Addison-Wesley, 1973.
45. M. D. Mailman, M. Feolo, and Y. J. et. al. The ncbi dbgap database of genotypes and pheno-
types. Nature Genetics, 39:1181-1186, 2007.
46. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discov-
ery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
47. S. Menon, S. Sarkar, and S. Mukherjee. Maximizing accuracy of shared databases when
concealing sensitive patterns. Information Systems Research, 16(3):256-270, 2005.
48. T. Mielikainen. On inverse frequent set mining. In Proceedings of the 2nd Workshop on
Privacy Preserving Data Mining, pages 18-23, 2003.
49. M. Morgenstern. Controlling logical inference in multilevel database systems. In Proceedings
of the IEEE Symposium on Security and Privacy, pages 245-255, 1988.
50. G. V. Moustakides and V. S. Verykios. A max-min approach for hiding frequent itemsets. In
Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM),
pages 502-506, 2006.
51. G. V. Moustakides and V. S. Verykios. A maxmin approach for hiding frequent itemsets. Data
and Knowledge Engineering, 65(1):75-89, 2008.
52. J. Natwichai, X. Li, and M. Orlowska. Hiding classification rules for data sharing with privacy
preservation. In Proceedings of the 7th International Conference on Data Warehousing and
Knowledge Discovery (DAWAK), pages 468-477, 2005.
53. J. Natwichai, X. Li, and M. Orlowska.
A reconstruction-based algorithm for classiciation
rules hiding.
In Proceedings of the 17th Australasian Database Conference (ADC), pages
49-58, 2006.
54. S. R. M. Oliveira and O. R. Zaïane. Privacy preserving frequent itemset mining. In Pro-
ceedings of the 2002 IEEE International Conference on Privacy, Security and Data Mining
(CRPITS), pages 43-54, 2002.
55. S. R. M. Oliveira and O. R. Zaïane. Protecting sensitive knowledge by data sanitization. In
Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM), pages 211-
218, 2003.
56. S. R. M. Oliveira and O. R. Zaïane. Achieving privacy preservation when sharing data for
clustering. In Proceedings of the 2004 SIAM International Conference on Data Mining (SDM),
2004.
57. S. R. M. Oliveira and O. R. Zaïane. Privacy-preserving clustering by object similarity-based
representation and dimensionality reduction transformation. In Proceedings of the 2nd IEEE
International Conference on Data Mining (ICDM), pages 21-30, 2004.
58. E. Pontikakis, Y. Theodoridis, A. Tsitsonis, L. Chang, and V. S. Verykios. A quantitative and
qualitative analysis of blocking in association rule hiding. In Proceedings of the 2004 ACM
Workshop on Privacy in the Electronic Society (WPES), pages 29-30, 2004.
59. E. D. Pontikakis, A. A. Tsitsonis, and V. S. Verykios. An experimental study of distortion-
based techniques for association rule hiding. In Proceedings of the 18th Conference on
Database Security (DBSEC), pages 325-339, 2004.
