{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:09:33Z","timestamp":1753884573439,"version":"3.41.2"},"reference-count":39,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","funder":[{"name":"the Basic Research Project","award":["JCKY2022203B001"],"award-info":[{"award-number":["JCKY2022203B001"]}]},{"name":"Mudanjiang Normal University Science and Technology Research Project","award":["MNUYB202302"],"award-info":[{"award-number":["MNUYB202302"]}]},{"name":"Mudanjiang Normal University Scientific Research Team Project","award":["1452TD006"],"award-info":[{"award-number":["1452TD006"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2025,5,30]]},"abstract":"<jats:p> Text data contain a large amount of useful information, and various domain texts obtained after text data classification are the main body of text data research. Domain text data share a common domain background, so the topics in a domain have more overlap and finer differences. The concept in formal concept analysis (FCA) is a bi-aggregation structure of objects and attributes, which is regarded as the unit of human thought. The generation-specialization relationship between concepts, which is a both bidirectional containing and independent relationship, presents a hierarchical structure, which is very suitable for describing the significant or subtle similarity relationship between real categories. Due to the large scale of concept lattices, it is a challenge for FCA theory to deal with domain text data with the characteristics of large scale, no label and long text. This paper proposes a natural clustering method based on FCA, which can effectively discover, in the domain text data, all the topics with the granularity that users are interested in and can flexibly set the interested granularity of the topics. The feature extraction algorithm for domain texts is adopted, which not only effectively reduces the dimension of attributes and highlights the topic characteristics of documents (objects), but also eliminates the influence of noise in data. It makes the structure of the formal concept more concise, the semantics of that more clear, and the topic reflected by that more explicit and interpretable. The comparison with the LDA model on real data shows that our method is an effective, better structured and more interpretable topic detection method. <\/jats:p>","DOI":"10.1142\/s0218126625501646","type":"journal-article","created":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T10:13:04Z","timestamp":1733393584000},"source":"Crossref","is-referenced-by-count":0,"title":["Topic Detection in Domain Text Dataset: An FCA-Based Approach"],"prefix":"10.1142","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0829-4897","authenticated-orcid":false,"given":"Fugang","family":"Wang","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, P.\u00a0R.\u00a0China"},{"name":"School of Physics and Electronic Engineering, Mudanjiang Normal University, Mudanjiang 157011, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1738-7937","authenticated-orcid":false,"given":"Nianbin","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9520-9015","authenticated-orcid":false,"given":"Shaobin","family":"Cai","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Huzhou University, Huzhou 313000, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5925-4924","authenticated-orcid":false,"given":"Hongbin","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2025,4,7]]},"reference":[{"key":"S0218126625501646BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijmedinf.2022.104956"},{"key":"S0218126625501646BIB002","series-title":"Lecture Notes in Computer Science","first-page":"439","volume-title":"CCL 2019: Chinese Computational Linguistics","volume":"11856","author":"Xingyi X."},{"key":"S0218126625501646BIB003","first-page":"1532","volume":"30","author":"Zhao T.","year":"2019","journal-title":"Concurrency Comput. Pract. Exp."},{"key":"S0218126625501646BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01815-2_23"},{"volume-title":"Gen. Lattice Theory","year":"1997","author":"Ganter B.","key":"S0218126625501646BIB005"},{"key":"S0218126625501646BIB006","first-page":"42","volume-title":"Russian Summer School in Information Retrieval","author":"Ignatov D. I.","year":"2014"},{"key":"S0218126625501646BIB007","doi-asserted-by":"publisher","DOI":"10.1515\/amcs-2016-0035"},{"key":"S0218126625501646BIB008","doi-asserted-by":"publisher","DOI":"10.1145\/3554728"},{"key":"S0218126625501646BIB009","first-page":"3","volume-title":"ICCS 2021: Graph-Based Representation and Reasoning, Lecture Notes in Computer Science","volume":"12879","author":"Cristea D."},{"key":"S0218126625501646BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.06.008"},{"key":"S0218126625501646BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2019.101045"},{"key":"S0218126625501646BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.02.032"},{"key":"S0218126625501646BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.05.009"},{"key":"S0218126625501646BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-022-13640-2"},{"key":"S0218126625501646BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3067939"},{"key":"S0218126625501646BIB016","first-page":"6","volume":"11","author":"Hao F.","year":"2021","journal-title":"Human-Centric Comput. Inf."},{"key":"S0218126625501646BIB017","doi-asserted-by":"publisher","DOI":"10.1142\/S0218194020500229"},{"key":"S0218126625501646BIB018","first-page":"985","volume":"8","author":"Carpineto C.","year":"2004","journal-title":"J. UCS"},{"volume-title":"FooCA: Web Information Retrieval with Formal Concept Analysis","year":"2006","author":"Koester B.","key":"S0218126625501646BIB019"},{"key":"S0218126625501646BIB020","first-page":"255","volume-title":"ICCS 2008: Conceptual Structures: Knowledge Visualization and Reasoning, Lecture Notes in Computer Science","volume":"5113","author":"Dau F.","year":"2005"},{"key":"S0218126625501646BIB021","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-016-0404-9"},{"key":"S0218126625501646BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.03.011"},{"key":"S0218126625501646BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.01.008"},{"key":"S0218126625501646BIB024","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(2000)51:7<587::AID-ASI2>3.0.CO;2-L"},{"key":"S0218126625501646BIB025","first-page":"1","volume-title":"Fourth Int. Conf. Concept Lattices their Appllications, CLA","author":"Messai N.","year":"2006"},{"key":"S0218126625501646BIB026","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2019.2919330"},{"key":"S0218126625501646BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2022.09.011"},{"key":"S0218126625501646BIB028","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22688-5_4"},{"key":"S0218126625501646BIB029","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78921-5_3"},{"key":"S0218126625501646BIB030","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-15-151"},{"key":"S0218126625501646BIB031","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2005.11.014"},{"key":"S0218126625501646BIB032","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0876-x"},{"key":"S0218126625501646BIB033","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2016.08.002"},{"key":"S0218126625501646BIB034","first-page":"270","volume-title":"CONCEPTS 2024: Conceptual Knowledge Structures, Lecture Notes in Computer Science","volume":"14914","author":"Bendimerad A."},{"key":"S0218126625501646BIB036","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-007-9053-6"},{"key":"S0218126625501646BIB037","first-page":"993","volume":"3","author":"Blei D. M.","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"S0218126625501646BIB038","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2906949"},{"key":"S0218126625501646BIB039","first-page":"1","volume-title":"Benelearn 2015 Poster Presentations","author":"Van Craenendonck T.","year":"2015"},{"key":"S0218126625501646BIB040","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.12.044"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126625501646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:59:25Z","timestamp":1746665965000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218126625501646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,7]]},"references-count":39,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2025,5,30]]}},"alternative-id":["10.1142\/S0218126625501646"],"URL":"https:\/\/doi.org\/10.1142\/s0218126625501646","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"type":"print","value":"0218-1266"},{"type":"electronic","value":"1793-6454"}],"subject":[],"published":{"date-parts":[[2025,4,7]]},"article-number":"2550164"}}