{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T18:15:16Z","timestamp":1771524916765,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971211"],"award-info":[{"award-number":["11971211"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171388"],"award-info":[{"award-number":["12171388"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005273","name":"Natural Science Foundation of Yunnan Province","doi-asserted-by":"publisher","award":["202201AU070136"],"award-info":[{"award-number":["202201AU070136"]}],"id":[{"id":"10.13039\/501100005273","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10489-024-05272-w","type":"journal-article","created":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T08:02:40Z","timestamp":1708329760000},"page":"2582-2593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Bit-Close: a fast incremental concept calculation method"],"prefix":"10.1007","volume":"54","author":[{"given":"Yunfeng","family":"Ke","sequence":"first","affiliation":[]},{"given":"Jinhai","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3022-1141","authenticated-orcid":false,"given":"Shen","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"5272_CR1","doi-asserted-by":"crossref","unstructured":"Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Ordered sets. Springer, pp 445\u2013470","DOI":"10.1007\/978-94-009-7798-3_15"},{"issue":"1","key":"5272_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MCG.2006.5","volume":"26","author":"J Thomas","year":"2006","unstructured":"Thomas J, Cook K (2006) A visual analytics agenda. IEEE Comput Graph Appl 26(1):10\u201313","journal-title":"IEEE Comput Graph Appl"},{"key":"5272_CR3","doi-asserted-by":"publisher","first-page":"10699","DOI":"10.1007\/s10489-022-04051-9","volume":"53","author":"L Wang","year":"2023","unstructured":"Wang L, Pei Z, Qin K (2023) A novel conflict analysis model based on the formal concept analysis. Appl Intell 53:10699\u201310714","journal-title":"Appl Intell"},{"issue":"10","key":"5272_CR4","first-page":"2432","volume":"21","author":"F Jiang","year":"2010","unstructured":"Jiang F, Fan YS (2010) Web relationship mining based on extended concept lattice. J Softw 21(10):2432\u20132444","journal-title":"J Softw"},{"issue":"2","key":"5272_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10844-013-0242-y","volume":"41","author":"Z Zhang","year":"2013","unstructured":"Zhang Z, Du J, Wang L (2013) Formal concept analysis approach for data extraction from a limited deep web database. J Intell Inf Syst 41(2):211\u2013234","journal-title":"J Intell Inf Syst"},{"issue":"5","key":"5272_CR6","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1006\/imms.1993.1035","volume":"38","author":"R Godin","year":"1999","unstructured":"Godin R, Missaoui R, April A (1999) Experimental comparison of navigation in a galois lattice with conventional information retrieval methods. Int J Man-Mach Stud 38(5):747\u2013767","journal-title":"Int J Man-Mach Stud"},{"key":"5272_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF00058654","volume":"24","author":"C Carpineto","year":"1996","unstructured":"Carpineto C, Romano G (1996) A lattice conceptual clustering system and its application to browsing retrieval. Mach Learn 24:95\u2013122","journal-title":"Mach Learn"},{"key":"5272_CR8","doi-asserted-by":"crossref","unstructured":"Hu Q, Yuan Z, Qin K, Zhang J (2023) A novel outlier detection approach based on formal concept analysis. Knowl-Based Syst 268","DOI":"10.1016\/j.knosys.2023.110486"},{"key":"5272_CR9","doi-asserted-by":"crossref","unstructured":"Qian T, Wei L (2014) A novel concept acquisition approach based on formal contexts. Sci World J 1","DOI":"10.1155\/2014\/136324"},{"key":"5272_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s13042-016-0578-z","volume":"8","author":"T Qian","year":"2017","unstructured":"Qian T, Wei L, Qi J (2017) Decomposition methods of formal contexts to construct concept lattices. Int J Mach Learn Cybernet 8:95\u2013108","journal-title":"Int J Mach Learn Cybernet"},{"key":"5272_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijar.2020.04.004","volume":"123","author":"J Ma","year":"2020","unstructured":"Ma J, Zhang W, Qian Y (2020) Dependence space models to construct concept lattices. Int J Approx Reason 123:1\u201316","journal-title":"Int J Approx Reason"},{"key":"5272_CR12","doi-asserted-by":"crossref","unstructured":"Ganter B (2010) Two basic algorithms in concept analysis. In: Formal concept analysis. Springer, pp 312\u2013340","DOI":"10.1007\/978-3-642-11928-6_22"},{"key":"5272_CR13","first-page":"152","volume":"2000","author":"C Lindig","year":"2000","unstructured":"Lindig C, Gbr G (2000) Fast concept analysis. Work Concept Struct - Contrib ICCS 2000:152\u2013161","journal-title":"Work Concept Struct - Contrib ICCS"},{"issue":"1","key":"5272_CR14","first-page":"23","volume":"23","author":"S Kuznetsov","year":"1989","unstructured":"Kuznetsov S (1989) Interpretation on graphs and complexity characteristics of a search for specific patterns. Autom Document Math Linguist 23(1):23\u201327","journal-title":"Autom Document Math Linguist"},{"issue":"9","key":"5272_CR15","doi-asserted-by":"publisher","first-page":"4474","DOI":"10.1016\/j.eswa.2015.01.044","volume":"42","author":"L Zou","year":"2015","unstructured":"Zou L, Zhang Z, Long J (2015) A fast incremental algorithm for constructing concept lattices. Expert Syst Appl 42(9):4474\u20134481","journal-title":"Expert Syst Appl"},{"issue":"3","key":"5272_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.scico.2008.09.015","volume":"74","author":"DG Kourie","year":"2009","unstructured":"Kourie DG, Obiedkov S, Watson BW, Van Der Merwe D (2009) An incremental algorithm to construct a lattice of set intersections. Sci Comput Program 74(3):128\u2013142","journal-title":"Sci Comput Program"},{"key":"5272_CR17","unstructured":"Andrews S (2009) In-close, a fast algorithm for computing formal concepts. In: ICCS supplementary proceedings. Springer, vol 483"},{"key":"5272_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.ins.2021.04.104","volume":"572","author":"R Janostik","year":"2021","unstructured":"Janostik R, Konecny J, Kraj\u010da P (2021) Lincbo: fast algorithm for computation of the duquenne-guigues basis. Inf Sci 572:223\u2013240","journal-title":"Inf Sci"},{"key":"5272_CR19","first-page":"71","volume":"2008","author":"P Krajca","year":"2012","unstructured":"Krajca P, Outrata J, Vychodil V (2012) Parallel recursive algorithm for fca. CLA. Citeseer 2008:71\u201382","journal-title":"CLA. Citeseer"},{"key":"5272_CR20","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.ins.2021.12.008","volume":"586","author":"L Zou","year":"2022","unstructured":"Zou L, He T, Dai J (2022) A new parallel algorithm for computing formal concepts based on two parallel stages. Inf Sci 586:514\u2013524","journal-title":"Inf Sci"},{"key":"5272_CR21","doi-asserted-by":"crossref","unstructured":"Shan B, Qi J, Liu W (2012) A cuda-based algorithm for constructing concept lattices. In: Rough sets and current trends in computing: 8th international conference. Springer, vol 1, pp 297\u2013302","DOI":"10.1007\/978-3-642-32115-3_35"},{"key":"5272_CR22","doi-asserted-by":"publisher","first-page":"1826","DOI":"10.1007\/s10489-022-03646-6","volume":"53","author":"Q Hu","year":"2023","unstructured":"Hu Q, Qin K, Yang L (2023) The updating methods of object-induced three-way concept in dynamic formal contexts. Appl Intell 53:1826\u20131841","journal-title":"Appl Intell"},{"key":"5272_CR23","doi-asserted-by":"crossref","unstructured":"Qi J, Wei L, Yao Y (2014) Three-way formal concept analysis. In: Rough sets and knowledge technology. Springer International Publishing, pp 732\u2013741","DOI":"10.1007\/978-3-319-11740-9_67"},{"key":"5272_CR24","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.jpdc.2022.09.011","volume":"171","author":"RK Chunduri","year":"2023","unstructured":"Chunduri RK, Cherukuri AK (2023) Distributed three-way formal concept analysis for large formal contexts. J Parallel Distrib Comput 171:141\u2013156","journal-title":"J Parallel Distrib Comput"},{"key":"5272_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.fss.2017.05.002","volume":"333","author":"Z Zhang","year":"2018","unstructured":"Zhang Z (2018) Constructing l-fuzzy concept lattices without fuzzy galois closure operation. Fuzzy Sets Syst 333:71\u201386","journal-title":"Fuzzy Sets Syst"},{"issue":"1","key":"5272_CR26","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ijar.2012.07.005","volume":"54","author":"J Li","year":"2013","unstructured":"Li J, Mei C, Lv Y (2013) Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction. Int J Approx Reason 54(1):149\u2013165","journal-title":"Int J Approx Reason"},{"key":"5272_CR27","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2014.11.020","volume":"75","author":"Q Wan","year":"2015","unstructured":"Wan Q, Wei L (2015) Approximate concepts acquisition based on formal contexts. Knowl-Based Syst 75:78\u201386","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"5272_CR28","first-page":"3130","volume":"35","author":"C Luo","year":"2023","unstructured":"Luo C, Wang S, Li T, Chen H, Lv J, Yi Z (2023) park rough hypercuboid approach for scalable feature selection. IEEE Trans Knowl Data Eng 35(3):3130\u20133144","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"5272_CR29","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1109\/TPDS.2023.3265974","volume":"34","author":"C Luo","year":"2023","unstructured":"Luo C, Wang S, Li T, Chen H, Lv J, Yi Z (2023) Rhdofs: a distributed online algorithm towards scalable streaming feature selection. IEEE Trans Parallel Distrib Syst 34(6):1830\u20131847","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5272_CR30","unstructured":"Luo C, Wang S, Li T, Chen H, Lv J, Yi Z (2022) Large-scale meta-heuristic feature selection based on bpso assisted rough hypercuboid approach. IEEE Trans Neural Netw Learn Syst 1\u201315"},{"key":"5272_CR31","doi-asserted-by":"crossref","unstructured":"Luo C, Cao Q, Li T, Chen H, Wang S (2023) Mapreduce accelerated attribute reduction based on neighborhood entropy with apache spark. Expert Syst Appl 211","DOI":"10.1016\/j.eswa.2022.118554"},{"key":"5272_CR32","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.promfg.2018.03.003","volume":"22","author":"L Kov\u00e1cs","year":"2018","unstructured":"Kov\u00e1cs L (2018) Efficiency analsyis of concept lattice construction algorithms. Proced Manufac 22:11\u201318","journal-title":"Proced Manufac"},{"key":"5272_CR33","first-page":"325","volume":"672","author":"P Krajca","year":"2010","unstructured":"Krajca P, Outrata J, Vychodil V (2010) Advances in algorithms based on cbo. CLA. College Lang Assoc 672:325\u2013337","journal-title":"CLA. College Lang Assoc"},{"key":"5272_CR34","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-24651-0_31","volume":"2961","author":"D van der Merwe","year":"2004","unstructured":"van der Merwe D, Obiedkov S, Kourie D (2004) Addintent: a new incremental algorithm for constructing concept lattices. Concept Lattices. Springer 2961:372\u2013385","journal-title":"Concept Lattices. Springer"},{"issue":"1","key":"5272_CR35","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.ins.2011.09.023","volume":"185","author":"J Outrata","year":"2012","unstructured":"Outrata J, Vychodil V (2012) Fast algorithm for computing fixpoints of galois connections induced by object-attribute relational data. Inf Sci 185(1):114\u2013127","journal-title":"Inf Sci"},{"key":"5272_CR36","doi-asserted-by":"crossref","unstructured":"Kodagoda N, Andrews S, Pulasinghe K (2017) A parallel version of the in-close algorithm. In: 2017 6th national conference on technology and management (NCTM). IEEE, pp 1\u20135","DOI":"10.1109\/NCTM.2017.7872818"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05272-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-05272-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05272-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:47:23Z","timestamp":1710362843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-05272-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["5272"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-05272-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"2 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}