{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T07:59:12Z","timestamp":1759564752160},"reference-count":22,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2023,12,1]]},"DOI":"10.1587\/transinf.2022edp7229","type":"journal-article","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T22:34:54Z","timestamp":1701383694000},"page":"2026-2035","source":"Crossref","is-referenced-by-count":2,"title":["Continuous Similarity Search for Dynamic Text Streams"],"prefix":"10.1587","volume":"E106.D","author":[{"given":"Yuma","family":"TSUCHIDA","sequence":"first","affiliation":[{"name":"University of Electro-Communications"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kohei","family":"KUBO","sequence":"additional","affiliation":[{"name":"University of Electro-Communications"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisashi","family":"KOGA","sequence":"additional","affiliation":[{"name":"University of Electro-Communications"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] L.H. U, J. Zhang, K. Moruatidis, and Y. Li, \u201cContinuous top-k monitoring on document streams,\u201d IEEE Trans. Knowl. Data Eng., vol.29, no.5, pp.991-1003, 2017. 10.1109\/tkde.2017.2657622","DOI":"10.1109\/TKDE.2017.2657622"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] X. Wang, Y. Zhang, W. Zhang, X. Lin, and Z. Huang, \u201cSkype: Top-k spatial-keyword publish\/subscribe over sliding window,\u201d Proc. VLDB Endow., vol.9, no.7, pp.588-599, 2016. 10.14778\/2904483.2904490","DOI":"10.14778\/2904483.2904490"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] D. Yang, A. Shastri, E.A. Rundensteiner, and M.O. Ward, \u201cAn optimal strategy for monitoring top-k queries in streaming windows,\u201d Proc. 14th International Conference on Extending Database Technology, pp.57-68, 2011. 10.1145\/1951365.1951375","DOI":"10.1145\/1951365.1951375"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] G.D.F. Morales and A. Gionis, \u201cStreaming similarity self-join,\u201d Proc. VLDB Endow., vol.9, no.10, pp.792-803, 2016. 10.14778\/2977797.2977805","DOI":"10.14778\/2977797.2977805"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] L. Pac\u00edfico and L. Ribeiro, \u201cSstr: Set similarity join over stream data,\u201d Proc. 22nd International Conference on Enterprise Information Systems-Volume 1: ICEIS, pp.52-60, INSTICC, SciTePress, 2020. 10.5220\/0009420400520060","DOI":"10.5220\/0009420400520060"},{"key":"6","unstructured":"[6] W. Mann, N. Augsten, and C.S. Jensen, \u201cSWOOP: top-k similarity joins over set streams,\u201d CoRR, vol.abs\/1711.02476, 2017."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] P. Wang, Y. Qi, Y. Zhang, Q. Zhai, C. Wang, J.C.S. Lui, and X. Guan, \u201cA memory-efficient sketch method for estimating high similarities in streaming sets,\u201d Proc. 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.25-33, 2019. 10.1145\/3292500.3330825","DOI":"10.1145\/3292500.3330825"},{"key":"8","unstructured":"[8] D. Yang, B. Li, and P. Cudr\u00e9-Mauroux, \u201cPoisketch: Semantic place labeling over user activity streams,\u201d Proc. IJCAI'16, pp.2697-2703, 2016."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] D. Yang, B. Li, L. Rettig, and P. Cudr\u00e9-Mauroux, \u201cHistosketch: Fast similarity-preserving sketching of streaming histograms with concept drift,\u201d 2017 IEEE International Conference on Data Mining (ICDM), pp.545-554, 2017. 10.1109\/icdm.2017.64","DOI":"10.1109\/ICDM.2017.64"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] X. Xu, C. Gao, J. Pei, K. Wang, and A. Al-Barakati, \u201cContinuous similarity search for evolving queries,\u201d Knowledge and Information Systems, vol.48, no.3, pp.649-678, 2016. 10.1007\/s10115-015-0892-x","DOI":"10.1007\/s10115-015-0892-x"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] H. Koga and D. Noguchi, \u201cContinuous similarity search for evolving database,\u201d Proc. 13th International Conference on Similarity Search and Applications (SISAP 2020), pp.155-167, 2020. 10.1007\/978-3-030-60936-8_12","DOI":"10.1007\/978-3-030-60936-8_12"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Y. Tsuchida, K. Kubo, and H. Koga, \u201cContinuous similarity search for text sets,\u201d International Conference on Database and Expert Systems Applications (DEXA), pp.229-234, Springer, 2022. 10.1007\/978-3-031-12426-6_18","DOI":"10.1007\/978-3-031-12426-6_18"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] B. Thomee, D.A. Shamma, G. Friedland, B. Elizalde, K. Ni, D. Poland, D. Borth, and L.-J. Li, \u201cYfcc100m: The new data in multimedia research,\u201d Communications of the ACM, vol.59, no.2, pp.64-73, 2016. 10.1145\/2812802","DOI":"10.1145\/2812802"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] A. Borodin, C. Karavasilis, and D. Pankratov, \u201cAn experimental study of algorithms for online bipartite matching,\u201d ACM J. Exp. Algorithmics, vol.25, pp.1-37, March 2020. 10.1145\/3379552","DOI":"10.1145\/3379552"},{"key":"15","unstructured":"[15] C. Efstathiades, A. Belesiotis, D. Skoutas, and D. Pfoser, \u201cSimilarity search on spatio-textual point sets,\u201d Proc. 19th EDBT, 2016."},{"key":"16","unstructured":"[16] D. Castro-Castro, Y.A. Arcia, M.P. Brioso, and R.M. Guillena, \u201cAuthorship verification, average similarity analysis,\u201d Recent Advances in Natural Language Processing, RANLP 2015, 7-9 September, 2015, Hissar, Bulgaria, pp.84-90, 2015."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] P. Bouros, S. Ge, and N. Mamoulis, \u201cSpatio-textual similarity joins,\u201d Proc. VLDB Endow., vol.6, no.1, p.1-12, Nov. 2012. 10.14778\/2428536.2428537","DOI":"10.14778\/2428536.2428537"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] D. Amagata, T. Hara, and C. Xiao, \u201cDynamic set knn self-join,\u201d 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp.818-829, 2019. 10.1109\/icde.2019.00078","DOI":"10.1109\/ICDE.2019.00078"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] C. Yang, L. Chen, H. Wang, S. Shang, R. Mao, and X. Zhang, \u201cDynamic set similarity join: An update log based approach,\u201d IEEE Trans. Knowl. Data Eng., vol.35, no.4, pp.3727-3741, 2023. 10.1109\/tkde.2021.3126631","DOI":"10.1109\/TKDE.2021.3126631"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] J. Yin, D. Chao, Z. Liu, W. Zhang, X. Yu, and J. Wang, \u201cModel-based clustering of short text streams,\u201d Proc. 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '18, New York, NY, USA, pp.2634-2642, Association for Computing Machinery, 2018. 10.1145\/3219819.3220094","DOI":"10.1145\/3219819.3220094"},{"key":"21","unstructured":"[21] P. Bolettieri, A. Esuli, F. Falchi, C. Lucchese, R. Perego, T. Piccioli, and F. Rabitti, \u201cCoPhIR: a test collection for content-based image retrieval,\u201d CoRR, vol.abs\/0905.4627v2, 2009."},{"key":"22","unstructured":"[22] P. Bolettieri, A. Eusli, F. Falchi, C. Lucchese, R. Perego, and F.Rabitti, \u201cEnabling content-based image retrieval in very large digital libraries,\u201d Proc. the Second Workshop on Very Large Digital Libraries, pp.43-50, 2009."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/12\/E106.D_2022EDP7229\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T04:18:06Z","timestamp":1701490686000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/12\/E106.D_2022EDP7229\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"references-count":22,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2022edp7229","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"article-number":"2022EDP7229"}}