{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:18:25Z","timestamp":1737609505601,"version":"3.33.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:00:00Z","timestamp":1718064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:00:00Z","timestamp":1718064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Macao Science and Technology Development Funds","award":["0036\/2023\/RIA1"],"award-info":[{"award-number":["0036\/2023\/RIA1"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s13042-024-02226-z","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T07:01:51Z","timestamp":1718089311000},"page":"419-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting data reduction for boolean matrix factorization algorithms based on formal concept analysis"],"prefix":"10.1007","volume":"16","author":[{"given":"Lanzhen","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric C. C.","family":"Tsang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengling","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaming","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"2226_CR1","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R Wille","year":"1982","unstructured":"Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I (ed) Ordered Sets. Reidel, Dordrecht -Boston, pp 445\u2013470"},{"key":"2226_CR2","volume-title":"Formal concept analysis: foundations and applications","author":"B Ganter","year":"2005","unstructured":"Ganter B, Stumme G, Wille R (2005) Formal concept analysis: foundations and applications. Springer-Verlag"},{"issue":"2","key":"2226_CR3","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1515\/amcs-2016-0035","volume":"26","author":"PK Singh","year":"2016","unstructured":"Singh PK, Kumar CA, Gani A (2016) A comprehensive survey on formal concept analysis, its research trends and applications. Int J Appl Math Comput Sci 26(2):495\u2013516","journal-title":"Int J Appl Math Comput Sci"},{"issue":"5","key":"2226_CR4","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1080\/03081079.2017.1349575","volume":"46","author":"F Kriegel","year":"2017","unstructured":"Kriegel F (2017) Probabilistic implication bases in FCA and probabilistic bases of GCIs in. Int J Gen Syst 46(5):511\u2013546","journal-title":"Int J Gen Syst"},{"key":"2226_CR5","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.ins.2016.01.091","volume":"346","author":"Y Yao","year":"2016","unstructured":"Yao Y (2016) Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis. Inf Sci 346:442\u2013462","journal-title":"Inf Sci"},{"key":"2226_CR6","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.neucom.2021.08.160","volume":"496","author":"F Hao","year":"2022","unstructured":"Hao F, Sun Y, Lin Y (2022) Rough maximal cliques enumeration in incomplete graphs based on partially-known concept learning. Neurocomputing 496:96\u2013106","journal-title":"Neurocomputing"},{"key":"2226_CR7","volume":"260","author":"C Zhang","year":"2023","unstructured":"Zhang C, Tsang ECC, Xu W et al (2023) Incremental concept-cognitive learning approach for concept classification oriented to weighted fuzzy concepts. Knowl-Based Syst 260:110093","journal-title":"Knowl-Based Syst"},{"key":"2226_CR8","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s13042-016-0599-7","volume":"9","author":"L Wei","year":"2018","unstructured":"Wei L, Qian T, Wan Q et al (2018) A research summary about triadic concept analysis. Int J Mach Learn Cybern 9:699\u2013712","journal-title":"Int J Mach Learn Cybern"},{"issue":"3","key":"2226_CR9","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1109\/TFUZZ.2023.3325952","volume":"32","author":"D Guo","year":"2023","unstructured":"Guo D, Xu W, Qian Y et al (2023) Fuzzy-granular concept-cognitive learning via three-way decision: performance evaluation on dynamic knowledge discovery. IEEE Trans Fuzzy Syst 32(3):1409\u20131423","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"2226_CR10","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2023.110944","volume":"279","author":"J Konecny","year":"2023","unstructured":"Konecny J, Trnecka M (2023) Boolean matrix factorization for symmetric binary variables. Knowl-Based Syst 279:110944","journal-title":"Knowl-Based Syst"},{"key":"2226_CR11","doi-asserted-by":"crossref","DOI":"10.1016\/j.datak.2022.102104","volume":"143","author":"M Felde","year":"2023","unstructured":"Felde M, Stumme G (2023) Interactive collaborative exploration using incomplete contexts. Data Knowl Eng 143:102104","journal-title":"Data Knowl Eng"},{"issue":"9","key":"2226_CR12","doi-asserted-by":"crossref","first-page":"3263","DOI":"10.1109\/TFUZZ.2023.3250955","volume":"31","author":"X Zhang","year":"2023","unstructured":"Zhang X, Chen D, Mi J (2023) Fuzzy decision rule-Based online classification algorithm in fuzzy formal decision contexts. IEEE Trans Fuzzy Syst 31(9):3263\u20133277","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"2226_CR13","volume":"290","author":"J Wu","year":"2024","unstructured":"Wu J, sang ECC, Xu W  et al (2024) Correlation concept-cognitive learning model for multi-label classification. Knowl-Based Syst 290:111566","journal-title":"Knowl-Based Syst"},{"key":"2226_CR14","volume":"100","author":"D Guo","year":"2023","unstructured":"Guo D, Xu W, Qian Y et al (2023) M-FCCL: memory-based concept-cognitive learning for dynamic fuzzy data classification and knowledge fusion. Inf Fusion 100:101962","journal-title":"Inf Fusion"},{"key":"2226_CR15","volume":"109","author":"D Guo","year":"2024","unstructured":"Guo D, Xu W, Ding W et al (2024) Concept-cognitive learning survey: mining and fusing knowledge from Data. Inf Fusion 109:102426","journal-title":"Inf Fusion"},{"key":"2226_CR16","volume":"639","author":"D Guo","year":"2023","unstructured":"Guo D, Xu W (2023) Fuzzy-based concept-cognitive learning: an investigation of novel approach to tumor diagnosis analysis. Inf Sci 639:118998","journal-title":"Inf Sci"},{"issue":"10","key":"2226_CR17","doi-asserted-by":"crossref","first-page":"6798","DOI":"10.1109\/TNNLS.2023.3235800","volume":"34","author":"W Xu","year":"2023","unstructured":"Xu W, Guo D, Mi J et al (2023) Two-way concept-cognitive learning via concept movement viewpoint. IEEE Trans Neural Netw Learn Syst 34(10):6798\u20136812","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2226_CR18","volume":"268","author":"Q Hu","year":"2023","unstructured":"Hu Q, Yuan Z, Qin K et al (2023) A novel outlier detection approach based on formal concept analysis. Knowl-Based Syst 268:110486","journal-title":"Knowl-Based Syst"},{"key":"2226_CR19","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s13042-019-00987-6","volume":"11","author":"X Chen","year":"2020","unstructured":"Chen X, Qi J, Zhu X et al (2020) Unlabelled text mining methods based on two extension models of concept lattices. Int J Mach Learn Cybern 11:475\u2013490","journal-title":"Int J Mach Learn Cybern"},{"key":"2226_CR20","volume":"164","author":"HE Salman","year":"2023","unstructured":"Salman HE (2023) Leveraging a combination of machine learning and formal concept analysis to locate the implementation of features in software variants. Inf Softw Technol 164:107320","journal-title":"Inf Softw Technol"},{"key":"2226_CR21","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2023.04.011","volume":"179","author":"A Khaund","year":"2023","unstructured":"Khaund A, Sharma AM, Tiwari A et al (2023) RD-FCA: a resilient distributed framework for formal concept analysis. J Parallel Distrib Comput 179:104710","journal-title":"J Parallel Distrib Comput"},{"key":"2226_CR22","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.ins.2021.07.031","volume":"578","author":"F Hao","year":"2021","unstructured":"Hao F, Yang Y, Min G, Loia V (2021) Incremental construction of three-way concept lattice for knowledge discovery in social networks. Inf Sci 578:257\u2013280","journal-title":"Inf Sci"},{"issue":"5","key":"2226_CR23","first-page":"5126","volume":"53","author":"M Fan","year":"2023","unstructured":"Fan M, Luo S, Li J (2023) Network rule extraction under the network formal context based on three-way decision. Appl Intell 53(5):5126\u20135145","journal-title":"Appl Intell"},{"key":"2226_CR24","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119818","volume":"655","author":"C Zhang","year":"2024","unstructured":"Zhang C, Tsang ECC, Xu W et al (2024) Dynamic updating variable precision three-way concept method based on two-way concept-cognitive learning in fuzzy formal contexts. Inf Sci 655:119818","journal-title":"Inf Sci"},{"key":"2226_CR25","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121449","volume":"237","author":"C Rungruang","year":"2024","unstructured":"Rungruang C, Riyapan P, Intarasit A et al (2024) RFM model customer segmentation based on hierarchical approach using FCA. Expert Syst Appl 237:121449","journal-title":"Expert Syst Appl"},{"doi-asserted-by":"crossref","unstructured":"Witten IH, Frank E, Hall MA (2011) Data mining: practical machine learning tools and techniques (3rd ed.). Morgan Kaufmann","key":"2226_CR26","DOI":"10.1016\/B978-0-12-374856-0.00001-8"},{"key":"2226_CR27","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2011","unstructured":"Han J, Kamber M, Pei J (2011) Data mining: concepts and techniques, 3rd edn. Elsevier","edition":"3"},{"unstructured":"Kelleher JD, Mac Namee B, D\u2019Arcy A (2015) Fundamentals of machine learning for predictive data analytics: algorithms, worked examples, and case studies. MIT Press","key":"2226_CR28"},{"unstructured":"Van Der Maaten L, Postma E, Van den Herik J (2008) Dimensionality Reduction: a comparative review. Tilburg University Technical Report","key":"2226_CR29"},{"key":"2226_CR30","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.inffus.2020.01.005","volume":"59","author":"S Ayesha","year":"2020","unstructured":"Ayesha S, Hanif MK, Talib R (2020) Overview and comparative study of dimensionality reduction techniques for high dimensional data. Inf Fusion 59:44\u201358","journal-title":"Inf Fusion"},{"key":"2226_CR31","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107353","volume":"107","author":"Z Yuan","year":"2021","unstructured":"Yuan Z, Chen H, Xie P et al (2021) Attribute reduction methods in fuzzy rough set theory: an overview, comparative experiments, and new directions. Appl Soft Comput 107:107353","journal-title":"Appl Soft Comput"},{"issue":"4","key":"2226_CR32","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho DL (2006) Compressed sensing. IEEE Trans Inf Theory 52(4):1289\u20131306","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"2226_CR33","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0888-613X(96)00074-6","volume":"15","author":"MR Chmielewski","year":"1996","unstructured":"Chmielewski MR, Grzymala-Busse JW (1996) Global discretization of continuous attributes as preprocessing for machine learning. Int J Approx Reason 15(4):319\u2013331","journal-title":"Int J Approx Reason"},{"key":"2226_CR34","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon I, Elisseeff A (2003) An introduction to variable and feature selection. J Mach Learn Res 3:1157\u20131182","journal-title":"J Mach Learn Res"},{"key":"2226_CR35","first-page":"1","volume":"20","author":"H Liu","year":"2019","unstructured":"Liu H, Motoda H, Setiono R, Zhao Z (2019) Feature selection: an ever evolving frontier in data mining. J Mach Learn Res 20:1\u201339","journal-title":"J Mach Learn Res"},{"issue":"3","key":"2226_CR36","doi-asserted-by":"crossref","first-page":"2663","DOI":"10.1007\/s40747-021-00637-x","volume":"8","author":"W Jia","year":"2022","unstructured":"Jia W, Sun M, Lian J, Hou S (2022) Feature dimensionality reduction: a review. Complex Intell Syst 8(3):2663\u20132693","journal-title":"Complex Intell Syst"},{"issue":"6","key":"2226_CR37","doi-asserted-by":"crossref","first-page":"1896","DOI":"10.1109\/TEVC.2023.3238420","volume":"27","author":"B Ahadzadeh","year":"2023","unstructured":"Ahadzadeh B, Abdar M, Safara F et al (2023) SFE: a simple, fast and efficient feature selection algorithm for high-dimensional data. IEEE Trans Evol Comput 27(6):1896\u20131911","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"2226_CR38","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/j.ins.2003.06.013","volume":"163","author":"S Elloumi","year":"2004","unstructured":"Elloumi S, Jaam J, Hasnah A et al (2004) A multi-level conceptual data reduction approach based on the Lukasiewicz implication. Inf Sci 163(4):253\u2013262","journal-title":"Inf Sci"},{"key":"2226_CR39","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.knosys.2014.08.020","volume":"71","author":"J Li","year":"2014","unstructured":"Li J, Mei C, Wang J et al (2014) Rule-preserved object compression in formal decision contexts using concept lattices. Knowl-Based Syst 71:435\u2013445","journal-title":"Knowl-Based Syst"},{"key":"2226_CR40","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.knosys.2018.05.035","volume":"158","author":"M Trnecka","year":"2018","unstructured":"Trnecka M, Trneckova M (2018) Data reduction for Boolean matrix factorization algorithms based on formal concept analysis. Knowl-Based Syst 158:75\u201380","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"2226_CR41","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","volume":"76","author":"R Belohlavek","year":"2010","unstructured":"Belohlavek R, Vychodil V (2010) Discovery of optimal factors in binary data via a novel method of matrix decomposition. J Comput Syst Sci 76(1):3\u201320","journal-title":"J Comput Syst Sci"},{"issue":"8","key":"2226_CR42","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1016\/j.jcss.2015.06.002","volume":"81","author":"R Belohlavek","year":"2015","unstructured":"Belohlavek R, Trnecka M (2015) From-below approximations in Boolean matrix factorization: geometry and new algorithm. J Comput Syst Sci 81(8):1678\u20131697","journal-title":"J Comput Syst Sci"},{"issue":"10","key":"2226_CR43","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen P, Mielik\u00e4inen T, Gionis A et al (2008) The discrete basis problem. IEEE Trans Knowl Data Eng 20(10):1348\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2226_CR44","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1007\/s10618-017-0508-z","volume":"31","author":"S Hess","year":"2017","unstructured":"Hess S, Morik K, Piatkowski N (2017) The PRIMPING routine-Tiling through proximal alternating linearized minimization. Data Min Knowl Disc 31:1090\u20131131","journal-title":"Data Min Knowl Disc"},{"unstructured":"Ravanbakhsh S, P\u00f3czos B, Greiner R (2016) Boolean matrix factorization and noisy completion via message passing. International Conference on Machine Learning. PMLR, 945-954","key":"2226_CR45"},{"issue":"1","key":"2226_CR46","doi-asserted-by":"crossref","first-page":"21915","DOI":"10.1038\/s41598-022-24404-1","volume":"12","author":"B Han","year":"2022","unstructured":"Han B, Zhao N, Zeng C et al (2022) ACPred-BMF: bidirectional LSTM with multiple feature representations for explainable anticancer peptide prediction. Sci Rep 12(1):21915","journal-title":"Sci Rep"},{"key":"2226_CR47","volume-title":"The set basis problem is NP-complete, research reports","author":"LJ Stockmeyer","year":"1975","unstructured":"Stockmeyer LJ (1975) The set basis problem is NP-complete, research reports. IBM Thomas J, Watson Research Division"},{"key":"2226_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal concept analysis: mathematical foundations","author":"B Ganter","year":"1999","unstructured":"Ganter B, Wille R (1999) Formal concept analysis: mathematical foundations. Springer-Verlag"},{"issue":"2","key":"2226_CR49","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","volume":"11","author":"R Godin","year":"1995","unstructured":"Godin R, Missaoui R, Alaoui H (1995) Incremental concept formation algorithms based on Galois (concept) lattices. Comput Intell 11(2):246\u2013267","journal-title":"Comput Intell"},{"key":"2226_CR50","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10618-010-0203-9","volume":"23","author":"Y Xiang","year":"2011","unstructured":"Xiang Y, Jin R, Fuhry D et al (2011) Summarizing transactional databases with overlapped hyperrectangles. Data Min Knowl Disc 23:215\u2013251","journal-title":"Data Min Knowl Disc"},{"issue":"12","key":"2226_CR51","doi-asserted-by":"crossref","first-page":"2900","DOI":"10.1109\/TKDE.2013.181","volume":"26","author":"C Lucchese","year":"2014","unstructured":"Lucchese C, Orlando S, Perego R (2014) A unifying framework for mining approximate top-$$k$$ binary patterns. IEEE Trans Knowl Data Eng 26(12):2900\u20132913","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2226_CR52","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.ins.2016.03.009","volume":"355","author":"A Mouakher","year":"2016","unstructured":"Mouakher A, Yahia SB (2016) QualityCover: efficient binary relation coverage guided by induced knowledge quality. Inf Sci 355:58\u201373","journal-title":"Inf Sci"},{"issue":"13","key":"2226_CR53","doi-asserted-by":"crossref","first-page":"4030","DOI":"10.1093\/bioinformatics\/btz977","volume":"36","author":"L Liang","year":"2020","unstructured":"Liang L, Zhu K, Lu S (2020) BEM: mining coregulation patterns in transcriptomics via boolean matrix factorization. Bioinformatics 36(13):4030\u20134037","journal-title":"Bioinformatics"},{"key":"2226_CR54","volume-title":"BMDP statistical software manual: to accompany BMDP release 7","author":"WJ Dixon","year":"1992","unstructured":"Dixon WJ (1992) BMDP statistical software manual: to accompany BMDP release 7. University of California Press"},{"unstructured":"Sch\u00fctt D (1987) Absch\u00e4tzungen f\u00fcr die Anzahl der Begriffe von Kontexten. Master\u2019s Thesis, TH Darmstadt","key":"2226_CR55"},{"issue":"4","key":"2226_CR56","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1013970520933","volume":"18","author":"S Kuznetsov","year":"2001","unstructured":"Kuznetsov S (2001) On computing the size of a lattice and related decision problems. Order 18(4):313\u2013321","journal-title":"Order"},{"issue":"1","key":"2226_CR57","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s004930070035","volume":"20","author":"E Prisner","year":"2000","unstructured":"Prisner E (2000) Bicliques in graphs I: bounds on their number. Combinatorica 20(1):109\u2013117","journal-title":"Combinatorica"},{"issue":"2","key":"2226_CR58","doi-asserted-by":"crossref","first-page":"983","DOI":"10.18514\/MMN.2018.2529","volume":"19","author":"L Kov\u00e1cs","year":"2018","unstructured":"Kov\u00e1cs L (2018) Efficient approximation for counting of formal concepts generated from FCA context. Miskolc Math Notes 19(2):983\u2013996","journal-title":"Miskolc Math Notes"},{"key":"2226_CR59","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ins.2021.07.065","volume":"578","author":"T Sakurai","year":"2021","unstructured":"Sakurai T (2021) On formal concepts of random formal contexts. Inf Sci 578:615\u2013620","journal-title":"Inf Sci"},{"key":"2226_CR60","first-page":"31","volume":"96","author":"JP Bordat","year":"1986","unstructured":"Bordat JP (1986) Calcul pratique du treillis de Galois d\u2019une Correspondence. Math Sci Hum 96:31\u201347","journal-title":"Math Sci Hum"},{"key":"2226_CR61","doi-asserted-by":"crossref","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"},{"unstructured":"Andrews S (2009) In-close, a fast algorithm for computing formal concepts. In: ICCS supplementary proceedings, Springer, 483","key":"2226_CR62"},{"issue":"9","key":"2226_CR63","doi-asserted-by":"crossref","first-page":"4474","DOI":"10.1016\/j.eswa.2015.01.044","volume":"42","author":"LL Zou","year":"2015","unstructured":"Zou LL, Zhang Z, Long JJ (2015) A fast incremental algorithm for constructing concept lattices. Expert Syst Appl 42(9):4474\u20134481","journal-title":"Expert Syst Appl"},{"issue":"3","key":"2226_CR64","doi-asserted-by":"crossref","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 et al (2009) An incremental algorithm to construct a lattice of set intersections. Sci Comput Program 74(3):128\u2013142","journal-title":"Sci Comput Program"},{"key":"2226_CR65","doi-asserted-by":"crossref","first-page":"2582","DOI":"10.1007\/s10489-024-05272-w","volume":"54","author":"Y Ke","year":"2024","unstructured":"Ke Y, Li J, Li S (2024) Bit-Close: a fast incremental concept calculation method. Appl Intell 54:2582\u20132593","journal-title":"Appl Intell"},{"key":"2226_CR66","volume-title":"Modern factor analysis","author":"HH Harman","year":"1970","unstructured":"Harman HH (1970) Modern factor analysis, 2nd edn. The University of Chicago Press, Chicago","edition":"2"},{"key":"2226_CR67","volume-title":"Discrete mathematics and its applications","author":"KH Rosen","year":"2011","unstructured":"Rosen KH (2011) Discrete mathematics and its applications, 7th edn. McGraw Hill","edition":"7"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02226-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02226-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02226-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T07:40:54Z","timestamp":1737531654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02226-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,11]]},"references-count":67,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2226"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02226-z","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2024,6,11]]},"assertion":[{"value":"24 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2024","order":3,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}