{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:02:19Z","timestamp":1740153739802,"version":"3.37.3"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Serv. Comput."],"published-print":{"date-parts":[[2021,3,1]]},"DOI":"10.1109\/tsc.2018.2812729","type":"journal-article","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T19:15:48Z","timestamp":1520363748000},"page":"472-486","source":"Crossref","is-referenced-by-count":11,"title":["Leveraging Official Content and Social Context to Recommend Software Documentation"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3262-3734","authenticated-orcid":false,"given":"Jing","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7663-1421","authenticated-orcid":false,"given":"Zhenchang","family":"Xing","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6798-6535","authenticated-orcid":false,"given":"Muhammad Ashad","family":"Kabir","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/2597008.2597155"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985907"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR.2013.16"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/RSSE.2012.6233418"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"ref38","first-page":"1697","article-title":"A general boosting method and its application to learning ranking functions for web search","author":"zheng","year":"2008","journal-title":"Proc NIPS"},{"key":"ref33","first-page":"897","article-title":"Mcrank: Learning to rank using multiple classification and gradient boosting","author":"li","year":"2007","journal-title":"Proc 21rst Annu Conf Neural Inf Process Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484072"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2889160.2892658"},{"key":"ref30","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc 26th Int Conf Neural Inf Process Syst"},{"key":"ref37","first-page":"27","article-title":"Learning to rank with pairwise regularized least-squares","volume":"80","author":"pahikkala","year":"2007","journal-title":"Proc SIGIR"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277808"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/133160.133199"},{"key":"ref34","first-page":"865","article-title":"Ordinal regression by extended binary classification","author":"li","year":"2006","journal-title":"Proc 19th Int Conf Neural Inf Process Syst"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/2393596.2393606"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/1167515.1167508"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693088"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2016.2592909"},{"key":"ref28","first-page":"384","article-title":"Word representations: A simple and general method for semi-supervised learning","author":"turian","year":"2010","journal-title":"Proc Annual Meeting of the Assoc Computational Linguistics"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/2851613.2851815"},{"key":"ref27","first-page":"2493","article-title":"Natural language processing (almost) from scratch","volume":"12","author":"collobert","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/MSR.2013.6624015"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2777845"},{"key":"ref29","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013","journal-title":"ICLRE"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/RSSE.2012.6233404"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/2597073.2597077"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645736"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.116"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.45"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/smr.1800"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3115\/1225403.1225421"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.11.002"},{"key":"ref24","first-page":"993","article-title":"Latent dirichlet allocation","volume":"3","author":"blei","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1108\/00330330610681295"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767709"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-6059-1_36"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884862"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884808"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985809"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884873"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693127"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287630"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ESEM.2013.14"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/MSR.2013.6624045"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1137983.1137997"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341557"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884800"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2014.2387172"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553513"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2013.6606629"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.97"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2016.59"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2016.80"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950334"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-014-9323-y"},{"key":"ref18","first-page":"1","article-title":"Learning to rank code examples for code search engines","author":"niu","year":"2016","journal-title":"Empir Softw Eng"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2851613.2851771"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568313"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884790"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339665"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-012-9231-y"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-010-9150-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2013.35"},{"key":"ref49","first-page":"1188","article-title":"Distributed representations of sentences and documents","author":"le","year":"2014","journal-title":"Proc 31st Int Conf Int Conf Mach Learn"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227207"},{"key":"ref46","first-page":"23","article-title":"From ranknet to lambdarank to lambdamart: An overview","volume":"11","author":"burges","year":"2010","journal-title":"Learn"},{"key":"ref45","first-page":"193","article-title":"Learning to rank with nonsmooth cost functions","volume":"19","author":"quoc","year":"2007","journal-title":"Proc NIPS"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"ref47","volume":"463","author":"baeza-yates","year":"1999","journal-title":"Modern Information Retrieval"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"key":"ref41","first-page":"1883","article-title":"Learning to rank by optimizing NDCG measure","author":"valizadegan","year":"2009","journal-title":"Proc 22nd Int Conf Neural Inf Process Syst"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9112-1"},{"key":"ref43","first-page":"109","article-title":"Okapi at TREC-3","author":"robertson","year":"1994","journal-title":"Proc TREC"}],"container-title":["IEEE Transactions on Services Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4629386\/9398588\/08307192.pdf?arnumber=8307192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:46Z","timestamp":1652194366000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8307192\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,1]]},"references-count":73,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tsc.2018.2812729","relation":{},"ISSN":["1939-1374","2372-0204"],"issn-type":[{"type":"electronic","value":"1939-1374"},{"type":"electronic","value":"2372-0204"}],"subject":[],"published":{"date-parts":[[2021,3,1]]}}}