{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T01:15:52Z","timestamp":1768094152404,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Factorizing datasets is an interesting process in a multitude of approaches, but many times it is not possible or efficient the computation of a factorization of the dataset. A method to obtain independent subcontexts of a formal context with Boolean data was proposed in Dubois and Prade based on the operators used in possibility theory. In this paper, we will analyze this method and study different properties related to the pairs of sets from which a factorization of a formal context arises. We also inspect how the properties given in the classical case can be extended to the fuzzy framework, which is essential to obtain a mechanism that allows the computation of independent subcontexts of a fuzzy context.<\/jats:p>","DOI":"10.1007\/s40314-024-02590-0","type":"journal-article","created":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T11:02:34Z","timestamp":1711191754000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Factorizing formal contexts from closures of necessity operators"],"prefix":"10.1007","volume":"43","author":[{"given":"Roberto G.","family":"Arag\u00f3n","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3931-5873","authenticated-orcid":false,"given":"Jes\u00fas","family":"Medina","sequence":"additional","affiliation":[]},{"given":"Elo\u00edsa","family":"Ram\u00edrez-Poussa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,23]]},"reference":[{"key":"2590_CR1","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1109\/TFUZZ.2020.2969114","volume":"29","author":"L Antoni","year":"2021","unstructured":"Antoni L, Cornejo ME, Medina J, Ramirez E (2021) Attribute classification and reduct computation in multi-adjoint concept lattices. IEEE Trans Fuzzy Syst 29:1121\u20131132","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"2590_CR2","first-page":"107","volume":"1601","author":"RG Arag\u00f3n","year":"2022","unstructured":"Arag\u00f3n RG, Medina J, Ram\u00edrez-Poussa E (2022) Study on the necessity operator to factorize formal contexts in a multi-adjoint framework. Commun Comput Inf Sci 1601:107\u2013117","journal-title":"Commun Comput Inf Sci"},{"key":"2590_CR3","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.ins.2023.02.002","volume":"629","author":"E Bartl","year":"2023","unstructured":"Bartl E, B\u011blohl\u00e1vek R (2023) Avoiding flatness in factoring ordinal data. Inf Sci 629:471\u2013487","journal-title":"Inf Sci"},{"issue":"8","key":"2590_CR4","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1016\/j.jcss.2015.06.002","volume":"81","author":"R B\u011blohl\u00e1vek","year":"2015","unstructured":"B\u011blohl\u00e1vek 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"},{"key":"2590_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.dam.2017.12.044","volume":"249","author":"R B\u011blohl\u00e1vek","year":"2018","unstructured":"B\u011blohl\u00e1vek R, Trnecka M (2018) A new algorithm for boolean matrix factorization which admits overcovering. Discret Appl Math 249:36\u201352","journal-title":"Discret Appl Math"},{"key":"2590_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.fss.2018.07.004","volume":"360","author":"R B\u011blohl\u00e1vek","year":"2019","unstructured":"B\u011blohl\u00e1vek R, Trneckova M (2019) Factorization of matrices with grades via essential entries. Fuzzy Sets Syst 360:97\u2013116","journal-title":"Fuzzy Sets Syst"},{"key":"2590_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.matcom.2014.08.004","volume":"109","author":"AK Ch","year":"2015","unstructured":"Ch AK, Dias SM, Vieira NJ (2015) Knowledge reduction in formal contexts using non-negative matrix factorization. Math Comput Simul 109:46\u201363","journal-title":"Math Comput Simul"},{"issue":"1","key":"2590_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2007.08.011","volume":"178","author":"Y Chen","year":"2008","unstructured":"Chen Y, Yao Y (2008) A multiview approach for intelligent data analysis based on data operators. Inf Sci 178(1):1\u201320","journal-title":"Inf Sci"},{"key":"2590_CR9","doi-asserted-by":"crossref","unstructured":"Chi X-J, Song Y-B, Liu D-H, Wei L-Q, An X, Feng Z-Z, Lan X-H, Lan D, Huang C (2023) Significance of platelet adhesion-related genes in colon cancer based on non-negative matrix factorization-based clustering algorithm. Digital Health, 9. Cited by: 0; All Open Access, Gold Open Access","DOI":"10.1177\/20552076231203902"},{"key":"2590_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.fss.2012.05.004","volume":"211","author":"ME Cornejo","year":"2013","unstructured":"Cornejo ME, Medina J, Ram\u00edrez-Poussa E (2013) A comparative study of adjoint triples. Fuzzy Sets Syst 211:1\u201314","journal-title":"Fuzzy Sets Syst"},{"key":"2590_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2014.09.033","volume":"294","author":"ME Cornejo","year":"2015","unstructured":"Cornejo ME, Medina J, Ram\u00edrez-Poussa E (2015) Attribute reduction in multi-adjoint concept lattices. Inf Sci 294:41\u201356","journal-title":"Inf Sci"},{"issue":"2L","key":"2590_CR12","first-page":"365","volume":"9","author":"ME Cornejo","year":"2015","unstructured":"Cornejo ME, Medina J, Ram\u00edrez-Poussa E (2015) Multi-adjoint algebras versus extended-order algebras. Appl Math Inf Sci 9(2L):365\u2013372","journal-title":"Appl Math Inf Sci"},{"key":"2590_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ijar.2015.08.003","volume":"66","author":"ME Cornejo","year":"2015","unstructured":"Cornejo ME, Medina J, Ram\u00edrez-Poussa E (2015) Multi-adjoint algebras versus non-commutative residuated structures. Int J Approx Reason 66:119\u2013138","journal-title":"Int J Approx Reason"},{"key":"2590_CR14","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.ins.2017.08.099","volume":"422","author":"ME Cornejo","year":"2018","unstructured":"Cornejo ME, Medina J, Ram\u00edrez-Poussa E (2018) Characterizing reducts in multi-adjoint concept lattices. Inf Sci 422:364\u2013376","journal-title":"Inf Sci"},{"key":"2590_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to lattices and order","author":"B Davey","year":"2002","unstructured":"Davey B, Priestley H (2002) Introduction to lattices and order, second edition. Cambridge University Press, Cambridge","edition":"second edition"},{"issue":"1\u20134","key":"2590_CR16","first-page":"195","volume":"75","author":"D Dubois","year":"2007","unstructured":"Dubois D, de Saint-Cyr FD, Prade H (2007) A possibility-theoretic view of formal concept analysis. Fund Inform 75(1\u20134):195\u2013213","journal-title":"Fund Inform"},{"key":"2590_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ins.2020.12.085","volume":"561","author":"D Dubois","year":"2021","unstructured":"Dubois D, Medina J, Prade H, Ram\u00edrez-Poussa E (2021) Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts. Inf Sci 561:31\u201351","journal-title":"Inf Sci"},{"key":"2590_CR18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.fss.2011.02.008","volume":"196","author":"D Dubois","year":"2012","unstructured":"Dubois D, Prade H (2012) Possibility theory and formal concept analysis: Characterizing independent sub-contexts. Fuzzy Sets Syst 196:4\u201316","journal-title":"Fuzzy Sets Syst"},{"key":"2590_CR19","doi-asserted-by":"crossref","unstructured":"Ene A, Horne W, Milosavljevic N, Rao P, Schreiber R, Tarjan RE (2008) Fast exact and heuristic methods for role minimization problems. In: Proceedings of the 13th ACM Symposium on Access Control Models and Technologies, SACMAT \u201908, pages 1\u201310, New York, NY, USA. Association for Computing Machinery","DOI":"10.1145\/1377836.1377838"},{"issue":"3","key":"2590_CR20","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/320557.320571","volume":"2","author":"R Fagin","year":"1977","unstructured":"Fagin R (1977) Multivalued dependencies and a new normal form for relational databases. ACM Trans Database Syst 2(3):262\u2013278","journal-title":"ACM Trans Database Syst"},{"key":"2590_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal concept analysis: mathematical foundation","author":"B Ganter","year":"1999","unstructured":"Ganter B, Wille R (1999) Formal concept analysis: mathematical foundation. Springer, New York"},{"key":"2590_CR22","unstructured":"Gediga G, D\u00fcntsch I (2002) Modal-style operators in qualitative data analysis. In: Proceedings of IEEE International Conference on Data Mining, pp 155\u2013162"},{"issue":"8","key":"2590_CR23","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1007\/s00153-004-0240-4","volume":"43","author":"G Georgescu","year":"2004","unstructured":"Georgescu G, Popescu A (2004) Non-dual fuzzy connections. Arch Math Log 43(8):1009\u20131039","journal-title":"Arch Math Log"},{"issue":"6","key":"2590_CR24","doi-asserted-by":"publisher","first-page":"3534","DOI":"10.1109\/LRA.2023.3268598","volume":"8","author":"S Gugliermo","year":"2023","unstructured":"Gugliermo S, Schaffernicht E, Koniaris C, Pecora F (2023) Learning behavior trees from planning experts using decision tree and logic factorization. IEEE Robot Autom Lett 8(6):3534\u20133541","journal-title":"IEEE Robot Autom Lett"},{"key":"2590_CR25","doi-asserted-by":"crossref","unstructured":"Heath IJ (1971) Unacceptable file operations in a relational data base. In Proceedings of the 1971 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control, SIGFIDET \u201971, pages 19\u201333, New York, NY, USA. Association for Computing Machinery","DOI":"10.1145\/1734714.1734717"},{"key":"2590_CR26","doi-asserted-by":"crossref","unstructured":"Jones TH, Song I-Y, Park EK (1996) Ternary relationship decomposition and higher normal form structures derived from entity relationship conceptual modeling. In: Proceedings of the 1996 ACM 24th Annual Conference on Computer Science, CSC \u201996, pp 96\u2013104, New York, NY, USA. Association for Computing Machinery","DOI":"10.1145\/228329.228340"},{"key":"2590_CR27","doi-asserted-by":"crossref","unstructured":"K\u00f6me C (2023) Factorizations and eigenvalues of the $$(r, k)$$-bonacci matrices. Comput Appl Math 42(1185)","DOI":"10.1007\/s40314-023-02331-9"},{"key":"2590_CR28","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ijar.2023.03.003","volume":"157","author":"M Koyda","year":"2023","unstructured":"Koyda M, Stumme G (2023) Factorizing lattices by interval relations. Int J Approx Reason 157:70\u201387","journal-title":"Int J Approx Reason"},{"key":"2590_CR29","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ins.2022.05.047","volume":"606","author":"O Kr\u00eddlo","year":"2022","unstructured":"Kr\u00eddlo O, Antoni L, Kraj\u010di S (2022) Selection of appropriate bonds between $$l$$-fuzzy formal contexts for recommendation tasks. Inf Sci 606:21\u201337","journal-title":"Inf Sci"},{"key":"2590_CR30","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ins.2011.11.016","volume":"190","author":"J Medina","year":"2012","unstructured":"Medina J (2012) Multi-adjoint property-oriented and object-oriented concept lattices. Inf Sci 190:95\u2013106","journal-title":"Inf Sci"},{"issue":"6","key":"2590_CR31","doi-asserted-by":"publisher","first-page":"1992","DOI":"10.1016\/j.camwa.2012.03.087","volume":"64","author":"J Medina","year":"2012","unstructured":"Medina J (2012) Relating attribute reduction in formal, object-oriented and property-oriented concept lattices. Comput Math Appl 64(6):1992\u20132002","journal-title":"Comput Math Appl"},{"issue":"2","key":"2590_CR32","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.fss.2008.05.004","volume":"160","author":"J Medina","year":"2009","unstructured":"Medina J, Ojeda-Aciego M, Ruiz-Calvi\u00f1o J (2009) Formal concept analysis via multi-adjoint concept lattices. Fuzzy Sets Syst 160(2):130\u2013144","journal-title":"Fuzzy Sets Syst"},{"issue":"55","key":"2590_CR33","doi-asserted-by":"publisher","first-page":"7324","DOI":"10.1038\/sj.onc.1209717","volume":"25","author":"S Myllykangas","year":"2006","unstructured":"Myllykangas S, Himberg J, B\u00f6hling T, Nagy B, Hollm\u00e9n J, Knuutila S (2006) Dna copy number amplification profiling of human neoplasms. Oncogene 25(55):7324\u20137332","journal-title":"Oncogene"},{"key":"2590_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2022.12.014","volume":"463","author":"M Ojeda-Hern\u00e1ndez","year":"2023","unstructured":"Ojeda-Hern\u00e1ndez M, Cabrera IP, Cordero P, Mu\u00f1oz-Velasco E (2023) Fuzzy closure structures as formal concepts. Fuzzy Sets Syst 463:108458","journal-title":"Fuzzy Sets Syst"},{"key":"2590_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118092","volume":"208","author":"M Oliveira","year":"2022","unstructured":"Oliveira M, Queiroz S, de Carvalho F (2022) Unsupervised feature selection method based on iterative similarity graph factorization and clustering by modularity. Expert Syst Appl 208:118092","journal-title":"Expert Syst Appl"},{"key":"2590_CR36","doi-asserted-by":"publisher","first-page":"3283","DOI":"10.1007\/s40314-017-0513-2","volume":"37","author":"PK Singh","year":"2018","unstructured":"Singh PK (2018) Medical diagnoses using three-way fuzzy concept lattice and their euclidean distance. Comput Appl Math 37:3283\u20133306","journal-title":"Comput Appl Math"},{"key":"2590_CR37","doi-asserted-by":"crossref","unstructured":"Singh PK (2019) Single-valued neutrosophic context analysis at distinct multi-granulation. Comput Appl Math 38(80)","DOI":"10.1007\/s40314-019-0842-4"},{"key":"2590_CR38","doi-asserted-by":"publisher","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"},{"key":"2590_CR39","doi-asserted-by":"crossref","unstructured":"Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival, editor, Ordered Sets, pages 445\u2013470. Reidel","DOI":"10.1007\/978-94-009-7798-3_15"},{"key":"2590_CR40","doi-asserted-by":"crossref","unstructured":"Yao YY, Chen Y (2006) Rough set approximations in formal concept analysis. In Transactions on Rough Sets V, volume 4100 of Lecture Notes in Computer Science, pp 285\u2013305","DOI":"10.1007\/11847465_14"},{"key":"2590_CR41","doi-asserted-by":"crossref","unstructured":"Zhang X, Chen D, Mi J (2023) Fuzzy decision rule-based online classification algorithm in fuzzy formal decision contexts. IEEE Trans Fuzzy Syst, pp 1\u201315","DOI":"10.1109\/TFUZZ.2023.3250955"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02590-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02590-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02590-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T05:18:40Z","timestamp":1712553520000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02590-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,23]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2590"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02590-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,23]]},"assertion":[{"value":"14 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"124"}}