Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/7098
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhat, T.P.
dc.contributor.authorKarthik, C.
dc.contributor.authorChandrasekaran, K.
dc.date.accessioned2020-03-30T09:58:30Z-
dc.date.available2020-03-30T09:58:30Z-
dc.date.issued2015
dc.identifier.citationProcedia Computer Science, 2015, Vol.54, , pp.422-430en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/7098-
dc.description.abstractTraditional approaches to data mining may perform well on extraction of information necessary to build a classification rule useful for further categorisation in supervised classification learning problems. However most of the approaches require fail to hide the identity of the subject to whom the data pertains to, and this can cause a big privacy breach. This document addresses this issue by the use of a graph theoretical approach based on k-partitioning of graphs, which paves way to creation of a complex decision tree classifier, organised in a prioritised hierarchy. Experimental results and analytical treatment to justify the correctness of the approach are also included. � 2015 The Authors.en_US
dc.titleA Privacy Preserved Data Mining Approach Based on k-Partite Graph Theoryen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.