{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:32Z","timestamp":1740160292007,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:00:00Z","timestamp":1649030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:00:00Z","timestamp":1649030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976089"],"award-info":[{"award-number":["61976089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of\u00a0Hunan Province","doi-asserted-by":"publisher","award":["2021JJ40361","2021JJ30451"],"award-info":[{"award-number":["2021JJ40361","2021JJ30451"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002767","name":"Hunan Provincial Science and Technology Department","doi-asserted-by":"publisher","award":["2018TP1018","2018RS3065"],"award-info":[{"award-number":["2018TP1018","2018RS3065"]}],"id":[{"id":"10.13039\/501100002767","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s13042-022-01547-1","type":"journal-article","created":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:02:33Z","timestamp":1649044953000},"page":"2637-2648","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing formal concepts in parallel via a workload rebalance approach"],"prefix":"10.1007","volume":"13","author":[{"given":"Ligeng","family":"Zou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaozhi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingting","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1459-0833","authenticated-orcid":false,"given":"Jianhua","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"key":"1547_CR1","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-22688-5_4","volume-title":"Conceptual structures for discovering knowledge","author":"S Andrews","year":"2011","unstructured":"Andrews S (2011) In-close2, a high performance formal concept miner. In: Andrews S, Polovina S, Hill R, Akhgar B (eds) Conceptual structures for discovering knowledge. Springer, pp 50\u201362"},{"key":"1547_CR2","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.ins.2014.10.011","volume":"295","author":"S Andrews","year":"2015","unstructured":"Andrews S (2015) A \u2018Best-of-Breed\u2019 approach for designing a fast algorithm for computing fixpoints of Galois Connections. Inf Sci 295:633\u2013649","journal-title":"Inf Sci"},{"key":"1547_CR3","doi-asserted-by":"crossref","unstructured":"Andrews S (2017) Making Use of Empty Intersections to Improve the Performance of CbO-Type Algorithms. In: Proceedings of the 14th international conference on formal concept analysis. Springer, pp 56\u201371","DOI":"10.1007\/978-3-319-59271-8_4"},{"key":"1547_CR4","unstructured":"Andrews S (2018) A new method for inheriting canonicity test failures in Close-by-One type algorithms. In: Proceedings of the 14th international conference on concept lattices and their applications. Springer, pp 255\u2013266"},{"key":"1547_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-14197-3_18","volume-title":"Conceptual structures: from information to intelligence","author":"S Andrews","year":"2010","unstructured":"Andrews S, Orphanides C (2010) FcaBedrock, a Formal Context Creator. In: Croitoru M, Ferr\u00e9 S, Lukose D (eds) Conceptual structures: from information to intelligence. Springer, New York, pp 181\u2013184"},{"key":"1547_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2019.03.001","volume":"489","author":"R Belohlavek","year":"2019","unstructured":"Belohlavek R, Outrata J, Trnecka M (2019) Factorizing Boolean matrices using formal concepts and iterative usage of essential entries. Inf Sci 489:37\u201349","journal-title":"Inf Sci"},{"issue":"6","key":"1547_CR7","first-page":"651","volume":"2","author":"H Dong","year":"2008","unstructured":"Dong H, Ma Y, Gong X (2008) A new parallel algorithm for construction of concept lattice. J Front Comput Sci Technol 2(6):651\u2013657","journal-title":"J Front Comput Sci Technol"},{"key":"1547_CR8","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml. Accessed 21 June 2021"},{"key":"1547_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-11928-6_22","volume-title":"Formal concept analysis","author":"B Ganter","year":"2010","unstructured":"Ganter B (2010) Two basic algorithms in concept analysis. In: Kwuida L, Sertkaya B (eds) Formal concept analysis. Springer, New York, pp 312\u2013340"},{"key":"1547_CR10","doi-asserted-by":"publisher","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, New York"},{"key":"1547_CR11","doi-asserted-by":"publisher","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 lattices. Comput Intell 11:246\u2013267","journal-title":"Comput Intell"},{"key":"1547_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-021-01309-5","author":"L Guo","year":"2021","unstructured":"Guo L, Jia Z, Li Q, Dai J (2021) Steadiness analysis of means-end conceptual paths and problem-chains based on concept lattices and similarity measuring. Int J Mach Learn Cyber. https:\/\/doi.org\/10.1007\/s13042-021-01309-5","journal-title":"Int J Mach Learn Cyber"},{"key":"1547_CR13","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1016\/j.ejor.2020.01.015","volume":"284","author":"R Janostik","year":"2020","unstructured":"Janostik R, Konecny J, Krajca P (2020) Interface between logical analysis of data and formal concept analysis. Eur J Oper Res 284:792\u2013800","journal-title":"Eur J Oper Res"},{"key":"1547_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.ins.2014.12.010","volume":"298","author":"J Li","year":"2015","unstructured":"Li J, Mei C, Xu W, Qian Y (2015) Concept learning via granular computing: a cognitive viewpoint. Inf Sci 298:447\u2013467","journal-title":"Inf Sci"},{"key":"1547_CR15","doi-asserted-by":"crossref","unstructured":"Kengue JFD, Valtchev P, Djamegni CT (2005) A parallel algorithm for lattice construction. In: Proceedings of the International conference on formal concept analysis. Springer, pp 249\u2013264","DOI":"10.1007\/978-3-540-32262-7_17"},{"key":"1547_CR16","doi-asserted-by":"crossref","unstructured":"Kodagoda N, Andrews S, Pulasinghe K (2017) A parallel version of the in-close algorithm. In: Proceedings of 6th national conference on technology and management, vol 7872818, pp\u00a01\u20135","DOI":"10.1109\/NCTM.2017.7872818"},{"key":"1547_CR17","first-page":"1","volume":"4","author":"N Kodagoda","year":"2016","unstructured":"Kodagoda N, Pulasinghe K (2016) Comparision between features of CbO based algorithms for generating formal concepts. Int J Concept Struct Smart Appl 4:1\u201334","journal-title":"Int J Concept Struct Smart Appl"},{"key":"1547_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.ins.2021.06.024","volume":"575","author":"J Konecny","year":"2021","unstructured":"Konecny J, Krajca P (2021) Systematic categorization and evaluation of CbO-based algorithms in FCA. Inf Sci 575:265\u2013288","journal-title":"Inf Sci"},{"key":"1547_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10472-010-9199-5","volume":"59","author":"P Krajca","year":"2010","unstructured":"Krajca P, Outrata J, Vychodil V (2010) Parallel algorithm for computing fixpoints of Galois connections. Ann Math Artif Intell 59:257\u2013272","journal-title":"Ann Math Artif Intell"},{"key":"1547_CR20","unstructured":"Krajca P, Outrata J, Vychodil V (2010) Advances in algorithms based on CbO. In: Proceedings of the 7th international conference on concept lattices and their applications, pp 325\u2013337"},{"key":"1547_CR21","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-03915-7_29","volume-title":"Advances in intelligent data analysis VIII","author":"P Krajca","year":"2009","unstructured":"Krajca P, Vychodil V (2009) Distributed algorithm for computing formal concepts using map-reduce framework. In: Adams NM, Robardet C, Siebes A, Boulicaut J-F (eds) Advances in intelligent data analysis VIII. Springer, New York, pp 333\u2013344"},{"key":"1547_CR22","unstructured":"Kuznetsov SO (1989) Interpretation on graphs and complexity characteristics of a search for specific patterns. Nauchno-Tekhnicheskaya Informatsiya, seriya 2 Informatsionnye protsessy i sistemy 23(1):23\u201327"},{"key":"1547_CR23","unstructured":"Kuznetsov SO (1993) A fast algorithm for computing all intersections of objects in a finite semi-lattice. Nauchno-Tekhnicheskaya Informatsiya, seriya 2 Informatsionnye protsessy i sistemy 27(1):17\u201320"},{"key":"1547_CR24","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1007\/BF02362847","volume":"80","author":"SO Kuznetsov","year":"1996","unstructured":"Kuznetsov SO (1996) Mathematical aspects of concept analysis. J Math Sci 80:1654\u20131698","journal-title":"J Math Sci"},{"key":"1547_CR25","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-48247-5_47","volume-title":"Principles of data mining and knowledge discovery","author":"SO Kuznetsov","year":"1999","unstructured":"Kuznetsov SO (1999) Learning of simple conceptual graphs from positive and negative examples. In: \u017bytkow JM, Rauch J (eds) Principles of data mining and knowledge discovery. Springer, Berlin, pp 384\u2013391"},{"key":"1547_CR26","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/A:1013970520933","volume":"18","author":"SO Kuznetsov","year":"2001","unstructured":"Kuznetsov SO (2001) On computing the size of a lattice and related decision problems. Order 18:313\u2013321","journal-title":"Order"},{"key":"1547_CR27","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"SO Kuznetsov","year":"2002","unstructured":"Kuznetsov SO, Obiedkov SA (2002) Comparing performance of algorithms for generating concept lattices. J Exp Theor Artif Intell 14:189\u2013216","journal-title":"J Exp Theor Artif Intell"},{"key":"1547_CR28","doi-asserted-by":"publisher","first-page":"114678","DOI":"10.1016\/j.eswa.2021.114678","volume":"173","author":"SE Kwon","year":"2021","unstructured":"Kwon SE, Kim YT, Suh H, Lee H (2021) Identifying the mobile application repertoire based on weighted formal concept analysis. Expert Syst Appl 173:114678","journal-title":"Expert Syst Appl"},{"key":"1547_CR29","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ijar.2016.08.007","volume":"80","author":"J Li","year":"2017","unstructured":"Li J, Aswani Kumar C, Mei C, Wang X (2017) Comparison of reduction in formal decision contexts. Int J Approx Reason 80:100\u2013122","journal-title":"Int J Approx Reason"},{"key":"1547_CR30","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s13042-016-0587-y","volume":"8","author":"X Li","year":"2017","unstructured":"Li X, Shao M-W, Zhao X-M (2017) Constructing lattice based on irreducible concepts. Int J Mach Learn Cyber 8:109\u2013122","journal-title":"Int J Mach Learn Cyber"},{"key":"1547_CR31","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s13042-016-0576-1","volume":"8","author":"J-M Ma","year":"2017","unstructured":"Ma J-M, Cai M-J, Zou C-J (2017) Concept acquisition approach of object-oriented concept lattices. Int J Mach Learn Cyber 8:123\u2013134","journal-title":"Int J Mach Learn Cyber"},{"key":"1547_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2980794","author":"Y Mi","year":"2020","unstructured":"Mi Y, Shi Y, Li J, Liu W, Yan M (2020) Fuzzy-based concept learning method: exploiting data with fuzzy conceptual clustering. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2020.2980794","journal-title":"IEEE Trans Cybern"},{"key":"1547_CR33","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0020-0190(99)00108-8","volume":"71","author":"L Nourine","year":"1999","unstructured":"Nourine L, Raynaud O (1999) A fast algorithm for building lattices. Inf Process Lett 71:199\u2013204","journal-title":"Inf Process Lett"},{"key":"1547_CR34","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:114\u2013127","journal-title":"Inf Sci"},{"key":"1547_CR35","doi-asserted-by":"publisher","first-page":"6601","DOI":"10.1016\/j.eswa.2013.05.007","volume":"40","author":"J Poelmans","year":"2013","unstructured":"Poelmans J, Kuznetsov SO, Ignatov DI, Dedene G (2013) Formal concept analysis in knowledge processing: a survey on models and techniques. Expert Syst Appl 40:6601\u20136623","journal-title":"Expert Syst Appl"},{"key":"1547_CR36","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 Cyber 8:95\u2013108","journal-title":"Int J Mach Learn Cyber"},{"key":"1547_CR37","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s13042-019-00956-z","volume":"11","author":"K Qin","year":"2020","unstructured":"Qin K, Lin H, Jiang Y (2020) Local attribute reductions of formal contexts. Int J Mach Learn Cyber 11:81\u201393","journal-title":"Int J Mach Learn Cyber"},{"key":"1547_CR38","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ins.2019.05.009","volume":"496","author":"Y Shi","year":"2019","unstructured":"Shi Y, Mi Y, Li J, Liu W (2019) Concurrent concept-cognitive learning model for classification. Inf Sci 496:65\u201381","journal-title":"Inf Sci"},{"key":"1547_CR39","doi-asserted-by":"crossref","unstructured":"Strok F, Neznanov A (2010) Comparing and analyzing the computational complexity of FCA algorithms. In: Proceedings of the 2010 annual research conference of the South African institute of computer scientists and information technologists on. ACM Press, pp 417\u2013420","DOI":"10.1145\/1899503.1899557"},{"key":"1547_CR40","doi-asserted-by":"crossref","unstructured":"Van der Merwe D, Obiedkov S, Kourie D (2004) AddIntent: a new incremental algorithm for constructing concept lattices. In: Lecture notes in artificial intelligence, pp 205\u2013206","DOI":"10.1007\/978-3-540-24651-0_31"},{"key":"1547_CR41","doi-asserted-by":"publisher","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. Springer, New York, pp 445\u2013470"},{"key":"1547_CR42","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-29892-9_26","volume-title":"Formal concept analysis","author":"B Xu","year":"2012","unstructured":"Xu B, de Fr\u00e9in R, Robson E, Foghl\u00fa \u00d3 (2012) Distributed formal concept analysis algorithms based on an iterative MapReduce framework. In: Domenach F, Ignatov DI, Poelmans J (eds) Formal concept analysis. Springer, New York, pp 292\u2013308"},{"key":"1547_CR43","first-page":"3129","volume":"28","author":"T Zhang","year":"2017","unstructured":"Zhang T, Bai D, Li H (2017) Parallel concept computing based on bottom-up decomposition of attribute topology. J Softw 28:3129\u20133145","journal-title":"J Softw"},{"key":"1547_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-021-01332-6","author":"T Zhang","year":"2021","unstructured":"Zhang T, Rong M, Shan H, Liu M (2021) Stability analysis of incremental concept tree for concept cognitive learning. Int J Mach Learn Cyber. https:\/\/doi.org\/10.1007\/s13042-021-01332-6","journal-title":"Int J Mach Learn Cyber"},{"key":"1547_CR45","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2967644","author":"S Zhao","year":"2020","unstructured":"Zhao S, Pan G, Tao J, Luo Z, Li S, Wu Z (2020) Understanding smartphone users from installed app lists using boolean matrix factorization. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2020.2967644","journal-title":"IEEE Trans Cybern"},{"key":"1547_CR46","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:4474\u20134481","journal-title":"Expert Syst Appl"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-022-01547-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-022-01547-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-022-01547-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T10:56:34Z","timestamp":1659092194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-022-01547-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,4]]},"references-count":46,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1547"],"URL":"https:\/\/doi.org\/10.1007\/s13042-022-01547-1","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2022,4,4]]},"assertion":[{"value":"27 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}