{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:10:38Z","timestamp":1742955038951,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789813343696"},{"type":"electronic","value":"9789813343702"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-33-4370-2_32","type":"book-chapter","created":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:29:33Z","timestamp":1605745773000},"page":"443-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Using Topic Models to Label Documents for Classification"],"prefix":"10.1007","author":[{"given":"Khang Nhut","family":"Lam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lam Thanh","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jugal","family":"Kalita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,19]]},"reference":[{"key":"32_CR1","unstructured":"Hasnat, F., Hasan, M., Khan, N.H., Ali, A.: Text classification using machine learning algorithms. Doctoral dissertation, Brac University, Bangladesh (2018)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Benkhelifa, R., Laallam, F.Z.: Facebook posts text classification to improve information filtering. In: International Conference on Web Information Systems and Technologies, pp. 202\u2013207 (2016)","DOI":"10.5220\/0005907702020207"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Dadgar, S.M.H., Araghi, M.S., Farahani, M.M.: A novel text mining approach based on TF-IDF and support vector machine for news classification. In: IEEE International Conference on Engineering and Technology, pp. 112\u2013116 (2016)","DOI":"10.1109\/ICETECH.2016.7569223"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Kim Y.: Convolutional neural networks for sentence classification. arXiv preprint arXiv:1408.5882 (2014)","DOI":"10.3115\/v1\/D14-1181"},{"issue":"2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10462-010-9188-4","volume":"35","author":"J Silva","year":"2011","unstructured":"Silva, J., Coheur, L., Mendes, A.C., Wichert, A.: From symbolic to sub-symbolic information in question classification. Artif. Intell. Rev. 35(2), 137\u201354 (2011)","journal-title":"Artif. Intell. Rev."},{"key":"32_CR6","unstructured":"Wang, S.I., Manning, C.D.: Baselines and bigrams: simple, good sentiment and topic classification. In: the 50th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), pp. 90\u201394 (2012)"},{"key":"32_CR7","unstructured":"Socher, R., Pennington, J., Huang, E.H., Ng, A.Y., Manning, C.D.: Semi-supervised recursive autoencoders for predicting sentiment distributions. In: The Conference on Empirical Methods in Natural Language Processing, pp. 151\u2013161 (2011)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Tang, D., Qin, B., Liu, T.: Document modeling with gated recurrent neural network for sentiment classification. In: The Conference on Empirical Methods in Natural Language Processing, pp. 1422\u20131432 (2015)","DOI":"10.18653\/v1\/D15-1167"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Peng, H., et al.: Large-scale hierarchical text classification with recursively regularized deep graph-CNN. In: The 2018 World Wide Web Conference, pp. 1063\u20131072 (2018)","DOI":"10.1145\/3178876.3186005"},{"key":"32_CR10","unstructured":"Rao, A., Spasojevic, N.: Actionable and political text classification using word embeddings and LSTM. arXiv preprint arXiv:1607.02501 (2016)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Xiao, L., Wang, G., Zuo, Y.: Research on patent text classification based on Word2Vec and LSTM. In: The 11th International Symposium on Computational Intelligence and Design (ISCID), vol. 1, pp. 71\u201374 (2018)","DOI":"10.1109\/ISCID.2018.00023"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.neucom.2019.01.078","volume":"337","author":"G Liu","year":"2019","unstructured":"Liu, G., Guo, J.: Bidirectional LSTM with attention mechanism and convolutional layer for text classification. Neurocomputing 337, 325\u201338 (2019)","journal-title":"Neurocomputing"},{"key":"32_CR13"},{"key":"32_CR14"},{"key":"32_CR15","unstructured":"Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)"},{"issue":"1","key":"32_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/aris.1440380105","volume":"38","author":"ST Dumais","year":"2004","unstructured":"Dumais, S.T.: Latent semantic analysis. Ann. Rev. Inf. Sci. Technol. 38(1), 188\u2013230 (2004)","journal-title":"Ann. Rev. Inf. Sci. Technol."},{"issue":"1\u20132","key":"32_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1023\/A:1007617005950","volume":"42","author":"T Hofmann","year":"2001","unstructured":"Hofmann, T.: Unsupervised learning by probabilistic latent semantic analysis. Mach. Learn. 42(1\u20132), 177\u2013196 (2001)","journal-title":"Mach. Learn."},{"issue":"Jan","key":"32_CR18","first-page":"993","volume":"3","author":"DM Blei","year":"2003","unstructured":"Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet allocation. J. Mach. Learn. Res. 3(Jan), 993\u20131022 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"32_CR19","unstructured":"Moody, C.E.: Mixing Dirichlet topic models and word embeddings to make LDA2Vec. arXiv preprint arXiv:1605.02019 (2016)"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Lam, K.N., To, T.H., Tran, T.T., Kalita, J.: Improving Vietnamese WordNet using word embedding. In: The 3rd International Conference on Natural Language Processing and Information Retrieval, pp. 110\u2013114 (2019)","DOI":"10.1145\/3342827.3342854"},{"key":"32_CR21","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"32_CR22","series-title":"Smart Innovation, Systems and Technologies","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-981-13-8311-3_20","volume-title":"Intelligent Decision Technologies 2019","author":"J Jedrzejowicz","year":"2020","unstructured":"Jedrzejowicz, J., Zakrzewska, M.: Text classification using LDA-W2V hybrid algorithm. In: Czarnowski, I., Howlett, R.J., Jain, L.C. (eds.) Intelligent Decision Technologies 2019. SIST, vol. 142, pp. 227\u2013237. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-13-8311-3_20"}],"container-title":["Communications in Computer and Information Science","Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-33-4370-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T01:01:56Z","timestamp":1619312516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-33-4370-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789813343696","9789813343702"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-33-4370-2_32","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FDSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Future Data and Security Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Quy Nhon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fdse2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.thefdse.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.5 avg. reviewers\/paper (for two submission rounds in total). LNCS 12466 includes 24 of the accepted papers and 2 invited keynotes. CCIS 1306 includes 29 full and 8 short of the accepted papers. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}