{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:16:21Z","timestamp":1742984181182,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319399577"},{"type":"electronic","value":"9783319399584"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39958-4_27","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T13:22:56Z","timestamp":1464700976000},"page":"342-355","source":"Crossref","is-referenced-by-count":2,"title":["AdaWIRL: A Novel Bayesian Ranking Approach for Personal Big-Hit Paper Prediction"],"prefix":"10.1007","author":[{"given":"Chuxu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Lu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zi-Ke","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,2]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Bethard, S., Jurafsky, D.: Who should i cite: learning literature search models from citation behavior. In: CIKM 2010, pp. 609\u2013618. ACM (2010)","DOI":"10.1145\/1871437.1871517"},{"key":"27_CR2","first-page":"993","volume":"3","author":"DM Blei","year":"2003","unstructured":"Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. JMLR 3, 993\u20131022 (2003)","journal-title":"JMLR"},{"key":"27_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: ICML 2005, pp. 89\u201396. ACM (2005)","DOI":"10.1145\/1102351.1102363"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: ICML 2007, pp. 129\u2013136. ACM (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-540-75530-2_10","volume-title":"String Processing and Information Retrieval","author":"C Castillo","year":"2007","unstructured":"Castillo, C., Donato, D., Gionis, A.: Estimating number of citations using author reputation. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 107\u2013117. Springer, Heidelberg (2007)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Dong, Y., Johnson, R.A., Chawla, N.V.: Will this paper increase your h-index? Scientific impact prediction. In: WSDM 2015, pp. 149\u2013158. ACM (2015)","DOI":"10.1145\/2684822.2685314"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Dong, Y., Johnson, R.A., Yang, Y., Chawla, N.V.: Collaboration signatures reveal scientific impact. In: ASONAM 2015, pp. 480\u2013487. ACM (2015)","DOI":"10.1145\/2808797.2808846"},{"key":"27_CR8","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. JMLR 4, 933\u2013969 (2003)","journal-title":"JMLR"},{"issue":"46","key":"27_CR9","doi-asserted-by":"crossref","first-page":"16569","DOI":"10.1073\/pnas.0507655102","volume":"102","author":"JE Hirsch","year":"2005","unstructured":"Hirsch, J.E.: An index to quantify an individual\u2019s scientific research output. PNAS 102(46), 16569\u201316572 (2005)","journal-title":"PNAS"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: KDD 2002, pp. 133\u2013142. ACM (2002)","DOI":"10.1145\/775047.775067"},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22, 79\u201386 (1951)","journal-title":"Ann. Math. Stat."},{"key":"27_CR12","unstructured":"Liu, Y., Zhao, P., Sun, A., Miao, C.: A boosting algorithm for item recommendation with implicit feedback. In: AAAI 2015, pp. 1792\u20131798. AAAI Press (2015)"},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"10168","DOI":"10.1038\/ncomms10168","volume":"7","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc, L., Zhou, T., Zhang, Q.-M., Stanley, H.E.: The h-index of a network node and its relation to degree and coreness. Nat. Commun. 7, 10168 (2016)","journal-title":"Nat. Commun."},{"issue":"1","key":"27_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"27_CR15","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web (1999)"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Rendle, S., Freudenthaler, C.: Improving pairwise learning for item recommendation from implicit feedback. In: WSDM 2014, pp. 273\u2013282. ACM (2014)","DOI":"10.1145\/2556195.2556248"},{"key":"27_CR17","unstructured":"Rendle, S., Freudenthaler, C., Gantner, Z., Schmidt-Thieme, L.: Bpr: Bayesian personalized ranking from implicit feedback. In: UAI 2009, pp. 452\u2013461. AUAI Press (2009)"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Sun, Y., Han, J., Aggarwal, C.C., Chawla, N.V.: When will it happen? relationship prediction in heterogeneous information networks. In: WSDM 2012, pp. 663\u2013672. ACM (2012)","DOI":"10.1145\/2124295.2124373"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: Arnetminer: extraction and mining of academic social networks. In: KDD 2008, pp. 990\u2013998. ACM (2008)","DOI":"10.1145\/1401890.1402008"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Wang, C., Han, J., Jia, Y., Tang, J., Zhang, D., Yu, Y., Guo, J.: Mining advisor-advisee relationships from research publication networks. In: KDD 2010, pp. 203\u2013212. ACM (2010)","DOI":"10.1145\/1835804.1835833"},{"issue":"6154","key":"27_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1126\/science.1237825","volume":"342","author":"D Wang","year":"2013","unstructured":"Wang, D., Song, C., Barab\u00e1si, A.-L.: Quantifying long-term scientific impact. Science 342(6154), 127\u2013132 (2013)","journal-title":"Science"},{"issue":"3","key":"27_CR22","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/s10791-009-9112-1","volume":"13","author":"Q Wu","year":"2010","unstructured":"Wu, Q., Burges, C.J., Svore, K.M., Gao, J.: Adapting boosting for information retrieval measures. Inf. Retrieval 13(3), 254\u2013270 (2010)","journal-title":"Inf. Retrieval"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Xu, J., Li, H.: Adarank: a boosting algorithm for information retrieval. In: SIGIR 2007, pp. 391\u2013398. ACM (2007)","DOI":"10.1145\/1277741.1277809"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Yan, R., Huang, C., Tang, J., Zhang, Y., Li, X.: To better stand on the shoulder of giants. In: JCDL 2012, pp. 51\u201360. ACM (2012)","DOI":"10.1145\/2232817.2232831"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Yan, R., Tang, J., Liu, X., Shan, D., Li, X.: Citation count prediction: learning to estimate future citations for literature. In: CIKM 2011, pp. 1247\u20131252. ACM (2011)","DOI":"10.1145\/2063576.2063757"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, T.: Solving large scale linear prediction problems using stochastic gradient descent algorithms. In: ICML 2004, p. 116. ACM (2004)","DOI":"10.1145\/1015330.1015332"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Zhao, T., McAuley, J., King, I.: Leveraging social connections to improve personalized ranking for collaborative filtering. In: CIKM 2014, pp. 261\u2013270. ACM (2014)","DOI":"10.1145\/2661829.2661998"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39958-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T22:36:45Z","timestamp":1567982205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39958-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319399577","9783319399584"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39958-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}