A Slicing Founded Consistency Quantity for Clusters

Authors

  • P Sathiyakala
  • G Baskaran

Keywords:

Facts Anonymization, Privacy Preservation, Facts Mining, Slicing

Abstract

Numerous procedures and methods consume been planned in recent years for the publication of sensitive microdata. However, there is a trade-OFF to be measured amongst the level of privacy offered and the usefulness of the obtainable data. Recently, slicing was planned as a unique method for cumulative the usefulness of an anonymized obtainable dataset by separating the dataset vertically and horizontally. This effort proposes a unique method to upsurge the usefulness of a communal dataset even additional by permitting touched gathering though maintaining the prevention of association disclosure. It is additional exposed that by incomes of a process to mondrian upsurges the competence of slicing. This paper displays though work weight trials that these improvements help preserve facts usefulness healthier than outdated slicing.

References

Halboob, W. ; Center of Excellence in Inf. Assurance, King Saud Univ., Riyadh, Saudi Arabia ; Abulaish, M. ; Alghathbar, K.S., “Quaternary privacy-levels preservation in computer forensics investigation process”, Published in: Internet Technology and Secured Transactions (ICITST), 2011 International Conference for Date of Conference: 11-14 Dec. 2011 Page(s): 777 – 782.

Komishani, E.G. ; Fac. of Electr. & Comput. Eng., Tarbiat Modares Univ., Tehran, Iran ; Abadi, M., “A generalization-based approach for personalized privacy preservation in trajectory data publishing”, Published in: Telecommunications (IST), 2012 Sixth International Symposium on Date of Conference: 6-8 Nov. 2012 Page(s): 1129 – 1135.

Tiancheng Li ; Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN ; Ninghui Li, “Injector: Mining Background Knowledge for Data Anonymization”, Published in :Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on Date of Conference: 7-12 April 2008 Page(s): 446 – 455.

Gaofeng Zhang ; Fac. of Inf. & Commun. Technol., Swinburne Univ. of Technol. Hawthorn, Melbourne, VIC, Australia ; Yun Yang ; Xuyun Zhang ; Chang Liu, “Key Research Issues for Privacy Protection and Preservation in Cloud Computing”, Published in: Cloud and Green Computing (CGC), 2012 Second International Conference on Date of Conference: 1-3 Nov. 2012 Page(s): 47 – 54.

Sochor, T. ; Dept. of Comput. Sci., Univ. of Ostrava, Ostrava, Czech Republic, “Fuzzy control of configuration of web anonymization using TOR”, Published in: Technological Advances in Electrical, Electronics and Computer Engineering (TAEECE), 2013 International Conference on Date of Conference: 9-11 May 2013 Page(s): 115 – 120.

Grunbaum, R. ; ABB AB, Baden-Dättwil, Switzerland ; Rasmussen, J., “FACTS for cost-effective improvement of power feeding of large mining complexes”, Published in: IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society Date of Conference: 25-28 Oct. 2012 Page(s): 1295 – 1300.

Grunbaum, R. ; ABB AB, Västerås, Sweden ; Willemsen, N., “Facts for voltage stability and power quality improvement in mining”, Published in: Electricity Distribution (CIRED 2013), 22nd International Conference and Exhibition on Date of Conference: 10-13 June 213 Page(s): 1 – 4.

Zhen Zhu ; State Key Lab. of Remote Sensing Sci., Beijing Normal Univ., Beijing, China ; Wuming Zhang ; Ling Zhu ; Jmg Zhao, “Research on different slicing methods of acquiring LAI from terrestrial laser scanner data”, Published in: Spatial Data Mining and Geographical Knowledge Services (ICSDM), 2011 IEEE International Conference on Date of Conference: June 29 2011-July 1 2011 Page(s): 295 – 299.

Binkley, D. ; Loyola Coll., Baltimore, MD ; Danicic, S. ; Gyimothy, T. ; Harman, M., “Formalizing executable dynamic and forward slicing”, Published in: Source Code Analysis and Manipulation, 2004. Fourth IEEE International Workshop on Date of Conference: 16-16 Sept. 2004 Page(s): 43 – 52.

Takada, T. ; Dept. of Informatics, Osaka Univ., Japan ; Ohata, F. ; Inoue, K., “Dependence-cache slicing: a program slicing method using lightweight dynamic information”, Published in: Program Comprehension, 2002. Proceedings. 10th International Workshop on Date of Conference: 2002 Page(s): 169 – 177.

Downloads

Published

2015-05-30

How to Cite

[1]
P. Sathiyakala and G. Baskaran, “A Slicing Founded Consistency Quantity for Clusters”, Int. J. Comp. Sci. Eng., vol. 3, no. 5, pp. 21–25, May 2015.

Issue

Section

Research Article