{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:36Z","timestamp":1750308756738,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T00:00:00Z","timestamp":1257120000000},"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":[[2009,11,2]]},"DOI":"10.1145\/1651587.1651606","type":"proceedings-article","created":{"date-parts":[[2009,11,11]],"date-time":"2009-11-11T13:02:08Z","timestamp":1257944528000},"page":"83-87","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding intermediate entity between two examples on the web"],"prefix":"10.1145","author":[{"given":"Naoto","family":"Asahi","sequence":"first","affiliation":[{"name":"Kyoto University, Kyoto, Japan"}]},{"given":"Takehiro","family":"Yamamoto","sequence":"additional","affiliation":[{"name":"Kyoto University, Kyoto, Japan"}]},{"given":"Satoshi","family":"Nakamura","sequence":"additional","affiliation":[{"name":"Kyoto University, Kyoto, Japan"}]},{"given":"Katsumi","family":"Tanaka","sequence":"additional","affiliation":[{"name":"Kyoto University, Kyoto, Japan"}]}],"member":"320","published-online":{"date-parts":[[2009,11,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242648"},{"key":"e_1_3_2_1_2_1","volume-title":"IEEE Int. Conference on Data Engineering","author":"Pei J.","year":"2001","unstructured":"J. Pei , J. Han , Mortazavi-Asl, B. Pinto , H. Chen , Q. U. Dayal , and M. Hsu , \" PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern \", IEEE Int. Conference on Data Engineering , 2001 . J. Pei, J. Han, Mortazavi-Asl, B. Pinto, H. Chen, Q. U. Dayal, and M. Hsu, \"PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern\", IEEE Int. Conference on Data Engineering, 2001."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645337.650382"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11912873_7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.104"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.03.001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242675"}],"event":{"name":"CIKM '09: 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":"Hong Kong China","acronym":"CIKM '09"},"container-title":["Proceedings of the eleventh international workshop on Web information and data management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1651587.1651606","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1651587.1651606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:25Z","timestamp":1750278145000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1651587.1651606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,2]]},"references-count":7,"alternative-id":["10.1145\/1651587.1651606","10.1145\/1651587"],"URL":"https:\/\/doi.org\/10.1145\/1651587.1651606","relation":{},"subject":[],"published":{"date-parts":[[2009,11,2]]},"assertion":[{"value":"2009-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}