Abstract
Marketing is most successful when people spread the message within their social network. The Internet can serve as an approximation of the spread of messages, particularly marketing campaigns, to both measure marketing effectiveness and provide data for influencing future efforts. However, to measure the network of web sites spreading the marketing message potentially requires a massive amount of data collection over a long period of time. Additionally, collecting data from the Internet is very noisy and can create a false sense of precision. Therefore, we propose to use ego-centric network sampling to both reduce the amount of data required to collect as well as handle the inherent uncertainty of the data collected. In this the book chapter, we study whether the proposed ego-centric network sampling accurately captures the network structure.We use the Stanford-Berkeley network to show that the approach can capture the underlying structure with a minimal amount of data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Yossef, Z., Mashiach, L.T.: Local approximation of pagerank and reverse pagerank. In: CIKM 2008: Proceeding of the 17th ACM conference on Information and knowledge management, pp. 279–288. ACM, New York (2008), http://doi.acm.org/10.1145/1458082.1458122
Bharat, K., Chang, B.W., Henzinger, M.R., Ruhl, M.: Who links to whom: Mining linkage between web sites. In: Proceedings of the IEEE International Conference on Data Mining (2001)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998), http://dx.doi.org/10.1016/S0169-75529800110-X
Domingos, P.: Mining social networks for viral marketing. IEEE Intelligent Systems 20(1), 80–82 (2005)
Faloutsos, J.L.C.: Sampling from large graphs. In: KDD 2006: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 631–636. ACM, New York (2006), http://doi.acm.org/10.1145/1150402.1150479
Henzinger, M.R., Heydon, A., Mitzenmacher, M., Najork, M.: On near-uniform url sampling. Comput. Netw. 33(1-6), 295–308 (2000), http://dx.doi.org/10.1016/S1389-12860000055-4
Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Exploiting the block structure of the web for computing pagerank. Tech. rep. Stanford University (2003)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604–632 (1999), http://doi.acm.org/10.1145/324133.324140
Latapy, M., Magnien, C.: Complex network measurements: Estimating the relevance of observed properties, pp. 1660–1668 (2008), doi:10.1109/INFOCOM.2008.227
Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: IMC 2007: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, pp. 29–42. ACM, New York (2007), http://doi.acm.org/10.1145/1298306.1298311
Newman, M., Watts, D., Strogatz, S.: Random graph models of social networks. Proc. Natl. Acad. Sci. (to appear) (2002)
Newman, M.E.J.: Ego-centered networks and the ripple effect. Social Networks 25(1), 83–95 (2003), doi:10.1016/S0378-8733(02)00039-4
Park, H.W.: Hyperlink network analysis: A new method for the study of social structure on the web. Connections 25(1), 49–61 (2003)
Reicheld, F.: The one number you need to grow. Harvard Business Review 81, 47–54 (2003)
Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61–70. ACM, New York (2002), http://doi.acm.org/10.1145/775047.775057
Salganik, M.J., Heckathorn, D.D.: Sampling and estimation in hidden populations using respondent-driven sampling. Sociological Methodology 34(1), 193–240 (2004)
Yook, S.-H., Jeong, H., Barabási, A.-L.: Modeling the internet’s large-scale topology. PNAS 99, 13,382–13,386 (2002)
Valente, T.W., Coronges, K., Lakon, C., Costenbader, E.: How correlated are network centrality measures? Connections 28(1), 16–26 (2008)
Valente, T.W., Davis, R.L.: Accelerating the diffusion of innovations using opinion leaders. The Annals of the American Academy of the Political and Social Sciences 566, 55–67 (1999)
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)
Watts, D., Dodds, P.: Networks, influence, and public opinion formation. Journal of Consumer Research 34(4), 441–458 (2007), http://research.yahoo.com/files/w_d_JCR.pdf
Wellman, B., Carrington, P., Hall, A.: Social Structures: A Network Analysis. In: Networks as Personal Communities, pp. 130–184. Cambridge University Press, Cambridge (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ma, H.(., Gustafson, S., Moitra, A., Bracewell, D. (2010). Ego-Centric Network Sampling in Viral Marketing Applications. In: Ting, IH., Wu, HJ., Ho, TH. (eds) Mining and Analyzing Social Networks. Studies in Computational Intelligence, vol 288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13422-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-13422-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13421-0
Online ISBN: 978-3-642-13422-7
eBook Packages: EngineeringEngineering (R0)