Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Privacy Preserving Link Analysis on Dynamic Weighted Graph

Privacy Preserving Link Analysis on Dynamic Weighted Graph Link analysis algorithms have been used successfully on hyperlinked data to identify authoritative documents and retrieve other information. They also showed great potential in many new areas such as counterterrorism and surveillance. Emergence of new applications and changes in existing ones created new opportunities, as well as difficulties, for them: (1) In many situations where link analysis is applicable, there may not be an explicit hyperlinked structure. (2) The system can be highly dynamic, resulting in constant update to the graph. It is often too expensive to rerun the algorithm for each update. (3) The application often relies heavily on client-side logging and the information encoded in the graph can be very personal and sensitive. In this case privacy becomes a major concern. Existing link analysis algorithms, and their traditional implementations, are not adequate in face of these new challenges. In this paper we propose the use of a weighted graph to define and/or augment a link structure. We present a generalized HITS algorithm that is suitable for running in a dynamic environment. The algorithm uses the idea of “lazy update” to amortize cost across multiple updates while still providing accurate ranking to users in the mean time. We prove the convergence of the new algorithm and evaluate its benefit using the Enron email dataset. Finally we devise a distributed implementation of the algorithm that preserves user privacy thus making it socially acceptable in real-world applications. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Computational and Mathematical Organization Theory Springer Journals

Privacy Preserving Link Analysis on Dynamic Weighted Graph

Download PDF
19 pages

Loading next page...
 
/lp/springer-journal/privacy-preserving-link-analysis-on-dynamic-weighted-graph-zSGz7jCjaK

References (26)

Publisher
Springer Journals
Copyright
Copyright © 2005 by Springer Science + Business Media, Inc.
Subject
Business and Management; Management; Operation Research/Decision Theory; Artificial Intelligence (incl. Robotics); Sociology, general; Methodology of the Social Sciences
ISSN
1381-298X
eISSN
1572-9346
DOI
10.1007/s10588-005-3941-2
Publisher site
See Article on Publisher Site

Abstract

Link analysis algorithms have been used successfully on hyperlinked data to identify authoritative documents and retrieve other information. They also showed great potential in many new areas such as counterterrorism and surveillance. Emergence of new applications and changes in existing ones created new opportunities, as well as difficulties, for them: (1) In many situations where link analysis is applicable, there may not be an explicit hyperlinked structure. (2) The system can be highly dynamic, resulting in constant update to the graph. It is often too expensive to rerun the algorithm for each update. (3) The application often relies heavily on client-side logging and the information encoded in the graph can be very personal and sensitive. In this case privacy becomes a major concern. Existing link analysis algorithms, and their traditional implementations, are not adequate in face of these new challenges. In this paper we propose the use of a weighted graph to define and/or augment a link structure. We present a generalized HITS algorithm that is suitable for running in a dynamic environment. The algorithm uses the idea of “lazy update” to amortize cost across multiple updates while still providing accurate ranking to users in the mean time. We prove the convergence of the new algorithm and evaluate its benefit using the Enron email dataset. Finally we devise a distributed implementation of the algorithm that preserves user privacy thus making it socially acceptable in real-world applications.

Journal

Computational and Mathematical Organization Theory – Springer Journals

Published: Jan 1, 2005

There are no references for this article.