
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sudipto Das, Ömer Eğecioğlu, Amr El Abbadi, "Anónimos: An LPBased Approach for Anonymizing Weighted Social Network Graphs," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 4, pp. 590604, April, 2012.  
BibTex  x  
@article{ 10.1109/TKDE.2010.267, author = {Sudipto Das and Ömer Eğecioğlu and Amr El Abbadi}, title = {Anónimos: An LPBased Approach for Anonymizing Weighted Social Network Graphs}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {24}, number = {4}, issn = {10414347}, year = {2012}, pages = {590604}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.267}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Anónimos: An LPBased Approach for Anonymizing Weighted Social Network Graphs IS  4 SN  10414347 SP590 EP604 EPD  590604 A1  Sudipto Das, A1  Ömer Eğecioğlu, A1  Amr El Abbadi, PY  2012 KW  Anonymization KW  social networks KW  shortest paths KW  linear programming. VL  24 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] Y.Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, "Analysis of Topological Characteristics of Huge Online Social Networking Services," Proc. 16th Int'l Conf. World Wide Web (WWW), pp. 835844, 2007.
[2] L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, "Group Formation in Large Social Networks: Membership, Growth, and Evolution," Proc. 12th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp. 4454, 2006.
[3] A. Mislove, M. Marcon, K.P. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and Analysis of Online Social Networks," Proc. Seventh ACM SIGCOMM Conf. Internet Measurement (IMC), pp. 2942, 2007.
[4] M.K. Sparrow, "The Application of Network Analysis to Criminal Intelligence: An Assessment of the Prospects," Social Networks, vol. 13, pp. 251274, 1991.
[5] S. AmerYahia, L.V.S. Lakshmanan, and C. Yu, "Socialscope: Enabling Information Discovery on Social Content Sites," Proc. Conf. Innovative Data Systems Research (CIDR), 2009.
[6] S. Hill, F. Provost, and C. Volinsky, "NetworkBased Marketing: Identifying Likely Adopters via Consumer Networks," Statistical Science, vol. 22, no. 2, pp. 256275, 2006.
[7] L. Getoor and C.P. Diehl, "Link Mining: A Survey," SIGKDD Explorations Newsletter, vol. 7, no. 2, pp. 312, 2005.
[8] L. Backstrom, C. Dwork, and J. Kleinberg, "Wherefore Art Thou R3579X?: Anonymized Social Networks, Hidden Patterns, and Structural Steganography," Proc. Int'l Conf. World Wide Web (WWW), pp. 181190, 2007.
[9] A. Korolova, R. Motwani, S. Nabar, and Y. Xu, "Link Privacy in Social Networks," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE), pp. 13551357, 2008.
[10] A. Campan and T.M. Truta, "A Clustering Approach for Data and Structural Anonymity in Social Networks," Proc. Privacy, Security, and Trust in KDD Workshop (PinKDD), pp. 110, 2008.
[11] G. Cormode, D. Srivastava, S. Bhagat, and B. Krishnamurthy, "ClassBased Graph Anonymization for Social Network Data," Proc. Very Large Databases Endowment, vol. 2, no. 1, pp. 766777, 2009.
[12] G. Cormode, D. Srivastava, T. Yu, and Q. Zhang, "Anonymizing Bipartite Graph Data Using Safe Groupings," Proc. Very Large Databases Endowment, vol. 1, no. 1, pp. 833844, 2008.
[13] M. Hay, G. Miklau, D. Jensen, D. Towsley, and P. Weis, "Resisting Structural ReIdentification in Anonymized Social Networks," Proc. Very Large Databases Endowment, vol. 1, no. 1, pp. 102114, 2008.
[14] K. Liu and E. Terzi, "Towards Identity Anonymization on Graphs," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 93106, 2008.
[15] B. Zhou and J. Pei, "Preserving Privacy in Social Networks against Neighborhood Attacks," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE), pp. 506515, 2008.
[16] L. Zou, L. Chen, and M.T. Özsu, "KAutomorphism: A General Framework for Privacy Preserving Network Publication," Proc. Very Large Databases Endowment, vol. 2, no. 1, pp. 946957, 2009.
[17] J.M. Kumpula, J.P. Onnela, J. Saramaki, K. Kaski, and J. Kertesz, "Emergence of Communities in Weighted Networks," Physical Rev. Letters, vol. 99, pp. 228 7011228 7014, 2007.
[18] R. Toivonen, J.M. Kumpula, J. Saramäki, J.P. Onnela, J. Kertész, and K. Kaski, "The Role of Edge Weights in Social Networks: Modelling Structure and Dynamics," Noise and Stochastics in Complex Systems and Finance, vol. 6601, no. 1, pp. B1B8, 2007.
[19] D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the Spread of Influence through a Social Network," Proc. Ninth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp. 137146, 2003.
[20] E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, pp. 269271, 1959.
[21] J.B. Kruskal, "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem," Proc. the Am. Math. Soc., vol. 7, no. 1,pp. 4850, Feb. 1956.
[22] J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su, "Arnetminer: Extraction and Mining of Academic Social Networks," Proc. 14th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp. 990998, 2008.
[23] M. Stoer and F. Wagner, "A Simple MinCut Algorithm," J. ACM, vol. 44, no. 4, pp. 585591, 1997.
[24] A.M. Gibbons, Algorithmic Graph Theory. Cambridge Univ. Press, 1985.
[25] E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. CS Press, 1978.
[26] S. Das, Ömer Eğecioğlu, and A. El Abbadi, "Anonymizing Weighted Social Network Graphs," Proc. IEEE 26th Int'l Conf. Data Eng. (ICDE), pp. 904907, 2010.
[27] L. Sweeney, "kAnonymity: A Model for Protecting Privacy," Int'l J. Uncertainty Fuzziness and KnowledgeBased Systems, vol. 10, no. 5, pp. 557570, 2002.
[28] C. Spearman, "The Proof and Measurement of Association between Two Things," Am. J. Psychology, vol. 15, pp. 72101, Feb. 1904.
[29] C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, p. 173. Dover, 1998.
[30] R.W. Floyd, "Algorithm 97: Shortest Path," Comm. ACM, vol. 5, no. 6, p. 345, 1962.
[31] LPSolve 5.5, http://lpsolve.sourceforge.net5.5/, 2011.
[32] K. Liu, K. Das, T. Grandison, and H. Kargupta, PrivacyPreserving Data Analysis on Graphs and Social Networks, Chapter 21, pp. 419437. CRC Press, Dec. 2008.
[33] X. Wu, X. Ying, K. Liu, and L. Chen, A Survey of Algorithms for PrivacyPreservation of Graphs and Social Networks, ser. Managing and Mining Graph Data, Chapter 14, pp. 421454. Kluwer Academic Publishers, Mar. 2010.
[34] X. Ying and X. Wu, "Randomizing Social Networks: A Spectrum Preserving Approach," Proc. Eighth SIAM Conf. Data Mining, pp. 739750, 2008.
[35] E. Zheleva and L. Getoor, "Preserving the Privacy of Sensitive Relationships in Graph Data," Proc. First ACM SIGKDD Int'l Conf. Privacy, Security, and Trust in KDD (PinKDD), pp. 153171, 2007.
[36] L. Liu, J. Wang, J. Liu, and J. Zhang, "Privacy Preservation in Social Networks with Sensitive Edge Weights," Proc. SIAM Int'l Conf. Data Mining (SDM), pp. 954965, 2009.