{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:09:47Z","timestamp":1720570187670},"reference-count":28,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2018,9,1]]},"DOI":"10.1587\/transinf.2017edp7372","type":"journal-article","created":{"date-parts":[[2018,8,31]],"date-time":"2018-08-31T22:43:02Z","timestamp":1535755382000},"page":"2279-2290","source":"Crossref","is-referenced-by-count":1,"title":["Entity Ranking for Queries with Modifiers Based on Knowledge Bases and Web Search Results"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Wiradee","family":"IMRATTANATRAI","sequence":"first","affiliation":[{"name":"Graduate School of Informatics, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto P.","family":"KATO","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsumi","family":"TANAKA","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masatoshi","family":"YOSHIKAWA","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] J. Guo, G. Xu, X. Cheng, and H. Li, \u201cNamed entity recognition in query,\u201d SIGIR, pp.267-274, 2009. 10.1145\/1571941.1571989","DOI":"10.1145\/1571941.1571989"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] X. Yin and S. Shah, \u201cBuilding taxonomy of Web search intents for name entity queries,\u201d WWW, pp.1001-1010, 2010. 10.1145\/1772690.1772792","DOI":"10.1145\/1772690.1772792"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] N. Phan, P. Bailey, and R. Wilkinson, \u201cUnderstanding the relationship of information need specificity to search query length,\u201d SIGIR, pp.709-710, 2007. 10.1145\/1277741.1277870","DOI":"10.1145\/1277741.1277870"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] T. Lau and E. Horvitz, \u201cPatterns of search: analyzing and modeling web query refinement,\u201d UM99 User Modeling, pp.119-128, Springer, 1999. 10.1007\/978-3-7091-2490-1_12","DOI":"10.1007\/978-3-7091-2490-1_12"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] W. Imrattanatrai, M.P. Kato, and K. Tanaka, \u201cEntity search by leveraging attributive terms in sentential queries over rdf data,\u201d WI, pp.769-776, 2017. 10.1145\/3106426.3106462","DOI":"10.1145\/3106426.3106462"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S. Elbassuoni and R. Blanco, \u201cKeyword search over rdf graphs,\u201d Proceedings of the 20th ACM international conference on Information and knowledge management, pp.237-242, ACM, 2011. 10.1145\/2063576.2063615","DOI":"10.1145\/2063576.2063615"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] V. Hristidis and Y. Papakonstantinou, \u201cDiscover: Keyword search in relational databases,\u201d VLDB' 02: Proceedings of the 28th International Conference on Very Large Databases, pp.670-681, Elsevier, 2002. 10.1016\/B978-155860869-6\/50065-2","DOI":"10.1016\/B978-155860869-6\/50065-2"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] S. Agrawal, S. Chaudhuri, and G. Das, \u201cDbxplorer: A system for keyword-based search over relational databases,\u201d ICDE, pp.5-16, 2002. 10.1109\/icde.2002.994693","DOI":"10.1109\/ICDE.2002.994693"},{"key":"9","unstructured":"[9] B. Aditya, G. Bhalotia, S. Chakrabarti, A. Hulgeri, C. Nakhe, P. Parag, and S. Sudarshan, \u201cBanks: Browsing and keyword searching in relational databases,\u201d Proceedings of the 28th International Conference on Very Large Data Bases, VLDB' 02, pp.1083-1086, VLDB Endowment, 2002."},{"key":"10","unstructured":"[10] L. Page, S. Brin, R. Motwani, and T. Winograd, \u201cThe pagerank citation ranking: Bringing order to the web,\u201d tech. rep., Stanford InfoLab, 1999."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] L. Zou, R. Huang, H. Wang, J.X. Yu, W. He, and D. Zhao, \u201cNatural language question answering over rdf: a graph data driven approach,\u201d SIGMOD, pp.313-324, 2014. 10.1145\/2588555.2610525","DOI":"10.1145\/2588555.2610525"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] C. Unger, L. B\u00fchmann, J. Lehmann, A.-C. Ngonga Ngomo, D. Gerber, and P. Cimiano, \u201cTemplate-based question answering over rdf data,\u201d WWW, pp.639-648, 2012. 10.1145\/2187836.2187923","DOI":"10.1145\/2187836.2187923"},{"key":"13","unstructured":"[13] D. Gerber and A.C.N. Ngomo, \u201cBootstrapping the linked data web,\u201d 1st Workshop on Web Scale Knowledge Extraction@ ISWC, 2011."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] A.P. De Vries, A.-M. Vercoustre, J.A. Thom, N. Craswell, and M. Lalmas, \u201cOverview of the INEX 2007 entity ranking track,\u201d INEX, pp.245-251, 2007. 10.1007\/978-3-540-85902-4_22","DOI":"10.1007\/978-3-540-85902-4_22"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] G. Demartini, A.P. de Vries, T. Iofciu, and J. Zhu, \u201cOverview of the INEX 2008 entity ranking track,\u201d INEX, pp.243-252, 2008. 10.1007\/978-3-642-03761-0_25","DOI":"10.1007\/978-3-642-03761-0_25"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] G. Demartini, T. Iofciu, and A.P. De Vries, \u201cOverview of the INEX 2009 entity ranking track,\u201d INEX, pp.254-264, 2009. 10.1007\/978-3-642-14556-8_26","DOI":"10.1007\/978-3-642-14556-8_26"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] K. Balog, P. Serdyukov, and A.P.D. Vries, \u201cOverview of the TREC 2010 entity track,\u201d TREC, 2010.","DOI":"10.6028\/NIST.SP.500-294.entity-overview"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] R. Kaptein, P. Serdyukov, A. De Vries, and J. Kamps, \u201cEntity ranking using Wikipedia as a pivot,\u201d CIKM, pp.69-78, 2010. 10.1145\/1871437.1871451","DOI":"10.1145\/1871437.1871451"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] G. Demartini, C.S. Firan, T. Iofciu, R. Krestel, and W. Nejdl, \u201cWhy finding entities in Wikipedia is difficult, sometimes,\u201d Information Retrieval, vol.13, no.5, pp.534-567, 2010. 10.1007\/s10791-010-9135-7","DOI":"10.1007\/s10791-010-9135-7"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] K. Balog, M. Bron, and M. De Rijke, \u201cQuery modeling for entity search based on terms, categories, and examples,\u201d ACM TOIS, vol.29, no.4, pp.22:1-22:31, 2011. 10.1145\/2037661.2037667","DOI":"10.1145\/2037661.2037667"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] M. Bron, K. Balog, and M. De Rijke, \u201cRanking related entities: components and analyses,\u201d CIKM, pp.1079-1088, 2010. 10.1145\/1871437.1871574","DOI":"10.1145\/1871437.1871574"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] H. Zaragoza, H. Rode, P. Mika, J. Atserias, M. Ciaramita, and G. Attardi, \u201cRanking very many typed entities on wikipedia,\u201d Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, pp.1015-1018, ACM, 2007. 10.1145\/1321440.1321599","DOI":"10.1145\/1321440.1321599"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] J. Pehcevski, A.M. Vercoustre, and J.A. Thom, \u201cExploiting locality of wikipedia links in entity ranking,\u201d European Conference on Information Retrieval, pp.258-269, Springer, 2008. 10.1007\/978-3-540-78646-7_25","DOI":"10.1007\/978-3-540-78646-7_25"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] L. Zhang, Y. Zhang, and Y. Chen, \u201cSummarizing highly structured documents for effective search interaction,\u201d SIGIR, pp.145-154, 2012. 10.1145\/2348283.2348306","DOI":"10.1145\/2348283.2348306"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] H. Deng, M.R. Lyu, and I. King, \u201cA generalized Co-HITS algorithm and its application to bipartite graphs,\u201d KDD, pp.239-248, 2009. 10.1145\/1557019.1557051","DOI":"10.1145\/1557019.1557051"},{"key":"26","unstructured":"[26] T. Mikolov, K. Chen, G. Corrado, and J. Dean, \u201cEfficient estimation of word representations in vector space,\u201d arXiv preprint arXiv:1301.3781, 2013."},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] J.L. Fleiss, \u201cMeasuring nominal scale agreement among many raters.,\u201d Psychological bulletin, vol.76, no.5, pp.378-382, 1971. 10.1037\/h0031619","DOI":"10.1037\/h0031619"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] K. J\u00e4rvelin and J. Kek\u00e4l\u00e4inen, \u201cCumulated gain-based evaluation of ir techniques,\u201d ACM Transactions on Information Systems (TOIS), vol.20, no.4, pp.422-446, 2002. 10.1145\/582415.582418","DOI":"10.1145\/582415.582418"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/9\/E101.D_2017EDP7372\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T20:45:24Z","timestamp":1720557924000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/9\/E101.D_2017EDP7372\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,1]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2017edp7372","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,1]]}}}