Privacy Preserving Link Analysis on Dynamic Weighted Graph
Yitao Duan (),
Jingtao Wang (),
Matthew Kam () and
John Canny ()
Additional contact information
Yitao Duan: University of California at Berkeley
Jingtao Wang: University of California at Berkeley
Matthew Kam: University of California at Berkeley
John Canny: University of California at Berkeley
Computational and Mathematical Organization Theory, 2005, vol. 11, issue 2, No 4, 159 pages
Abstract:
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.
Keywords: link analysis; data mining; text analysis; privacy; HITS; graph algorithms; lazy update (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10588-005-3941-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:comaot:v:11:y:2005:i:2:d:10.1007_s10588-005-3941-2
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10588
DOI: 10.1007/s10588-005-3941-2
Access Statistics for this article
Computational and Mathematical Organization Theory is currently edited by Terrill Frantz and Kathleen Carley
More articles in Computational and Mathematical Organization Theory from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().