{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T16:53:45Z","timestamp":1792515225458,"version":"4.5.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/wcre.2013.6671293","type":"proceedings-article","created":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T17:00:42Z","timestamp":1386090042000},"page":"182-191","source":"Crossref","is-referenced-by-count":102,"title":["Automated library recommendation"],"prefix":"10.1109","author":[{"given":"Ferdian","family":"Thung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Lo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julia","family":"Lawall","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.3115\/1667583.1667644"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2009.42"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368151"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065018"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321663"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2009.19"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693088"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859081"},{"key":"13","first-page":"409","article-title":"Minimum description length principle: Generators are preferable to closed patterns","author":"li","year":"2006","journal-title":"AAAI"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"37","first-page":"318","article-title":"MAPO: Mining and recommending API usage patterns","author":"zhong","year":"2009","journal-title":"ECOOP"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982471"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2004.1317478"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1882291.1882317"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227178"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-005-9012-8"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/2351676.2351687"},{"key":"23","article-title":"Speeding up requirements management in a product software company: Linking customer wishes to product requirements through linguistic engineering","author":"och dag","year":"2004","journal-title":"RE"},{"key":"24","article-title":"Discovering frequent closed itemsets for association rules","author":"pasquier","year":"1999","journal-title":"ICDT"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/s10515-010-0064-x"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-010-9150-8"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.32"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2008.63"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2012.6405311"},{"key":"2","article-title":"Mining minimal non-redundant association rules using frequent closed itemsets","author":"bastide","year":"2000","journal-title":"International Conference on Computational Logic"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985807"},{"key":"1","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"Proc IEEE 5th Int Conf Very Large Data Bases"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2011.6100061"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1998.738508"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2011.105"},{"key":"32","article-title":"Beyond recommender systems: Helping people help each other","author":"terveen","year":"2001","journal-title":"HCI in the New Millennium"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/2393596.2393606"},{"key":"31","article-title":"Zart: A multifunctional itemset mining algorithm","author":"szathmary","year":"2007","journal-title":"CLA"},{"key":"4","article-title":"Latent dirichlet allocation","volume":"3","author":"blei","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2009.36"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227135"}],"event":{"name":"2013 20th Working Conference on Reverse Engineering (WCRE)","location":"Koblenz, Germany","start":{"date-parts":[[2013,10,14]]},"end":{"date-parts":[[2013,10,17]]}},"container-title":["2013 20th Working Conference on Reverse Engineering (WCRE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6656028\/6671267\/06671293.pdf?arnumber=6671293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T21:05:56Z","timestamp":1490216756000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6671293\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/wcre.2013.6671293","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}