乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:58:36Z","timestamp":1723017516503},"reference-count":41,"publisher":"Wiley","issue":"18","license":[{"start":{"date-parts":[[2016,12,20]],"date-time":"2016-12-20T00:00:00Z","timestamp":1482192000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Communications"],"published-print":{"date-parts":[[2016,12,25]]},"abstract":"Abstract<\/jats:title>In this paper, we focus on maximizing the influence of online social networks (OSNs). Particularly, we try to answer how to select proper information initiators such that information can propagate as widely as possible. We stress our attention on the susceptible\u2010infected model, a type of epidemic models, to describe the process of information diffusion. In general, OSNs can be classified into two categories, Facebook\u2010like OSNs and Twitter\u2010like OSNs. The former ones require bidirectional connections, while the latter do not, so we use the undirected unweighted graph and directed unweighted graph to describe them, respectively. We also pay additional attention to the nonidentity of the link probability on information transmission and build the weight graph, which can also cover both the two types of OSNs. In order to determine values of weight graph's weights, we introduce a learning method to obtain useful factors from raw data for assessing the true link probability on information transmission. Based on spectral analysis within the three graphs, our investigations on the information diffusion show that the spectral radius of the graph adjacency matrix can reflect the capability of information propagation, according to which we could determine effective initiators. We conduct our simulations on real OSNs. Experimental results show that our approach could effectively discover the initiators that spread information widely. Copyright \u00a9 2016 John Wiley & Sons, Ltd.<\/jats:p>","DOI":"10.1002\/wcm.2765","type":"journal-article","created":{"date-parts":[[2016,12,20]],"date-time":"2016-12-20T14:46:45Z","timestamp":1482245205000},"page":"3340-3359","source":"Crossref","is-referenced-by-count":1,"title":["Identifying effective initiators in OSNs: from the spectral radius perspective"],"prefix":"10.1002","volume":"16","author":[{"given":"Songjun","family":"Ma","sequence":"first","affiliation":[{"name":"School of Electronics, Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China"}]},{"given":"Ge","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Electronics, Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China"}]},{"given":"Weijie","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Electronics, Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China"}]},{"given":"Li","family":"Song","sequence":"additional","affiliation":[{"name":"School of Electronics, Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China"}]},{"given":"Xiaohua","family":"Tian","sequence":"additional","affiliation":[{"name":"School of Electronics, Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China"}]},{"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Electronics, Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China"}]}],"member":"311","published-online":{"date-parts":[[2016,12,20]]},"reference":[{"key":"e_1_2_13_2_1","doi-asserted-by":"crossref","unstructured":"RichardsonM DomingosP.Mining knowledge\u2010sharing sites for viral marketing. InProc. ACM SIGKDD Conference on Knowledge Discovery and Data Mining (SIGKDD) Edmonton Canada 2002;61\u201370. DOI:10.1145\/775047.775057.","DOI":"10.1145\/775047.775057"},{"key":"e_1_2_13_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2824253"},{"key":"e_1_2_13_4_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature14604"},{"key":"e_1_2_13_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa"},{"key":"e_1_2_13_6_1","doi-asserted-by":"crossref","unstructured":"HorelT SingerY.Scalable methods for adaptively seeding a social network. InProc. International World Wide Web Conference (WWW) Florence Italy 2015;441\u2013451. DOI:10.1145\/2736277.2741127.","DOI":"10.1145\/2736277.2741127"},{"key":"e_1_2_13_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2015.05.021"},{"key":"e_1_2_13_8_1","doi-asserted-by":"crossref","unstructured":"KempeD KleinbergJ Tardos\u00c9.Maximizing the spread of influence through a social network. InProc. ACM SIGKDD Conference on Knowledge Discovery and Data Mining (SIGKDD) Washington DC 2003;137\u2013146. DOI:10.1145\/956750.956769.","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_13_9_1","doi-asserted-by":"crossref","unstructured":"ChenW WangY YangS.Efficient influence maximization in social networks. InProc. ACM SIGKDD Conference on Knowledge Discovery and Data Mining (SIGKDD) Paris France 2009;199\u2013208. DOI:10.1145\/z1557019.1557047.","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_13_10_1","unstructured":"ChenW LuW ZhangN.Time\u2010critical influence maximization in social networks with time\u2010delayed diffusion process. InProc. AAAI Conference on Artificial Intelligence (AAAI) Toronto Canada 2012;592\u2013598. arXiv:1204.3074v3."},{"key":"e_1_2_13_11_1","doi-asserted-by":"crossref","unstructured":"HeJS JiS BeyahR CaiZ.Minimum\u2010sized influential node set selection for social networks under the independent cascade model. InProc. ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC) Philadelphia PA 2014;93\u2013102. doi:10.1145\/2632951.2632975.","DOI":"10.1145\/2632951.2632975"},{"key":"e_1_2_13_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.045102"},{"key":"e_1_2_13_13_1","doi-asserted-by":"crossref","unstructured":"GuilleA HacidH.A predictive model for the temporal dynamics of information diffusion in online social networks. InProc. International World Wide Web Conference (WWW) Lyon France 2012;1145\u20131152. doi:10.1145\/2187980.2188254.","DOI":"10.1145\/2187980.2188254"},{"key":"e_1_2_13_14_1","doi-asserted-by":"crossref","unstructured":"GopalanA BanerjeeS DasAK ShakkottaiS.Random mobility and the spread of infection. InProc. IEEE International Conference on Computer Communications (INFOCOM) Shanghai China 2011;999\u20131007. DOI:10.1109\/INFCOM.2011.5935329.","DOI":"10.1109\/INFCOM.2011.5935329"},{"key":"e_1_2_13_15_1","doi-asserted-by":"crossref","unstructured":"ChenZ ZhuK YingL.Detecting multiple information sources in networks under the sir model. InProc. IEEE Annual Conference on Information Sciences and Systems (CISS) Princeton NJ 2014;1\u20134. DOI:10.1109\/CISS.2014.6814143.","DOI":"10.1109\/CISS.2014.6814143"},{"key":"e_1_2_13_16_1","doi-asserted-by":"crossref","unstructured":"LuZ WenY CaoG.Information diffusion in mobile social networks: the speed perspective. InProc. IEEE International Conference on Computer Communications (INFOCOM) Toronto Canada 2014;1932\u20131940. DOI:10.1109\/INFOCOM.2014.6848133.","DOI":"10.1109\/INFOCOM.2014.6848133"},{"key":"e_1_2_13_17_1","doi-asserted-by":"crossref","unstructured":"OK J JinY ShinJ YiY.On maximizing diffusion speed in social networks: impact of random seeding and clustering. InProc. ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) Austin TX 2014;301\u2013313. DOI:10.1109\/TSMC.2014.2359857.","DOI":"10.1145\/2637364.2591991"},{"key":"e_1_2_13_18_1","doi-asserted-by":"crossref","unstructured":"DingC ChenY FuX.Crowd crawling: towards collaborative data collection for large\u2010scale online social networks. InProc. ACM Conference on Online Social Networks (COSN) Boston MA 2013;183\u2013188. DOI:10.1145\/2512938.2512958.","DOI":"10.1145\/2512938.2512958"},{"key":"e_1_2_13_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1297243"},{"key":"e_1_2_13_20_1","doi-asserted-by":"crossref","unstructured":"KhelilA BeckerC TianJ RothermelK.An epidemic model for information diffusion in manets. InProc. ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile System (MSWiM) Atlanta GA 2002;54\u201360. DOI:10.1145\/570758.570768.","DOI":"10.1145\/570758.570768"},{"key":"e_1_2_13_21_1","doi-asserted-by":"crossref","unstructured":"PrakashBA ChakrabartiD FaloutsosM VallerN FaloutsosC.Threshold conditions for arbitrary cascade models on arbitrary networks. InProc. IEEE International Conference on Data Mining (ICDM) Vancouver Canada 2011;537\u2013546. DOI:10.1109\/ICDM.2011.145.","DOI":"10.1109\/ICDM.2011.145"},{"key":"e_1_2_13_22_1","doi-asserted-by":"crossref","unstructured":"PrakashBA AdamicL IwashnyaT TongH FaloutsosC.Fractional immunization in networks. InProc. SIAM International Conference on Data Mining (SDM) Austin TX 2013;659\u2013667. DOI:10.1137\/1.9781611972832.73.","DOI":"10.1137\/1.9781611972832.73"},{"key":"e_1_2_13_23_1","doi-asserted-by":"crossref","unstructured":"GaneshA Massouli\u00e9L TowsleyD.The effect of network topology on the spread of epidemics. InProc. IEEE International Conference on Computer Communications (INFOCOM) Miami FL 2005;1455\u20131466. DOI:10.1109\/INFCOM.2005.1498374.","DOI":"10.1109\/INFCOM.2005.1498374"},{"key":"e_1_2_13_24_1","doi-asserted-by":"publisher","DOI":"10.4310\/CMS.2008.v6.n2.a12"},{"key":"e_1_2_13_25_1","doi-asserted-by":"crossref","unstructured":"LinS WangF HuQ YuPS.Extracting social events for learning better information diffusion models. InProc. ACM SIGKDD Conference on Knowledge Discovery and Data Mining (SIGKDD) Chicago IL 2013;365\u2013373. DOI:10.1145\/2487575.z2487584.","DOI":"10.1145\/2487575.2487584"},{"key":"e_1_2_13_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289527"},{"key":"e_1_2_13_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"e_1_2_13_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.04.002"},{"key":"e_1_2_13_29_1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.physa.2015.12.162","article-title":"Identifying influential spreaders in complex networks based on gravity formula","volume":"451","author":"Ma Ll","year":"2016","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"e_1_2_13_30_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0021202"},{"key":"e_1_2_13_31_1","unstructured":"Jure Leskovec.Stanford Large Network Dataset Collection.http:\/\/snap.stanford.edu\/data\/index.html[accessed on February 2016]."},{"key":"e_1_2_13_32_1","unstructured":"Sina Corp.Sina Weibo API.http:\/\/open.weibo.com\/[accessed on June 2014]."},{"key":"e_1_2_13_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"e_1_2_13_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2014.11.012"},{"key":"e_1_2_13_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2014.02.041"},{"key":"e_1_2_13_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0550-3213(03)00355-9"},{"key":"e_1_2_13_37_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1202775"},{"key":"e_1_2_13_38_1","unstructured":"QazvinianV RosengrenE RadevDR MeiQ.Rumor has it: identifying misinformation in microblogs. InProc. ACL Confernece on Empirical Methods in Natural Language Processing (EMNLP) Edinburgh UK 2011;1589\u20131599."},{"key":"e_1_2_13_39_1","doi-asserted-by":"crossref","unstructured":"De\u00a0CristofaroE SorienteC TsudikG WilliamsA.Hummingbird: privacy at the time of Twitter. InProceedings of IEEE Security and Privacy San Francisco CA 2012. DOI:10.1109\/SP.2012.26.","DOI":"10.1109\/SP.2012.26"},{"key":"e_1_2_13_40_1","doi-asserted-by":"crossref","unstructured":"WangD ParkH XieG MoonS KaafarMA SalamatianK.A genealogy of information spreading on microblogs: a Galton\u2013Watson\u2010based explicative model. InProc. IEEE International Conference on Computer Communications (INFOCOM) Turin Italy 2013;2391\u20132399. DOI:10.1109\/INFCOM.2013.6567044.","DOI":"10.1109\/INFCOM.2013.6567044"},{"key":"e_1_2_13_41_1","doi-asserted-by":"crossref","unstructured":"MyersSA ZhuC LeskovecJ.Information diffusion and external influence in networks. InProc. ACM SIGKDD Conference on Knowledge Discovery and Data Mining (SIGKDD) Beijing China 2012;33\u201341. DOI:10.1145\/2339530.2339540.","DOI":"10.1145\/2339530.2339540"},{"key":"e_1_2_13_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2290714"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fwcm.2765","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fwcm.2765","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/wcm.2765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T07:11:32Z","timestamp":1696489892000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/wcm.2765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,20]]},"references-count":41,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2016,12,25]]}},"alternative-id":["10.1002\/wcm.2765"],"URL":"https:\/\/doi.org\/10.1002\/wcm.2765","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"value":"1530-8669","type":"print"},{"value":"1530-8677","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,20]]}}}