{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:44Z","timestamp":1763468144414,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,27]],"date-time":"2013-10-27T00:00:00Z","timestamp":1382832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,10,27]]},"DOI":"10.1145\/2509558.2509564","type":"proceedings-article","created":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T14:11:56Z","timestamp":1383055916000},"page":"31-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Classifying entities into an incomplete ontology"],"prefix":"10.1145","author":[{"given":"Bhavana","family":"Dalvi","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William W.","family":"Cohen","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamie","family":"Callan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Freebase. http:\/\/freebase.com.  Freebase. http:\/\/freebase.com."},{"key":"e_1_3_2_1_2_1","volume-title":"NIPS","author":"Adams R. P.","year":"2010","unstructured":"R. P. Adams , Z. Ghahramani , and M. I. Jordan . Tree-structured stick breaking for hierarchical data . NIPS , 2010 . R. P. Adams, Z. Ghahramani, and M. I. Jordan. Tree-structured stick breaking for hierarchical data. NIPS, 2010."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667056"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031186"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718501"},{"key":"e_1_3_2_1_6_1","volume-title":"Websets: Extracting sets of entities from the web using unsupervised information extraction","author":"Dalvi B.","year":"2012","unstructured":"B. Dalvi , W. Cohen , and J. Callan . Websets: Extracting sets of entities from the web using unsupervised information extraction , 2012 . B. Dalvi, W. Cohen, and J. Callan. Websets: Extracting sets of entities from the web using unsupervised information extraction, 2012."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40994-3_9"},{"key":"e_1_3_2_1_8_1","volume-title":"UAI","author":"Friedman N.","year":"1998","unstructured":"N. Friedman . The bayesian structural em algorithm . In UAI , 1998 . N. Friedman. The bayesian structural em algorithm. In UAI, 1998."},{"key":"e_1_3_2_1_9_1","unstructured":"S. Gopal B. Bai Y. Yang and A. Niculescu-Mizil. Bayesian models for large-scale hierarchical classification.  S. Gopal B. Bai Y. Yang and A. Niculescu-Mizil. Bayesian models for large-scale hierarchical classification."},{"key":"e_1_3_2_1_10_1","unstructured":"T. Mitchell. Nell: Never-ending language learning. http:\/\/rtw.ml.cmu.edu\/rtw\/.  T. Mitchell. Nell: Never-ending language learning. http:\/\/rtw.ml.cmu.edu\/rtw\/."},{"key":"e_1_3_2_1_11_1","volume-title":"EMNLP","author":"Mohamed T. P.","year":"2011","unstructured":"T. P. Mohamed , E. R. Hruschka Jr , and T. M. Mitchell . Discovering relations between noun categories . In EMNLP , 2011 . T. P. Mohamed, E. R. Hruschka Jr, and T. M. Mitchell. Discovering relations between noun categories. In EMNLP, 2011."},{"key":"e_1_3_2_1_12_1","volume-title":"Text Analysis Conference http:\/\/www.nist.gov\/tac\/2013\/KBP\/","author":"ST.","year":"2013","unstructured":"NI ST. Knowledge base population (KBP) task. Text Analysis Conference http:\/\/www.nist.gov\/tac\/2013\/KBP\/ , 2013 . NIST. Knowledge base population (KBP) task. Text Analysis Conference http:\/\/www.nist.gov\/tac\/2013\/KBP\/, 2013."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1690219.1690233"},{"key":"e_1_3_2_1_14_1","volume-title":"ICML","author":"Zhou D.","year":"2011","unstructured":"D. Zhou , L. Xiao , and M. Wu . Hierarchical classification via orthogonal transfer . In ICML , 2011 . D. Zhou, L. Xiao, and M. Wu. Hierarchical classification via orthogonal transfer. In ICML, 2011."}],"event":{"name":"CIKM'13: 22nd ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"San Francisco California USA","acronym":"CIKM'13"},"container-title":["Proceedings of the 2013 workshop on Automated knowledge base construction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509558.2509564","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2509558.2509564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:35Z","timestamp":1750231715000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509558.2509564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,27]]},"references-count":14,"alternative-id":["10.1145\/2509558.2509564","10.1145\/2509558"],"URL":"https:\/\/doi.org\/10.1145\/2509558.2509564","relation":{},"subject":[],"published":{"date-parts":[[2013,10,27]]},"assertion":[{"value":"2013-10-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}