{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:07Z","timestamp":1750221007156,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T00:00:00Z","timestamp":1566864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Romanian National Authority for Scientific Research and Innovation (UEFISCDI)","award":["PN-III-P1-1.1-PD-2016-0193"],"award-info":[{"award-number":["PN-III-P1-1.1-PD-2016-0193"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,27]]},"DOI":"10.1145\/3341161.3342900","type":"proceedings-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T21:07:04Z","timestamp":1579122424000},"page":"282-285","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A novel methodology for improving election poll prediction using time-aware polling"],"prefix":"10.1145","author":[{"given":"Alexandru","family":"Top\u00eerceanu","sequence":"first","affiliation":[{"name":"Politehnica University Timi\u015foara, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu-Emil","family":"Precup","sequence":"additional","affiliation":[{"name":"Politehnica University Timi\u015foara, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1257\/jel.20150694"},{"key":"e_1_3_2_1_2_1","first-page":"311","article-title":"A network motif based approach for classifying online social networks,\" in Applied computational intelligence and informatics (SACI)","author":"Duma A.","year":"2014","unstructured":"A. Duma and A. Topirceanu , \" A network motif based approach for classifying online social networks,\" in Applied computational intelligence and informatics (SACI) . IEEE , 2014 , pp. 311 -- 315 . A. Duma and A. Topirceanu, \"A network motif based approach for classifying online social networks,\" in Applied computational intelligence and informatics (SACI). IEEE, 2014, pp. 311--315.","journal-title":"IEEE"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.87.925"},{"key":"e_1_3_2_1_4_1","volume-title":"Network science. Cam","author":"Barab\u00e1si A.-L.","year":"2016","unstructured":"A.-L. Barab\u00e1si and M. P\u00f3sfai , Network science. Cam . press, 2016 . A.-L. Barab\u00e1si and M. P\u00f3sfai, Network science. Cam. press, 2016."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.42"},{"key":"e_1_3_2_1_6_1","volume-title":"Uncovering the temporal dynamics of diffusion networks,\" arXiv:1105.0697","author":"Rodriguez M. G.","year":"2011","unstructured":"M. G. Rodriguez , D. Balduzzi , and B. Sch\u00f6lkopf , \" Uncovering the temporal dynamics of diffusion networks,\" arXiv:1105.0697 , 2011 . M. G. Rodriguez, D. Balduzzi, and B. Sch\u00f6lkopf, \"Uncovering the temporal dynamics of diffusion networks,\" arXiv:1105.0697, 2011."},{"key":"e_1_3_2_1_7_1","first-page":"1145","volume-title":"ACM","author":"Guille A.","year":"2012","unstructured":"A. Guille and H. Hacid , \" A predictive model for the temporal dynamics of information diffusion in online social networks,\" in The 21st international conference on World Wide Web . ACM , 2012 , pp. 1145 -- 1152 . A. Guille and H. Hacid, \"A predictive model for the temporal dynamics of information diffusion in online social networks,\" in The 21st international conference on World Wide Web. ACM, 2012, pp. 1145--1152."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"A. Top\u00eerceanu \"Competition-based benchmarking of influence ranking methods in social networks \" Complexity vol. 2018 2018.  A. Top\u00eerceanu \"Competition-based benchmarking of influence ranking methods in social networks \" Complexity vol. 2018 2018.","DOI":"10.1155\/2018\/4562609"},{"key":"e_1_3_2_1_9_1","first-page":"548","article-title":"Learning to discover social circles in ego networks","volume":"2012","author":"McAuley J. J.","year":"2012","unstructured":"J. J. McAuley and J. Leskovec , \" Learning to discover social circles in ego networks .\" in NIPS , vol. 2012 , 2012 , pp. 548 -- 556 . J. J. McAuley and J. Leskovec, \"Learning to discover social circles in ego networks.\" in NIPS, vol. 2012, 2012, pp. 548--56.","journal-title":"NIPS"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.08.017"},{"key":"e_1_3_2_1_11_1","volume-title":"Analyzing the Social Web. Access via Elsevier","author":"Golbeck J.","year":"2013","unstructured":"J. Golbeck , Analyzing the Social Web. Access via Elsevier , 2013 . J. Golbeck, Analyzing the Social Web. Access via Elsevier, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/misr.12020"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1177\/0002764213489014"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0007123400001733"},{"key":"e_1_3_2_1_15_1","first-page":"163","volume-title":"Genetically optimized realistic social network topology inspired by facebook,\" in Online Social Media Analysis and Visualization","author":"Topirceanu A.","year":"2014","unstructured":"A. Topirceanu , M. Udrescu , and M. Vladutiu , \" Genetically optimized realistic social network topology inspired by facebook,\" in Online Social Media Analysis and Visualization . Springer , 2014 , pp. 163 -- 179 . A. Topirceanu, M. Udrescu, and M. Vladutiu, \"Genetically optimized realistic social network topology inspired by facebook,\" in Online Social Media Analysis and Visualization. Springer, 2014, pp. 163--179."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1177\/0022002797041002001"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011122126881"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1086\/226707"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996306"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/aje\/kwh255"},{"key":"e_1_3_2_1_21_1","first-page":"1741","volume-title":"proc. sys.","author":"Myers S.","year":"2010","unstructured":"S. Myers and J. Leskovec , \" On the convexity of latent social network inference,\" in Adv. in neural inf . proc. sys. , 2010 , pp. 1741 -- 1749 . S. Myers and J. Leskovec, \"On the convexity of latent social network inference,\" in Adv. in neural inf. proc. sys., 2010, pp. 1741--1749."}],"event":{"name":"ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Vancouver British Columbia Canada","acronym":"ASONAM '19"},"container-title":["Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342900","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341161.3342900","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:57Z","timestamp":1750206357000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":21,"alternative-id":["10.1145\/3341161.3342900","10.1145\/3341161"],"URL":"https:\/\/doi.org\/10.1145\/3341161.3342900","relation":{},"subject":[],"published":{"date-parts":[[2019,8,27]]},"assertion":[{"value":"2020-01-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}