{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:56:58Z","timestamp":1740135418931,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"S2","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T00:00:00Z","timestamp":1627603200000},"content-version":"vor","delay-in-days":29,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1813215","61876052","61573118"],"award-info":[{"award-number":["U1813215","61876052","61573118"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Special Foundation for Technology Research Program of Guangdong Province","award":["2015B010131010"],"award-info":[{"award-number":["2015B010131010"]}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"crossref","award":["2019A1515011158"],"award-info":[{"award-number":["2019A1515011158"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangdong Province Covid-19 Pandemic Control Research Fund","award":["2020KZDZX1222"],"award-info":[{"award-number":["2020KZDZX1222"]}]},{"name":"Strategic Emerging Industry Development Special Funds of Shenzhen","award":["JCYJ20180306172232154","JCYJ20170307150528934"],"award-info":[{"award-number":["JCYJ20180306172232154","JCYJ20170307150528934"]}]},{"name":"Innovation Fund of Harbin Institute of Technology","award":["HIT.NSRIF.2017052"],"award-info":[{"award-number":["HIT.NSRIF.2017052"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Med Inform Decis Mak"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec><jats:title>Background<\/jats:title><jats:p>Text Matching (TM) is a fundamental task of natural language processing widely used in many application systems such as information retrieval, automatic question answering, machine translation, dialogue system, reading comprehension, etc. In recent years, a large number of deep learning neural networks have been applied to TM, and have refreshed benchmarks of TM repeatedly. Among the deep learning neural networks, convolutional neural network (CNN) is one of the most popular networks, which suffers from difficulties in dealing with small samples and keeping relative structures of features. In this paper, we propose a novel deep learning architecture based on capsule network for TM, called CapsTM, where capsule network is a new type of neural network architecture proposed to address some of the short comings of CNN and shows great potential in many tasks.<\/jats:p><\/jats:sec><jats:sec><jats:title>Methods<\/jats:title><jats:p>CapsTM is a five-layer neural network, including an input layer, a representation layer, an aggregation layer, a capsule layer and a prediction layer. In CapsTM, two pieces of text are first individually converted into sequences of embeddings and are further transformed by a highway network in the input layer. Then, Bidirectional Long Short-Term Memory (BiLSTM) is used to represent each piece of text and attention-based interaction matrix is used to represent interactive information of the two pieces of text in the representation layer. Subsequently, the two kinds of representations are fused together by BiLSTM in the aggregation layer, and are further represented with capsules (vectors) in the capsule layer. Finally, the prediction layer is a connected network used for classification. CapsTM is an extension of ESIM by adding a capsule layer before the prediction layer.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>We construct a corpus of Chinese medical question matching, which contains 36,360 question pairs. This corpus is randomly split into three parts: a training set of 32,360 question pairs, a development set of 2000 question pairs and a test set of 2000 question pairs. On this corpus, we conduct a series of experiments to evaluate the proposed CapsTM and compare it with other state-of-the-art methods. CapsTM achieves the highest F-score of 0.8666.<\/jats:p><\/jats:sec><jats:sec><jats:title>Conclusion<\/jats:title><jats:p>The experimental results demonstrate that CapsTM is effective for Chinese medical question matching and outperforms other state-of-the-art methods for comparison.<\/jats:p><\/jats:sec>","DOI":"10.1186\/s12911-021-01442-9","type":"journal-article","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T09:03:36Z","timestamp":1627635816000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["CapsTM: capsule network for Chinese medical text matching"],"prefix":"10.1186","volume":"21","author":[{"given":"Xiaoming","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yedan","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Ni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingcai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0271-8246","authenticated-orcid":false,"given":"Buzhou","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,30]]},"reference":[{"key":"1442_CR1","doi-asserted-by":"crossref","unstructured":"Chen Q, Zhang X, Ling Z, et al. Enhanced LSTM for natural language inference. In: Proceedings of the 55th annual meeting of the association for computational linguistics; 2017. p. 1657\u20138.","DOI":"10.18653\/v1\/P17-1152"},{"key":"1442_CR2","doi-asserted-by":"crossref","unstructured":"Yin W, Hinrich S, Bing X, et al. ABCNN: attention-based convolutional neural network for modeling sentence pairs. In: Proceedings of the 54th association for computational linguistics; 2016. p. 259\u201372.","DOI":"10.1162\/tacl_a_00097"},{"key":"1442_CR3","doi-asserted-by":"crossref","unstructured":"Wang Z, Wang H, Radu F. Bilateral multi-perspective matching for natural language sentences. In: Proceedings of the conference division and the AI journal division; 2017. p. 4144\u201350.","DOI":"10.24963\/ijcai.2017\/579"},{"key":"1442_CR4","doi-asserted-by":"crossref","unstructured":"Shen T, Zhou T, Long G, et al. DiSAN: directional self-attention network for RNN\/CNN-free language understanding. In: Proceedings of the thirty-second AAAI conference on artificial intelligence; 2018. p. 5446\u201355.","DOI":"10.1609\/aaai.v32i1.11941"},{"key":"1442_CR5","doi-asserted-by":"crossref","unstructured":"Kim S, Kang I, Kwak N, et al. Semantic sentence matching with densely-connected recurrent and co-attentive information. In: Proceedings of the thirty-three AAAI conference on artificial intelligence; 2019. p. 6586\u201393.","DOI":"10.1609\/aaai.v33i01.33016586"},{"key":"1442_CR6","doi-asserted-by":"crossref","unstructured":"Parikh AP, et al. A decomposable attention model for natural language inference. In: Proceedings of the 2016 empirical methods in natural language processing; 2016. p. 2249\u201355.","DOI":"10.18653\/v1\/D16-1244"},{"key":"1442_CR7","unstructured":"Devlin J, Chang M, Lee K, et al. BERT: pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 conference of the North American chapter of the association for computational linguistics; 2019. p. 4171\u201386."},{"key":"1442_CR8","unstructured":"Sabour S, Frosst N, Hinton GE, et al. Dynamic routing between capsules. In: Proceedings of the 2017 neural information processing systems; 2017. p. 3856\u201366."},{"key":"1442_CR9","doi-asserted-by":"crossref","unstructured":"Neculoiu P, Versteegh M, Rotaru M, et al. Learning text similarity with siamese recurrent networks. In: Proceedings of the 2013 conference of the association for computational linguistics; 2016. p. 148\u201357.","DOI":"10.18653\/v1\/W16-1617"},{"key":"1442_CR10","doi-asserted-by":"crossref","unstructured":"Huang P, He X, Gao J, et al. Learning deep structured semantic models for web search using click through data. In: Proceedings of the 2013 conference on information and knowledge management, 2013: 2333\u201338.","DOI":"10.1145\/2505515.2505665"},{"key":"1442_CR11","unstructured":"Hu B, Lu Z, Li H, Chen Q. Convolutional neural network architectures for matching natural language sentences. In: Proceedings of the 27th international conference on neural information processing systems\u2014volume 2 (NIPS\u201914). MIT Press, Cambridge, p. 2042\u201350."},{"key":"1442_CR12","doi-asserted-by":"crossref","unstructured":"Shen Y, He X, Gao J, et al. A latent semantic model with convolutional-pooling structure for information retrieval. In: Proceedings of the 2014 conference on information and knowledge management; 2014. p. 101\u201310.","DOI":"10.1145\/2661829.2661935"},{"key":"1442_CR13","unstructured":"Palangi H, et al. Semantic modelling with long-short-term memory for information retrieval. arXiv preprint arXiv:1412.6629 (2014)."},{"key":"1442_CR14","unstructured":"Mikolov T, Chen K, Corrado GS, et al. Efficient estimation of word representations in vector space. In: Proceedings of the 2013 international conference on learning representations; 2013."}],"container-title":["BMC Medical Informatics and Decision Making"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12911-021-01442-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12911-021-01442-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12911-021-01442-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T22:52:24Z","timestamp":1672959144000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcmedinformdecismak.biomedcentral.com\/articles\/10.1186\/s12911-021-01442-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":14,"journal-issue":{"issue":"S2","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1442"],"URL":"https:\/\/doi.org\/10.1186\/s12911-021-01442-9","relation":{},"ISSN":["1472-6947"],"issn-type":[{"type":"electronic","value":"1472-6947"}],"subject":[],"published":{"date-parts":[[2021,7]]},"assertion":[{"value":"7 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"94"}}