TONIC: Target Oriented Network Intelligence Collection for the Social Web

In this paper we introduce the Target Oriented Network Intelligence Collection (TONIC) problem, which is the problem of finding profiles in a social network that contain information about a given target via automated crawling. We formalize TONIC as a search problem and a best-first approach is proposed for solving it. Several heuristics are presented to guide this search. These heuristics are based on the topology of the currently known part of the social network. The efficiency of the proposed heuristics and the effect of the graph topology on their performance is experimentally evaluated on the Google+ social network.

[1]  Jie Tang,et al.  A Combination Approach to Web User Profiling , 2010, TKDD.

[2]  Rami Puzis,et al.  Potential Search: A Bounded-Cost Search Algorithm , 2011, ICAPS.

[3]  Christos Faloutsos,et al.  Parallel crawling for online social networks , 2007, WWW '07.

[4]  Adam Domanski,et al.  Universal Web Pages Content Parser , 2012, CN.

[5]  George Danezis,et al.  Prying Data out of a Social Network , 2009, 2009 International Conference on Advances in Social Network Analysis and Mining.

[6]  Meir Kalech,et al.  Finding patterns in an unknown graph , 2012, AI Commun..

[7]  Jaana Kekäläinen,et al.  Cumulated gain-based evaluation of IR techniques , 2002, TOIS.

[8]  Khaled Shaalan,et al.  A Survey of Web Information Extraction Systems , 2006, IEEE Transactions on Knowledge and Data Engineering.

[9]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[10]  Rajeev Motwani,et al.  Link Privacy in Social Networks , 2008, ICDE.

[11]  Lior Rokach,et al.  Predicting Student Exam's Scores by Analyzing Social Network Data , 2012, AMT.

[12]  F ShaalanKhaled,et al.  A Survey of Web Information Extraction Systems , 2006 .

[13]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[14]  Rami Puzis,et al.  Link Prediction in Social Networks Using Computationally Efficient Topological Features , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[15]  Armin B. Cremers,et al.  Security and Privacy in Social Networks , 2014, Springer New York.

[16]  Mark Levene,et al.  Search Engines: Information Retrieval in Practice , 2011, Comput. J..

[17]  Stefan Edelkamp,et al.  Cost-Algebraic Heuristic Search , 2005, AAAI.

[18]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[19]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[20]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[21]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.