{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:57:47Z","timestamp":1760731067729,"version":"3.37.3"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s13278-018-0516-z","type":"journal-article","created":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T14:20:00Z","timestamp":1527862800000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning to lurker rank: an evaluation of learning-to-rank methods for lurking behavior analysis"],"prefix":"10.1007","volume":"8","author":[{"given":"Diego","family":"Perna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Interdonato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8142-503X","authenticated-orcid":false,"given":"Andrea","family":"Tagarelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,1]]},"reference":[{"issue":"7","key":"516_CR1","doi-asserted-by":"publisher","first-page":"1869","DOI":"10.1109\/TSP.2016.2646667","volume":"65","author":"A Aprem","year":"2017","unstructured":"Aprem A, Krishnamurthy V (2017) Utility change point detection in online social media: a revealed preference framework. IEEE Trans Signal Process 65(7):1869\u20131880","journal-title":"IEEE Trans Signal Process"},{"key":"516_CR2","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.ins.2016.03.006","volume":"352\u2013353","author":"N Bach","year":"2016","unstructured":"Bach N, Hai N, Phuong T (2016) Personalized recommendation of stories for commenting in forum-based social media. Inf Sci 352\u2013353:48\u201360","journal-title":"Inf Sci"},{"key":"516_CR3","doi-asserted-by":"publisher","unstructured":"Bakshy E, Hofman JM, Mason WA, Watts DJ (2011) Everyone\u2019s an influencer: quantifying influence on Twitter. In: Proc. ACM conf. on web search and web data mining (WSDM), Hong Kong, China, February 9\u201312, 2011, pp 65\u201374. https:\/\/doi.org\/10.1145\/1935826.1935845","DOI":"10.1145\/1935826.1935845"},{"key":"516_CR4","doi-asserted-by":"publisher","unstructured":"Basile P, Caputo A, Rossiello G, Semeraro G (2016) Learning to rank entity relatedness through embedding-based features. In: Proc. int. conf. on applications of natural language to information systems (NLDB), Salford, UK, June 22\u201324, 2016, pp 471\u2013477. https:\/\/doi.org\/10.1007\/978-3-319-41754-7_51","DOI":"10.1007\/978-3-319-41754-7_51"},{"key":"516_CR5","doi-asserted-by":"crossref","unstructured":"Biega AJ, Ghazimatin A, Ferhatosmanoglu H, Gummadi KP, Weikum G (2017) Learning to Un-Rank: quantifying search exposure for users in online communities. In: Proceedings of the 2017 ACM on conference on information and knowledge management\u2014CIKM \u201917, ACM Press, New York, pp 267\u2013276","DOI":"10.1145\/3132847.3133040"},{"issue":"1","key":"516_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"key":"516_CR7","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman L, Friedman JH, Olshen RA, Stone CJ (1984) Classification and regression trees. Wadsworth, Belmont"},{"key":"516_CR8","unstructured":"Burges CJ (2010) From ranknet to lambdarank to lambdamart: an overview. Tech. Rep. 23-581"},{"key":"516_CR9","unstructured":"Burges CJC, Ragno R, Le QV (2006) Learning to rank with nonsmooth cost functions. In: Proc. conf. on neural information processing systems (NIPS), MIT Press Cambridge, MA, USA, Canada, December 04\u201307, 2006, pp 193\u2013200"},{"key":"516_CR10","doi-asserted-by":"publisher","unstructured":"Burges CJC, Shaked T, Renshaw E, Lazier A, Deeds M, Hamilton N, Hullender GN (2005) Learning to rank using gradient descent. In: Proc. int. conf. on machine learning (ICML), Bonn, Germany, August 7\u201311, 2005, pp 89\u201396. https:\/\/doi.org\/10.1145\/1102351.1102363","DOI":"10.1145\/1102351.1102363"},{"key":"516_CR11","unstructured":"Busa-Fekete R, Szarvas G, Elteto T, K\u00e9gl B (2012) An apple-to-apple comparison of learning-to-rank algorithms in terms of normalized discounted cumulative gain. In: Proc. ECAI work. on preference learning: problems and applications in AI, vol 242, Ios Press"},{"issue":"1\u20133","key":"516_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1080\/15427951.2007.10129291","volume":"4","author":"S Chakrabarti","year":"2007","unstructured":"Chakrabarti S (2007) Learning to rank in vector spaces and social networks. Internet Math 4(1\u20133):267\u2013298","journal-title":"Internet Math"},{"key":"516_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.dss.2016.06.017","volume":"90","author":"C Chen","year":"2016","unstructured":"Chen C, Shih SY, Lee M (2016) Who should you follow? Combining learning to rank with social influence for informative friend recommendation. Decis Support Syst 90:33\u201345","journal-title":"Decis Support Syst"},{"key":"516_CR14","unstructured":"Chen W, Liu TY, Lan Y, Ma Z, Li H (2009) Ranking measures and loss functions in learning to rank. In: Proc. conf. on neural information processing systems (NIPS), Vancouver, British Columbia, Canada, pp 315\u2013323"},{"issue":"3","key":"516_CR15","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273\u2013297","journal-title":"Mach Learn"},{"key":"516_CR16","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.1038\/srep02980","volume":"3","author":"MD Domenico","year":"2013","unstructured":"Domenico MD, Lima A, Mougel P, Musolesi M (2013) The anatomy of a scientific rumor. Sci Rep 3:2980","journal-title":"Sci Rep"},{"key":"516_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, crowds, and markets: reasoning about a highly connected world","author":"D Easley","year":"2010","unstructured":"Easley D, Kleinberg J (2010) Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press, Cambridge"},{"issue":"9","key":"516_CR18","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1089\/cyber.2012.0362","volume":"16","author":"N Edelmann","year":"2013","unstructured":"Edelmann N (2013) Reviewing the definitions of \u201clurkers\u201d and some implications for online research. Cyberpsychol Behav Soc Netw 16(9):645\u2013649","journal-title":"Cyberpsychol Behav Soc Netw"},{"issue":"1","key":"516_CR19","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.chb.2010.08.005","volume":"27","author":"R Farzan","year":"2011","unstructured":"Farzan R, Brusilovsky P (2011) Encouraging user participation in a course recommender system: an impact on user behavior. Comput Hum Behav 27(1):276\u2013284","journal-title":"Comput Hum Behav"},{"key":"516_CR20","doi-asserted-by":"crossref","unstructured":"Farzan R, DiMicco JM, Brownholtz B (2010) Mobilizing lurkers with a targeted task. In: Proc. int. conf. on weblogs and social media (ICWSM), Washington, DC, USA, May 23\u201326, 2010","DOI":"10.1609\/icwsm.v4i1.14050"},{"key":"516_CR21","doi-asserted-by":"publisher","unstructured":"Ferro N, Lucchese C, Maistro M, Perego R (2017) On including the user dynamic in learning to rank. In: Proc. ACM SIGIR conf. on research and development in information retrieval (SIGIR), Shinjuku, Tokyo, Japan, August 7\u201311, 2017, pp 1041\u20131044. https:\/\/doi.org\/10.1145\/3077136.3080714","DOI":"10.1145\/3077136.3080714"},{"key":"516_CR22","doi-asserted-by":"publisher","unstructured":"Freund Y, Schapire RE (1995) A decision-theoretic generalization of on-line learning and an application to boosting. In: Proc. European conf. on computational learning theory (EuroCOLT), Barcelona, Spain, March 13\u201315, 1995, pp 23\u201337. https:\/\/doi.org\/10.1007\/3-540-59119-2_166","DOI":"10.1007\/3-540-59119-2_166"},{"key":"516_CR23","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2000","unstructured":"Friedman JH (2000) Greedy function approximation: a gradient boosting machine. Ann Stat 29:1189\u20131232","journal-title":"Ann Stat"},{"key":"516_CR24","unstructured":"Hall MA (1999) Correlation-based feature selection for machine learning. PhD Thesis, University of Waikato, Hamilton"},{"issue":"3","key":"516_CR25","doi-asserted-by":"publisher","first-page":"349","DOI":"10.4310\/SII.2009.v2.n3.a8","volume":"2","author":"T Hastie","year":"2009","unstructured":"Hastie T, Rosset S, Zhu J, Zou H (2009) Multi-class adaboost. Stat Interface 2(3):349\u2013360","journal-title":"Stat Interface"},{"key":"516_CR26","doi-asserted-by":"publisher","DOI":"10.1145\/2591453.2591458","author":"K Hofmann","year":"2014","unstructured":"Hofmann K, Whiteson S, Schuth A, de\u00a0Rijke M (2014) Learning to rank for information retrieval from user interactions. ACM SIGWEB Newsletter. https:\/\/doi.org\/10.1145\/2591453.2591458","journal-title":"ACM SIGWEB Newsletter"},{"key":"516_CR27","doi-asserted-by":"publisher","unstructured":"Hong L, Bekkerman R, Adler J, Davison B (2012) Learning to rank social update streams. In: Proc. ACM SIGIR conf. on research and development in information retrieval (SIGIR), Portland, OR, USA, August 12\u201316, 2012, pp 651\u2013660. https:\/\/doi.org\/10.1145\/2348283.2348371","DOI":"10.1145\/2348283.2348371"},{"key":"516_CR28","doi-asserted-by":"crossref","unstructured":"Huang J, Zhang W, Zhao S, Ding S, Wang H (2017) Learning to explain entity relationships by pairwise ranking with convolutional neural networks. In: Proc. int. joint conf. on artificial intelligence (IJCAI), pp 4018\u20134025","DOI":"10.24963\/ijcai.2017\/561"},{"issue":"2","key":"516_CR29","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1080\/10447318.2013.839901","volume":"30","author":"J Imlawi","year":"2014","unstructured":"Imlawi J, Gregg DG (2014) Engagement in online social networks: the impact of self-disclosure and humor. Int J Hum Comput Interact 30(2):106\u2013125","journal-title":"Int J Hum Comput Interact"},{"key":"516_CR30","doi-asserted-by":"publisher","unstructured":"Interdonato R, Pulice C, Tagarelli A (2015) \u201cGot to have faith!\u201d: The DEvOTION algorithm for delurking in social networks. In: Proc. int. conf. on advances in social networks analysis and mining (ASONAM), Paris, France, August 25\u201328, 2015, pp 314\u2013319. https:\/\/doi.org\/10.1145\/2808797.2809394","DOI":"10.1145\/2808797.2809394"},{"key":"516_CR31","doi-asserted-by":"publisher","unstructured":"Interdonato R, Tagarelli A (2016) To trust or not to trust lurkers?: evaluation of lurking and trustworthiness in ranking problems. In: Proc. int. school and conf. on network science (NetSciX), Poland, January 11\u201313, 2016. https:\/\/doi.org\/10.1007\/978-3-319-28361-6_4","DOI":"10.1007\/978-3-319-28361-6_4"},{"key":"516_CR32","doi-asserted-by":"crossref","unstructured":"J\u00e4rvelin K, Kek\u00e4l\u00e4inen J (2000) IR evaluation methods for retrieving highly relevant documents. In: Proc. ACM SIGIR conf. on research and development in information retrieval (SIGIR), pp 41\u201348","DOI":"10.1145\/345508.345545"},{"key":"516_CR33","doi-asserted-by":"publisher","unstructured":"Javarone MA, Interdonato R, Tagarelli A (2016) Modeling evolutionary dynamics of lurking in social networks. In: Proc. 7th workshop on complex networks (CompleNet), Dijon, France, March 23\u201325, 2016, pp 227\u2013239. https:\/\/doi.org\/10.1007\/978-3-319-30569-1_17","DOI":"10.1007\/978-3-319-30569-1_17"},{"key":"516_CR34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815355","volume-title":"Situated learning: legitimate peripheral participation","author":"J Lave","year":"1991","unstructured":"Lave J, Wenger E (1991) Situated learning: legitimate peripheral participation. Cambridge University Press, Cambridge"},{"issue":"4","key":"516_CR35","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1109\/TMM.2015.2477277","volume":"18","author":"C Lei","year":"2016","unstructured":"Lei C, Liu D, Li W (2016) Social diffusion analysis with common-interest model for image annotation. IEEE Trans Multimed 18(4):687\u2013701","journal-title":"IEEE Trans Multimed"},{"key":"516_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14267-3","volume-title":"Learning to rank for information retrieval","author":"T Liu","year":"2011","unstructured":"Liu T (2011) Learning to rank for information retrieval. Springer, Berlin"},{"key":"516_CR37","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.neucom.2016.07.011","volume":"216","author":"H Lu","year":"2016","unstructured":"Lu H, Chen C, Kong M, Zhang H, Zhao Z (2016) Social recommendation via multi-view user preference learning. Neurocomputing 216:61\u201371","journal-title":"Neurocomputing"},{"issue":"3","key":"516_CR38","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s11280-013-0268-7","volume":"18","author":"Z Luo","year":"2015","unstructured":"Luo Z, Osborne M, Wang T (2015) An effective approach to tweets opinion retrieval. World Wide Web 18(3):545\u2013566","journal-title":"World Wide Web"},{"key":"516_CR39","doi-asserted-by":"publisher","unstructured":"Malliaros FD, Vazirgiannis M (2013) To stay or not to stay: modeling engagement dynamics in social graphs. In: Proc. ACM conf. on information and knowledge management (CIKM), San Francisco, CA, USA, October 27\u2013November 1, 2013, pp 469\u2013478. https:\/\/doi.org\/10.1145\/2505515.2505561","DOI":"10.1145\/2505515.2505561"},{"key":"516_CR40","doi-asserted-by":"publisher","unstructured":"Martin S, Brown WM, Klavans R, Boyack KW (2011) Openord: an open-source toolbox for large graph layout. In: Visualization and data analysis, San Francisco Airport, CA, USA, January 24\u201325, 2011, p 786806. https:\/\/doi.org\/10.1117\/12.871402","DOI":"10.1117\/12.871402"},{"key":"516_CR41","doi-asserted-by":"publisher","unstructured":"Martins F, Magalhes J, Callan J (2016) Barbara made the news: mining the behavior of crowds for time-aware learning to rank. In: Proc. ACM conf. on web search and web data mining (WSDM), San Francisco, CA, USA, February 22\u201325, 2016, pp 667\u2013676. https:\/\/doi.org\/10.1145\/2835776.2835825","DOI":"10.1145\/2835776.2835825"},{"issue":"3","key":"516_CR42","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10791-006-9019-z","volume":"10","author":"D Metzler","year":"2007","unstructured":"Metzler D, Croft WB (2007) Linear feature-based models for information retrieval. Inf Retr 10(3):257\u2013274","journal-title":"Inf Retr"},{"key":"516_CR43","doi-asserted-by":"crossref","unstructured":"Nonnecke B, Preece JJ (2000) Lurker demographics: counting the silent. In: Proc. ACM conf. on human factors in computing systems (CHI), pp 73\u201380","DOI":"10.1145\/332040.332409"},{"key":"516_CR44","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.chb.2014.05.034","volume":"39","author":"Z Pan","year":"2014","unstructured":"Pan Z, Lu Y, Gupta S (2014) How heterogeneous community engage newcomers? The effect of community diversity on newcomers\u2019 perception of inclusion: an empirical study in social media service. Comput Hum Behav 39:100\u2013111","journal-title":"Comput Hum Behav"},{"issue":"1","key":"516_CR45","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/TCSS.2017.2762730","volume":"5","author":"D Perna","year":"2018","unstructured":"Perna D, Interdonato R, Tagarelli A (2018) Identifying users with alternate behaviors of lurking and active participation in multilayer social networks. IEEE Trans Comput Soc Syst 5(1):46\u201363","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"516_CR46","doi-asserted-by":"publisher","unstructured":"Perna D, Tagarelli A (2017) An evaluation of learning-to-rank methods for lurking behavior analysis. In: Proc. int. conf. on user modeling, adaptation and personalization, UMAP, Bratislava, Slovakia, July 09\u201312, 2017, pp 381\u2013382. https:\/\/doi.org\/10.1145\/3079628.3079650","DOI":"10.1145\/3079628.3079650"},{"issue":"2","key":"516_CR47","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.chb.2003.10.015","volume":"20","author":"JJ Preece","year":"2004","unstructured":"Preece JJ, Nonnecke B, Andrews D (2004) The top five reasons for lurking: improving community experiences for everyone. Comput Hum Behav 20(2):201\u2013223","journal-title":"Comput Hum Behav"},{"key":"516_CR48","doi-asserted-by":"publisher","unstructured":"Rowe M (2013) Mining user lifecycles from online community platforms and their application to churn prediction. In: Proc. IEEE int. conf. on data mining (ICDM), Dallas, TX, USA, December 7\u201310, 2013, pp 637\u2013646. https:\/\/doi.org\/10.1109\/ICDM.2013.78","DOI":"10.1109\/ICDM.2013.78"},{"key":"516_CR49","unstructured":"Silvestri G, Yang J, Bozzon A, Tagarelli A (2015) Linking accounts across social networks: the case of stackoverflow, github and twitter. In: Proc. int. workshop on knowledge discovery on the web, Cagliari, Italy, September 3\u20135, 2015, pp 41\u201352. http:\/\/ceur-ws.org\/Vol-1489\/paper-05.pdf"},{"key":"516_CR50","doi-asserted-by":"crossref","unstructured":"Srinivasan B, Natarajan A, Sinha R, Gupta V, Revankar S, Ravindran B (2013) Will your Facebook post be engaging? In: Proc. ACM conf. on information and knowledge management (CIKM), pp 25\u201328","DOI":"10.1145\/2512875.2512881"},{"key":"516_CR51","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.chb.2014.05.022","volume":"38","author":"N Sun","year":"2014","unstructured":"Sun N, Rau PPL, Ma L (2014) Understanding lurkers in online communities: a literature review. Comput Hum Behav 38:110\u2013117","journal-title":"Comput Hum Behav"},{"key":"516_CR52","unstructured":"Tabourier L, Libert A, Lambiotte R (2014) RankMerging: learning to rank in large-scale social networks. In: Proc. ECML PKDD workshop on dynamic networks and knowledge discovery (DyNaK), Nancy, France, September 15, 2014"},{"key":"516_CR53","doi-asserted-by":"publisher","unstructured":"Tagarelli A, Interdonato R (2013) \u201cWho\u2019s out there?\u201d: identifying and ranking lurkers in social networks. In: Proc. int. conf. on advances in social networks analysis and mining (ASONAM), Niagara, ON, Canada, August 25\u201329, 2013, pp 215\u2013222. https:\/\/doi.org\/10.1145\/2492517.2492542","DOI":"10.1145\/2492517.2492542"},{"issue":"230","key":"516_CR54","first-page":"27","volume":"4","author":"A Tagarelli","year":"2014","unstructured":"Tagarelli A, Interdonato R (2014) Lurking in social networks: topology-based analysis and ranking methods. Soc Netw Anal Min 4(230):27","journal-title":"Soc Netw Anal Min"},{"issue":"1","key":"516_CR55","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s13278-015-0276-y","volume":"5","author":"A Tagarelli","year":"2015","unstructured":"Tagarelli A, Interdonato R (2015) Time-aware analysis and ranking of lurkers in social networks. Soc Netw Anal Min 5(1):23","journal-title":"Soc Netw Anal Min"},{"key":"516_CR56","doi-asserted-by":"publisher","unstructured":"Tian Q, Li B (2016) Weakly hierarchical lasso based learning to rank in best answer prediction. In: Proc. int. conf. on advances in social networks analysis and mining (ASONAM), San Francisco, CA, USA, August 18\u201321, 2016, pp 307\u2013314. https:\/\/doi.org\/10.1109\/ASONAM.2016.7752250","DOI":"10.1109\/ASONAM.2016.7752250"},{"key":"516_CR57","doi-asserted-by":"publisher","unstructured":"Tsai CH, Lou JK, Lu WC, Lin SD (2014) Exploiting rank-learning models to predict the diffusion of preferences on social networks. In: Proc. int. conf. on advances in social networks analysis and mining (ASONAM), Beijing, China, August 17\u201320, 2014, pp 265\u2013272. https:\/\/doi.org\/10.1109\/ASONAM.2014.6921595","DOI":"10.1109\/ASONAM.2014.6921595"},{"key":"516_CR58","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.dss.2013.09.001","volume":"57","author":"H Tsai","year":"2014","unstructured":"Tsai H, Pai P (2014) Why do newcomers participate in virtual communities? An integration of self-determination and relationship management theories. Decis Support Syst 57:178\u2013187. https:\/\/doi.org\/10.1016\/j.dss.2013.09.001","journal-title":"Decis Support Syst"},{"key":"516_CR59","unstructured":"Wang Y, Wang L, Li Y, He D, Liu T (2013) A theoretical analysis of NDCG type ranking measures. In: Proc. annual conf. on learning theory (COLT), Princeton University, NJ, USA, June 12\u201314, 2013, pp 25\u201354"},{"issue":"3","key":"516_CR60","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10791-009-9112-1","volume":"13","author":"Q Wu","year":"2010","unstructured":"Wu Q, Burges CJC, Svore KM, Gao J (2010) Adapting boosting for information retrieval measures. Inf Retr 13(3):254\u2013270","journal-title":"Inf Retr"},{"key":"516_CR61","doi-asserted-by":"publisher","unstructured":"Xu J, Li H (2007) Adarank: a boosting algorithm for information retrieval. In: Proc. ACM SIGIR conf. on research and development in information retrieval (SIGIR), Amsterdam, The Netherlands, July 23\u201327, 2007, pp 391\u2013398. https:\/\/doi.org\/10.1145\/1277741.1277809","DOI":"10.1145\/1277741.1277809"},{"issue":"2","key":"516_CR62","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10115-013-0717-8","volume":"41","author":"T Xu","year":"2014","unstructured":"Xu T, Zhu H, Chen E, Huai B, Xiong H, Tian J (2014) Learning to annotate via social interaction analytics. Knowl Inf Syst 41(2):251\u2013276","journal-title":"Knowl Inf Syst"},{"key":"516_CR63","doi-asserted-by":"crossref","unstructured":"Zamani H, Shakery A, Moradi P (2014) Regression and learning to rank aggregation for user engagement evaluation. In: Proc. ACM recommender systems challenge (RecSysChallenge), ACM, p 29","DOI":"10.1145\/2668067.2668077"},{"issue":"1","key":"516_CR64","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10115-015-0897-5","volume":"49","author":"W Zhao","year":"2016","unstructured":"Zhao W, Li S, He Y, Wang L, Wen JR, Li X (2016) Exploring demographic information in social media for product recommendation. Knowl Inf Syst 49(1):61\u201389","journal-title":"Knowl Inf Syst"},{"key":"516_CR65","doi-asserted-by":"publisher","unstructured":"Zhuang J, Mei T, Hoi S, Hua XS, Li S (2011) Modeling social strength in social media community via kernel-based learning. In: Proc. ACM multimedia conf. and co-located workshops, Scottsdale, AZ, USA, November 28\u2013December 1, 2011, pp 113\u2013122. https:\/\/doi.org\/10.1145\/2072298.2072315","DOI":"10.1145\/2072298.2072315"},{"key":"516_CR66","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-48490-7_29","volume":"536","author":"T Zin","year":"2017","unstructured":"Zin T, Tin P, Hama H (2017) Deep learning model for integration of clustering with ranking in social networks. Adv Intell Syst Comput 536:247\u2013254","journal-title":"Adv Intell Syst Comput"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-018-0516-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0516-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0516-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T23:14:08Z","timestamp":1693696448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-018-0516-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,1]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["516"],"URL":"https:\/\/doi.org\/10.1007\/s13278-018-0516-z","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2018,6,1]]},"assertion":[{"value":"8 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"39"}}