{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:19:41Z","timestamp":1725751181293},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642411533"},{"type":"electronic","value":"9783642411540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41154-0_6","type":"book-chapter","created":{"date-parts":[[2013,10,7]],"date-time":"2013-10-07T07:48:42Z","timestamp":1381132122000},"page":"73-87","source":"Crossref","is-referenced-by-count":7,"title":["A Novel and Model Independent Approach for Efficient Influence Maximization in Social Networks"],"prefix":"10.1007","author":[{"given":"Hemank","family":"Lamba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramasuri","family":"Narayanam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-77105-0_31","volume-title":"Internet and Network Economics","author":"S. Bharathi","year":"2007","unstructured":"Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 306\u2013311. Springer, Heidelberg (2007)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-17572-5_48","volume-title":"Internet and Network Economics","author":"A. Borodin","year":"2010","unstructured":"Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 539\u2013550. Springer, Heidelberg (2010)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to rank using gradient descent. In: Proceedings of the 22nd ICML, pp. 89\u201396 (2005)","DOI":"10.1145\/1102351.1102363"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., Abbadi, A.E.: Limiting the spread of misinformation in social networks. In: Proceedings of WWW, pp. 665\u2013674 (2011)","DOI":"10.1145\/1963405.1963499"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Carnes, T., Nagarajan, C., Wild, S., van Zuylen, A.: Maximizing in uence in a competitive social network: a follower\u2019s perspective. In: Proceedings of the 9th International Conference on Electronic Commerce (ICEC), pp. 351\u2013360 (2007)","DOI":"10.1145\/1282100.1282167"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of ACM SIGKDD, pp. 937\u2013944 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Datta, S., Majumder, A., Shrivastava, N.: Viral marketing for multiple products. In: Proceedings of IEEE ICDM, pp. 118\u2013127 (2010)","DOI":"10.1109\/ICDM.2010.52"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of WWW, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Goyal, A., Bonchi, F.: Laks V. S. Lakshmanan. Learning influence probabilities in social networks. In: WSDM, pp. 241\u2013250 (2010)","DOI":"10.1145\/1718487.1718518"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.S.: SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model. In: ICDM, pp. 211\u2013220 (2011)","DOI":"10.1109\/ICDM.2011.132"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.S.: A Data-Based Approach to Social Influence Maximization. In: PVLDB, pp. 73\u201384 (2011)","DOI":"10.14778\/2047485.2047492"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J. Goldenberg","year":"2001","unstructured":"Goldenberg, J., Libai, B., Muller, E.: Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters\u00a012(3), 211\u2013223 (2001)","journal-title":"Marketing Letters"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 12th SIAM International Conference on Data Mining, SDM (2012)","DOI":"10.1137\/1.9781611972825.40"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Kunegis, J., Lommatzsch, A., Bauckhage, C.: The slashdot zoo: Mining a social network with negative edges. In: Proc. of 18th WWW, pp. 740\u2013750 (2009)","DOI":"10.1145\/1526709.1526809"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Lerman, K., Ghosh, R.: Information Contagion: An Empirical Study of Spread of News on Digg and Twitter Social Networks. In: Proceedings of 4th International Conference on Weblogs and Social Media, ICWSM (2010)","DOI":"10.1609\/icwsm.v4i1.14021"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Lermann, K., Intagorn, S., Kang, J.H., Ghosh, R.: Using Proximity to Predict Activity in Social Networks. In: Proceedings of the 21st International World Wide Web Conference (poster) (December 2012)","DOI":"10.1145\/2187980.2188124"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the 28th ACM SIGCHI Conference on Human Factors in Computing Systems (CHI), pp. 1361\u20131370 (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Mathioudakis, M., Bonchi, F., Castillo, C., Gionis, A., Ukkonen, A.: Sparsification of influence networks. In: Proceedings of the 17th SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD (2011)","DOI":"10.1145\/2020408.2020492"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"M.E.J. Newman","year":"2001","unstructured":"Newman, M.E.J.: The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences (PNAS)\u00a098, 404\u2013409 (2001)","journal-title":"Proceedings of the National Academy of Sciences (PNAS)"},{"issue":"3","key":"6_CR23","doi-asserted-by":"publisher","first-page":"36104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Physical Review E\u00a074(3), 036104 (2006)","journal-title":"Physical Review E"},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"N. Ramasuri","year":"2011","unstructured":"Ramasuri, N., Narahari, Y.: A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks. IEEE T. Automation Science and Engineering\u00a08(1), 130\u2013147 (2011)","journal-title":"IEEE T. Automation Science and Engineering"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-39718-2_23","volume-title":"The Semantic Web - ISWC 2003","author":"M. Richardson","year":"2003","unstructured":"Richardson, M., Agrawal, R., Domingos, P.: Trust management for the semantic web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol.\u00a02870, pp. 351\u2013368. Springer, Heidelberg (2003)"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 61\u201370 (2002)","DOI":"10.1145\/775047.775057"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Satuluri, S., Parthasarathy, V., Ruan, Y.: Local graph sparsification for scalable clustering. In: Proc. of SIGMOD, pp. 721\u2013732 (2011)","DOI":"10.1145\/1989323.1989399"},{"key":"6_CR28","unstructured":"Schelling, T.: Micromotives and Macrobehavior. W.W. Norton and Company (1978)"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec: Defining and evaluating network communities based on ground-truth. In: Proceedings of ICDM (2012)","DOI":"10.1145\/2350190.2350193"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41154-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T03:45:20Z","timestamp":1688528720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41154-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642411533","9783642411540"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41154-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}