Abstract
In this paper, an Influence Maximization problem in Social Network under the Deterministic Linear Threshold model is considered. The objective is to minimize the number of eventually negatively opinionated nodes in the network in a dynamic setting. The main ingredient of the new approach is the application of the sparse optimization technique. In the presence of inequality constraints and nonlinear relationships, the standard convex relaxation method of the L 1 relaxation does not perform well in this context. Therefore we propose to apply the L p relaxation where 0ā<āpā<ā1. The resulting optimization model is therefore non-convex. By means of an interior point method, the model can be solved efficiently and stably, typically yielding robust and sparse solutions in our numerical experiments with the simulated data.
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
Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57ā66 (2001)
Nail, J.: The Consumer Advertising Backlash. Forrester Research and Intelliseek Market Research Report (May 2004)
Misner, I.R.: The Worldās Best Known Marketing Secret: Building Your Business with Word-of-Mouth Marketing, 2nd edn. Bard Press (1999)
Chen, W., Yuan, Y., Zhang, L.: Scalable Influence Maximization in Social Networks Under the Linear Threshold Model. In: The 2010 International Conference on Data Mining (2010)
Chen, W., Wang, C., Wang, Y.: Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks. In: The 2010 ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2010)
Schelling, T.: Micromotives and Macrobehavior. Norton (1978)
Richardson, M., Domingos, P.: Mining Knowledge-sharing Sites for Viral Marketing. In: The 2002 International Conference on Knowledge Discovery and Data Mining, pp. 61ā70 (2002)
Kempe, D., Kleinberg, J., Tardos, Ć.: Maximizing The Spread of Influence Through a Social Network. In: The 2003 International Conference on Knowledge Discovery and Data Mining, pp. 137ā146 (2003)
Kempe, D., Kleinberg, J., Tardos, Ć.: Influential Nodes in a Diffusion Model for Social Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.Ā 3580, pp. 1127ā1138. Springer, Heidelberg (2005)
Goldenberg, J., Libai, B., Muller, E.: Using Complex Systems Analysis to Advance Marketing Theory Development. Academy of Marketing Science Review (2001)
Goldenberg, J., Libai, B., Muller, E.: Talk of the Network:A Complex Systems Look at the Underlying Process of Word-of-Mouth. Marketing LettersĀ 12(3), 211ā223 (2001)
Granovetter, M.: Threshold Models of Collective Behavior. American Journal of SociologyĀ 83(6), 1420ā1443 (1978)
Zou, F., Willson, J., Wu, W.: Fast Information Propagation in Social Networks. In: MDMAA (2010)
Lu, Z., Zhang, W., Wu, W., Fu, B., Du, D.Z.: Approximation and Inapproximation for The Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model. In: 2011 31st International Conference on Distributed Computing Systems Workshops (2011)
Kepner, J., Gilbert, J.: Graph Algorithms in the Language of Linear Algebra, 1st edn. SIAM (2011)
Watts, D.J., Strogatz, S.H.: Collective Danamics of āSmall-Worldā Networks Ā 393, 440ā442 (1998)
Kleieberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. In: Proceedings of 32rd ACM Symposium on Theory of Computing (2000)
BarabĆ”si, A.L., Albert, R., Jeong, H.: Mean-Field Theory for Scale-Free Random Networks. Physica A: Statistical Mechanics and its ApplicationsĀ 272(1), 173ā187 (1999)
Romualdo, P.S., Vespignani, A.: Epidemic spreading in scale-free networks. Physical Review LettersĀ 86(14), 3200ā3203 (2001)
Bonato, A.: A Course on the Web Graph, Providence, Rhode Island. American Mathematical Society Graduate Studies Series in Mathematics (2008)
Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of on-line social networks. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2006)
Facebook: statistics, http://www.facebook.com/press/info.php?statistics (accessed September 1, 2011)
Twitaholic, http://twitaholic.com/ (accessed September 1, 2011)
Natarajan, B.K.: Sparse Approximate Solution to Linear Systems. SIAM Journal on ComputingĀ 24, 227ā234 (1995)
CandĆ©s, E.J., Tao, T.: Decoding by Linear Programming. IEEE Transaction of Information TheoryĀ 51, 4203ā4215 (2005)
Donoho, D.: For Most Large Underdetermined Systems of Linear Equations the Minimal L 1-norm Solution is Also the Sparsest Solution. Technical Report, Stanford University (2004)
Bruckstein, A.M., Donoho, D.L., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM ReviewĀ 51(1), 34ā81 (2009)
Tropp, J.A., Wright, S.J.: Computational methods for sparse solution of linear inverse problems. Proceedings of the IEEEĀ 98(6), 948ā958 (2010)
Ge, D., Jiang, X. and Ye, Y., A Note on the Complexity of L p Minimization, http://www.stanford.edu/~yyye/lpmin_v14.pdf
Ye, Y.: On the complexity of approximating a KKT point of quadratic programming. Mathematical ProgrammingĀ 80, 195ā211 (1998)
Bertsimas, D., Tsitsiklis, J.: Introduction to linear Optimization. Athena Scientific, 414 (1997)
Ye, Y.: Interior point algorithms: theory and analysis. John Wiley and Sons, Inc., New York (1997)
http://www.levmuchnik.net/Content/Networks/ComplexNetworksPackage.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Xu, R. (2013). An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model. In: Bonato, A., Mitzenmacher, M., PraÅat, P. (eds) Algorithms and Models for the Web Graph. WAW 2013. Lecture Notes in Computer Science, vol 8305. Springer, Cham. https://doi.org/10.1007/978-3-319-03536-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-03536-9_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03535-2
Online ISBN: 978-3-319-03536-9
eBook Packages: Computer ScienceComputer Science (R0)