Nearest neighbor tour circuit encryption algorithm based random laplacian eigenmap

  • Wei L
  • Xun L
  • 1


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


This paper presents nearest neighbor tour circuit encryption algorithm based random Laplacian Eigenmap. In order to be suited for privacy-p reserving classification, we first alter the selection fashion of the parameters nearest neighbor number k, embedded space dimension d and heat kernel factor t of Laplacian Eigenmap algorithm. Further we embed the tourists' sensitive attribution into random dimension (even higher) space using random Laplacian Eigenmap, thus the sensitive attributes are encrypted and protected. Because the transformed space dimension d and the nearest neighbor number k are both random, this algorithm is not easily be breached. In addition, Laplacian Eigenmap can keep topology structure of dataset, so the precision of classification after encryption are not affected. The experiment show that the present method can provide tourists' sensitive information enough protect, and it also give the tourist appropriate tour circuit.

Author-supplied keywords

  • Encryption
  • Nearest neighbor
  • Random laplacian eigenmap
  • Sensitive information
  • Topology structure

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Lu Wei

  • Liao Xun

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free