Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/307104
Title: | Design and implementation of an efficient technique for Privacy Preserving in Data Mining |
Researcher: | Shivani Sharma |
Guide(s): | Sachin Ahuja and Roopali Garg |
Keywords: | Computer Science Computer Science Artificial Intelligence Engineering and Technology |
University: | Chitkara University, Punjab |
Completed Date: | 2020 |
Abstract: | Nowadays, large amount of data is being published on the internet by numerous users newlinespecifically, for the purpose of business, research, public health and so on. As the data is newlinepublished online and can be freely accessed through internet resources therefore this can lead to newlinethe risk of leaking the private information. This information is easily accessible, along with newlineincreased reporting power to attackers and creates a serious problem. To overcome this problem, newlinevarious researchers have proposed techniques to resolve the privacy challenges that arise day by newlineday due to the increasing social networking trends in people. In organizations and industries, newlinepersonal information of employees forms the major portion of the data that is stored in the form newlineof large databases and at times available over the network. In the proposed work, we have newlineaddressed the security aspects of such databases. Due to the rising popularity of social newlinenetworking sites there is also increased risk of distribution of the user s personal information newlinethrough neighbouring nodes in network. By which the demand of privacy preservation is newlineincreased. The privacy preservation is the most important challenge of social networks where newlineinformation theft instances are very common. The proposed approach mainly focuses on the newlineprotection of secret information by utilizing the K-anonymity. The current approach is newlinebased on the enhancement of K-anonymity through focusing at node level (L) to resolve the newlinechallenges of privacy protection. In this approach the sensitive nodes are identified followed by newlineoptimization. This study examines K-anonymity on two different datasets in terms of average newlinepath length and information loss. The performance of this work has been analyzed in two phases. newlineIn first phase author applied the optimizer Artificial Bee Colony combining with classifier newlineArtificial Neural Network (ANN). In second phase the optimization and classification approach newlinewere implemented using Cuckoo Search (CS) and Support Vector Machines (SVM). The newlineoutcomes of this wo |
Pagination: | |
URI: | http://hdl.handle.net/10603/307104 |
Appears in Departments: | Faculty of Computer Science |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01 title page.pdf | Attached File | 7.09 kB | Adobe PDF | View/Open |
02 certificate by the supervisor.pdf | 255.96 kB | Adobe PDF | View/Open | |
03 preliminary pages.pdf | 406.57 kB | Adobe PDF | View/Open | |
04 abstract.pdf | 87.72 kB | Adobe PDF | View/Open | |
05 introduction.pdf | 464.35 kB | Adobe PDF | View/Open | |
06 literature survey.pdf | 171.13 kB | Adobe PDF | View/Open | |
07 objectives and methodology.pdf | 1.37 MB | Adobe PDF | View/Open | |
09 references.pdf | 334.56 kB | Adobe PDF | View/Open | |
80_recommendation.pdf | 101.21 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: