IDEAS home Printed from https://ideas.repec.org/a/ids/ijdmmm/v6y2014i3p285-311.html
   My bibliography  Save this article

Data transformation techniques for preserving privacy in distance-based mining algorithms

Author

Listed:
  • Mohammad Ali Kadampur
  • D.V.L.N. Somayajulu

Abstract

Dissimilarity calculation between two objects is one of the important knowledge gathering methods in cognition science. Many data mining algorithms explore dissimilarity computation to cluster the data in order to know intra-relations, inter-relations, and outliers in the data. Majority of these algorithms use Euclidean distance as the dissimilarity criterion. In this paper, signal transformation functions, with their orthogonal property and energy compaction features are explored in transforming the data. The data transformation scheme considers entire data as a single entity. The proposed scheme is designed such that it can be used even for the non-Euclidean space by using the distance mapping algorithm. The existing randomisation approaches for data transformation maintain only the distributions and do not maintain the Euclidean distance between the records. The proposed methods are superior to the existing methods in terms of run time complexity O(n) and preservation of distance between individual data points.

Suggested Citation

  • Mohammad Ali Kadampur & D.V.L.N. Somayajulu, 2014. "Data transformation techniques for preserving privacy in distance-based mining algorithms," International Journal of Data Mining, Modelling and Management, Inderscience Enterprises Ltd, vol. 6(3), pages 285-311.
    • Handle: RePEc:ids:ijdmmm:v:6:y:2014:i:3:p:285-311
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=65148
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijdmmm:v:6:y:2014:i:3:p:285-311. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=342 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.