{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T06:40:54Z","timestamp":1706251254885},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T00:00:00Z","timestamp":1391558400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s11280-014-0276-2","type":"journal-article","created":{"date-parts":[[2014,2,4]],"date-time":"2014-02-04T02:59:11Z","timestamp":1391482751000},"page":"661-679","source":"Crossref","is-referenced-by-count":3,"title":["Ranked content advertising in online social networks"],"prefix":"10.1007","volume":"18","author":[{"given":"Weixiong","family":"Rao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilaria","family":"Bartolini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,5]]},"reference":[{"issue":"6","key":"276_CR1","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/TKDE.2005.99","volume":"17","author":"G Adomavicius","year":"2005","unstructured":"Adomavicius, G., Tuzhilin, A.: Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng. 17(6), 734\u2013749 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"276_CR2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RK Ahuja","year":"1990","unstructured":"Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. J. ACM 37(2), 213\u2013223 (1990)","journal-title":"J. ACM"},{"issue":"1","key":"276_CR3","first-page":"710","volume":"1","author":"S Amer-Yahia","year":"2008","unstructured":"Amer-Yahia, S., Benedikt, M., Lakshmanan, L.V.S., Stoyanovich, J.: Efficient network aware search in collaborative tagging sites. PVLDB 1(1), 710\u2013721 (2008)","journal-title":"PVLDB"},{"key":"276_CR4","unstructured":"Atazky, R., Barone, E.: Advertising and Incentives Over a Social Network, Aug. 30. US Patent App. 11\/512,595 (2006)"},{"issue":"2","key":"276_CR5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TKDE.2010.86","volume":"23","author":"I Bartolini","year":"2011","unstructured":"Bartolini, I., Zhang, Z., Papadias, D.: Collaborative filtering with personalized skylines. IEEE Trans. Knowl. Data Eng. 23(2), 190\u2013203 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"276_CR6","doi-asserted-by":"crossref","unstructured":"Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: PODC, pp. 206\u2013215 (2004)","DOI":"10.1145\/1011767.1011798"},{"issue":"5\u20136","key":"276_CR7","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s11280-011-0146-0","volume":"15","author":"M-F Chiang","year":"2012","unstructured":"Chiang, M.-F., Peng, W.-C., Yu, P.S.: Exploring latent browsing graph for question answering recommendation. World Wide Web 15(5\u20136), 603\u2013630 (2012)","journal-title":"World Wide Web"},{"key":"276_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"276_CR9","unstructured":"Eppstein, D., Wang, J.Y.: A steady state model for graph power laws. In: 2nd International Workshop Web Dynamics (2002)"},{"issue":"4","key":"276_CR10","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4), 614\u2013656 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"276_CR11","doi-asserted-by":"crossref","unstructured":"Ferman, A.M., Errico, J.H., van Beek, P., Sezan, M.I.: Content-based filtering and personalization using structured metadata. In: JCDL, p. 393 (2002)","DOI":"10.1145\/544220.544341"},{"key":"276_CR12","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: SODA, pp. 156\u2013165 (2005)"},{"issue":"1","key":"276_CR13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1108\/13522751211191973","volume":"15","author":"Z Hadija","year":"2012","unstructured":"Hadija, Z., Barnes, S.B., Hair, N.: Why we ignore social networking advertising. Qual. Mark. Res. Int. J. 15(1), 19\u201332 (2012)","journal-title":"Qual. Mark. Res. Int. J."},{"key":"276_CR14","doi-asserted-by":"crossref","unstructured":"Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: SIGIR, pp. 230\u2013237 (1999)","DOI":"10.1145\/312624.312682"},{"key":"276_CR15","doi-asserted-by":"crossref","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering multilevel overlay graphs for shortest-path queries. In: ACM Journal of Experimental Algorithmics, p. 13 (2008)","DOI":"10.1145\/1412228.1412239"},{"key":"276_CR16","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top- query processing techniques in relational database systems. ACM Comput. Surv. 40(4) (2008)","DOI":"10.1145\/1391729.1391730"},{"issue":"1","key":"276_CR17","first-page":"451","volume":"1","author":"A Machanavajjhala","year":"2008","unstructured":"Machanavajjhala, A., Vee, E., Garofalakis, M.N., Shanmugasundaram, J.: Scalable ranked publish\/subscribe. PVLDB 1(1), 451\u2013462 (2008)","journal-title":"PVLDB"},{"key":"276_CR18","unstructured":"Michel, S., Triantafillou, P., Weikum, G.: Klee: a framework for distributed top-k query algorithms. In: VLDB, pp. 637\u2013648 (2005)"},{"key":"276_CR19","unstructured":"O\u2019Madadhain, J., Fisher, D., White, S., Boey, Y.-B.: JUNG: The Java Universal Network\/Graph Framework. http:\/\/jung.sourceforge.net"},{"key":"276_CR20","unstructured":"Roy, A., Nilakant, K., Dalibard, V., Yoneki, E.: Mitigating i\/o latency in ssd-based graph traversal. In: University of Cambridge, Computer Laboratory, Technical report (UCAM-CL-TR-823) (2012)"},{"key":"276_CR21","doi-asserted-by":"crossref","unstructured":"Sadoghi, M., Jacobsen, H.-A.: Be-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space. In: SIGMOD Conference, pp. 637\u2013648 (2011)","DOI":"10.1145\/1989323.1989390"},{"key":"276_CR22","doi-asserted-by":"crossref","unstructured":"Schenkel, R., Crecelius, T., Kacimi, M., Michel, S., Neumann, T., Parreira, J.X., Weikum, G.: Efficient top-k querying over social-tagging networks. In: SIGIR, pp. 523\u2013530 (2008)","DOI":"10.1145\/1390334.1390424"},{"key":"276_CR23","doi-asserted-by":"crossref","unstructured":"Singla, P., Richardson, M.: Yes, there is a correlation: from social networks to personal behavior on the web. In: WWW, pp. 655\u2013664 (2008)","DOI":"10.1145\/1367497.1367586"},{"key":"276_CR24","doi-asserted-by":"crossref","unstructured":"Theobald, M., Weikum, G., Schenkel, R.: Top-k query evaluation with probabilistic guarantees. In: VLDB, pp. 648\u2013659 (2004)","DOI":"10.1016\/B978-012088469-8\/50058-9"},{"issue":"3","key":"276_CR25","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/316542.316548","volume":"46","author":"M Thorup","year":"1999","unstructured":"Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46(3), 362\u2013394 (1999)","journal-title":"J. ACM"},{"key":"276_CR26","doi-asserted-by":"crossref","unstructured":"Ukkonen, A., Castillo, C., Donato, D., Gionis, A.: Searching the Wikipedia with contextual information. In: CIKM, pp. 1351\u20131352 (2008)","DOI":"10.1145\/1458082.1458274"},{"key":"276_CR27","doi-asserted-by":"crossref","unstructured":"Vieira, M.V., Fonseca, B.M., Damazio, R., Golgher, P.B., de Castro Reis, D., Ribeiro-Neto, B.A.: Efficient search ranking in social networks. In: CIKM, pp. 563\u2013572 (2007)","DOI":"10.1145\/1321440.1321520"},{"issue":"1","key":"276_CR28","first-page":"37","volume":"2","author":"S Whang","year":"2009","unstructured":"Whang, S., Brower, C., Shanmugasundaram, J., Vassilvitskii, S., Vee, E., Yerneni, R., Garcia-Molina, H.: Indexing boolean expressions. PVLDB 2(1), 37\u201348 (2009)","journal-title":"PVLDB"},{"key":"276_CR29","doi-asserted-by":"crossref","unstructured":"Wu, J., Chen, L., YU, Q., Han, P., Wu, Z.: Trust-aware media recommendation in heterogeneous social networks. In: World Wide Web, pp. 1\u201319 (2013)","DOI":"10.1007\/s11280-013-0243-3"},{"key":"276_CR30","unstructured":"Yahoo! advertising targeting options. http:\/\/advertising.yahoo.com\/central\/marketing\/targeting.html"},{"issue":"3","key":"276_CR31","doi-asserted-by":"crossref","first-page":"2029","DOI":"10.1016\/j.eswa.2007.02.028","volume":"34","author":"W.-S Yang","year":"2008","unstructured":"Yang, W.-S., Dia, J.-B.: Discovering cohesive subgroups from social networks for targeted advertising. Expert Syst. Appl. 34(3), 2029\u20132038 (2008)","journal-title":"Expert Syst. Appl."},{"key":"276_CR32","unstructured":"Yang, W.-S., Dia, J.-B., Cheng, H.-C., Lin, H.-T.: Mining social networks for targeted advertising. In: HICSS (2006)"},{"key":"276_CR33","doi-asserted-by":"crossref","unstructured":"Yoneki, E., Roy, A.: Scale-up graph processing: a storage-centric view. In: First International Workshop on Graph Data Management Experiences and Systems, GRADES \u201913, pp. 8:1\u20138:6. ACM, New York (2013)","DOI":"10.1145\/2484425.2484433"},{"key":"276_CR34","doi-asserted-by":"crossref","unstructured":"Zhu, Y.: Measurement and analysis of an online content voting network: a case study of digg. In: WWW 2010, pp 1039\u20131048 (2010)","DOI":"10.1145\/1772690.1772796"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-014-0276-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-014-0276-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-014-0276-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T04:41:52Z","timestamp":1565152912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-014-0276-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,5]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["276"],"URL":"https:\/\/doi.org\/10.1007\/s11280-014-0276-2","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,5]]}}}