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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brin, S. and L. Page (1998), “The Anatomy of a Large-Scale Hypertextual Web Search Engine”, in 7th World Wide Web Conference, Brisbane, Australia.
Canny, J. (2002), “Collaborative Filtering with Privacy”, in IEEE Symposium on Security and Privacy, Oakland, CA, U.S.A, pp. 45–57
Canny, J. and S. Sorkin (2004), “Practical Large-Scale Distributed Key Generation”, Eurocrypt 2004.
Carriere, J. and R. Kazman (1997), “WebQuery: Searching and Visualizing the Web through Connectivity”, in Proceedings of the International WWW Conference.
Chakrabarti, S., B. Dom, D. Gibson, J. Kleinberg, P. Raghavan, and S. Rajagopalan (1998), “Automatic Resource List Compilation by Analyzing Hyperlink Structure and Associated Text”, in Proceedings of the 7th International World Wide Web Conference.
Cohen, W.W. (2005), Enron Email Dataset, http://www-2.cs.cmu.edu/~enron/.
Corrada-Emmanuel, A. (2005), Enron Email Dataset Research, http://ciir.cs.umass.edu/~corrada/enron/.
Fouque, P. and J. Stern (2001), “One Round Threshold Discrete-Log Key Generation without Private Channels”, Public Key Cryptography, pp. 300–316.
Gennaro, R., S. Jarecki, H. Krawczyk, and T. Rabin (1999), “Secure Distributed Key Generation for Discrete-Log Based Cryptosystems”, Lecture Notes in Computer Science, 1592, 295–310.
Golub, G.H. and C.F. Van Loan (1989), Matrix Computations. Johns Hopkins University Press.
Kautz, H., B. Selman, and A. Milewski (1996), “Agent Amplified Communication”, AAAI-96, Portland, Oregon, MIT Press, Cambridge, MA, 3–9.
Kautz, H., B. Selman, and M. Shah (1997), “Combining Social Networks and Collaborative Filtering”, Communications of ACM, 40(3), 63–65.
Kleinberg, J.M. (1999), “Authoritative Sources in a Hyperlinked Environment”, Journal of the ACM, 46(5), 604–632.
MacDonald, D.W. and M.S. Ackerman (1998), “Just Talk to Me: A Field Study of Expertise Location”, in ACM CSCW-98, pp. 315—324.
Newell, A. and P.S. Rosenbloom (1981), “Mechanisms of Skill Acquisition and the Law of Practice”, in J.R. Anderson (Ed.), Cognitive Skills and their Acquisition, Hillsdale, NJ: Earlbaum, pp. 1–55.
Ng, A.Y., A.X. Zheng, and M.I. Jordan (2001a), “Link Analysis, Eigenvectors and Stability”, in Proceedings of the 17th International Joint Conference on Artificial Intelligence, Seattle, Washington, United States, pp. 903–910.
Ng, A.Y., A.X. Zheng, and M.I. Jordan (2001b), “Stable Algorithms for Link Analysis”, in Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New Orleans, Louisiana, United States, pp. 258–266.
Pedersen, T. (1991), “A Threshold Cryptosystem without a Trusted Party”, in Proceedings of EUROCRYPT ’91, Springer-Verlag LNCS, vol. 547, pp. 522–526.
Pirolli, P., J. Pitkow, and R. Rao (1996), “Silk from a Sow's Ear: Extracting Usable Structures from the Web”, in Proceedings of ACM Conference on Human Factors in Computing Systems, ACM Press.
Polak, E. (1971), Computational Methods in Optimization. Academic Press.
Schwartz, M.F. and D.C.M. Wood (1993), “Discovering Shared Interests Using Graph Analysis”, Communications of ACM, 36(8), 78–89.
Salton, G. (1989), Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley.
Stewart, G.W. and J. Sun (1990), Matrix Perturbation Theory. Academic Press.
Strang, G. (1980), Linear Algebra and Its Applications, 2nd edition. Academic Press.
Author information
Authors and Affiliations
Corresponding author
Additional information
This material is based upon work supported by the National Science Foundation under Grant No. 0222745.
Part of this work was presented at the SDM05 Workshop on Link Analysis in Newport Beach, California, April 2005.
Yitao Duan is a Ph.D. candidate in Computer Science at the University of California, Berkeley. His research interests include practical privacy enhancing technologies for a variety of situations including: ubiquitous computing, collaborative work, smart spaces, and location-aware services etc. His research goal is to develop provably strong (cryptographic and information-theoretic) protocols that are practically realizable. He received his B.S. and M.S. in Mechanical Engineering from Beijing University of Aeronautics and Astronautics, China in 1994 and 1997.
Jingtao Wang is a Ph.D. student in Computer Science at the University of California, Berkeley. His research interests include context-aware computing, novel end-user interaction techniques and statistical machine learning. He was a research member, later a staff research member and team lead at IBM China Research Lab from 1999 to 2002, working on online handwriting recognition technologies for Asian languages. He received his B.E. and M.E. in electrical and computer engineering from Xi'an Jiaotong University, China in 1996 and 1999. He is a member of the ACM and ACM SIGCHI since 2000.
Matthew Kam is a Ph.D. student in computer science at the University of California, Berkeley working on educational technology and human-computer interaction for low-income communities in developing regions. He received a B.A. in economics and a B.S. in Electrical Engineering and Computer Sciences, also from Berkeley. He is a member of the ACM and Engineers for a Sustainable World.
John Canny is the Paul and Stacy Jacobs Distinguished Professor of Engineering in Computer Science at the University of California, Berkeley. His research is in human-computer interaction, with an emphasis on modeling methods and privacy approaches using cryptography. He received his Ph.D. in 1987 at the MIT AI Lab. His dissertation on Robot Motion Planning received the ACM dissertation award. He received a Packard Foundation Faculty Fellowship and a Presidential Young Investigator Award. His peer-reviewed publications span robotics, computational geometry, physical simulation, computational algebra, theory and algorithms, information retrieval, HCI and CSCW and cryptography.
Rights and permissions
About this article
Cite this article
Duan, Y., Wang, J., Kam, M. et al. Privacy Preserving Link Analysis on Dynamic Weighted Graph. Comput Math Organiz Theor 11, 141–159 (2005). https://doi.org/10.1007/s10588-005-3941-2
Issue Date:
DOI: https://doi.org/10.1007/s10588-005-3941-2