{"id":"https://openalex.org/W7138270950","doi":"https://doi.org/10.48550/arxiv.2603.13772","title":"GreCon3: Mitigating High Resource Utilization of GreCon Algorithms for Boolean Matrix Factorization","display_name":"GreCon3: Mitigating High Resource Utilization of GreCon Algorithms for Boolean Matrix Factorization","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138270950","doi":"https://doi.org/10.48550/arxiv.2603.13772"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.13772","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13772","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.13772","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040674482","display_name":"Petr Kraj\u010da","orcid":"https://orcid.org/0000-0003-4278-3130"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kraj\u010da, Petr","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051622668","display_name":"Martin Trne\u010dka","orcid":"https://orcid.org/0000-0001-7770-2033"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Trnecka, Martin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.7784000039100647,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.7784000039100647,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.03139999881386757,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10885","display_name":"Gene expression and cancer classification","score":0.022600000724196434,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.5504999756813049},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5410000085830688},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5037000179290771},{"id":"https://openalex.org/keywords/logical-matrix","display_name":"Logical matrix","score":0.48559999465942383},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.475600004196167},{"id":"https://openalex.org/keywords/remainder","display_name":"Remainder","score":0.4205000102519989},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.40700000524520874},{"id":"https://openalex.org/keywords/high-memory","display_name":"High memory","score":0.36570000648498535},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.33649998903274536}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.791700005531311},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5504999756813049},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5410000085830688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5342000126838684},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5037000179290771},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48669999837875366},{"id":"https://openalex.org/C163561899","wikidata":"https://www.wikidata.org/wiki/Q1994977","display_name":"Logical matrix","level":3,"score":0.48559999465942383},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.475600004196167},{"id":"https://openalex.org/C39613435","wikidata":"https://www.wikidata.org/wiki/Q846677","display_name":"Remainder","level":2,"score":0.4205000102519989},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.40700000524520874},{"id":"https://openalex.org/C2781357197","wikidata":"https://www.wikidata.org/wiki/Q5757597","display_name":"High memory","level":2,"score":0.36570000648498535},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3490000069141388},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.33649998903274536},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.31940001249313354},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2939000129699707},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.2937000095844269},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.27230000495910645},{"id":"https://openalex.org/C2777480716","wikidata":"https://www.wikidata.org/wiki/Q23582796","display_name":"Resource consumption","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.2662000060081482},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.2653000056743622},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2605000138282776},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2572999894618988},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C68481662","wikidata":"https://www.wikidata.org/wiki/Q176197","display_name":"Standard Boolean model","level":5,"score":0.2531000077724457},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.13772","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13772","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.13772","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13772","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.4197145998477936,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Boolean":[0],"matrix":[1],"factorization":[2,190],"(BMF)":[3],"is":[4,104],"a":[5,67,86,96],"fundamental":[6],"tool":[7],"for":[8,195],"analyzing":[9],"binary":[10],"data":[11,89,102,113],"and":[12,32,44,57,78,111,187],"discovering":[13],"latent":[14],"information":[15],"hidden":[16],"in":[17,182],"the":[18,33,42,51,116,119,125,135,144,154,158,177,180,196],"data.":[19,94],"Formal":[20],"Concept":[21],"Analysis":[22],"(FCA)":[23],"provides":[24],"us":[25],"with":[26,85,131,149],"an":[27],"essential":[28],"insight":[29],"into":[30],"BMF":[31,183],"design":[34],"of":[35,53,70,118,143,157,179,191],"algorithms.":[36],"Due":[37],"to":[38,115,139,153],"FCA,":[39],"we":[40,64,122],"have":[41],"GreCon":[43,197],"GreCon2":[45],"algorithms":[46],"providing":[47],"high-quality":[48],"factorizations":[49],"at":[50],"cost":[52],"high":[54],"memory":[55,79,109],"consumption":[56,110],"long":[58],"running":[59],"times.":[60],"In":[61],"this":[62,101,146],"paper,":[63],"introduce":[65],"GreCon3,":[66],"substantial":[68],"revision":[69],"these":[71],"algorithms,":[72],"significantly":[73,151],"improving":[74],"both":[75],"computational":[76],"efficiency":[77],"usage.":[80],"These":[81],"improvements":[82],"are":[83],"achieved":[84],"novel":[87,97],"space-efficient":[88],"structure":[90,103],"that":[91,124,165],"tracks":[92],"unprocessed":[93],"Further,":[95],"strategy":[98,107],"incrementally":[99],"initializing":[100],"proposed.":[105],"This":[106],"reduces":[108],"omits":[112],"irrelevant":[114],"remainder":[117],"computation.":[120],"Moreover,":[121],"show":[123],"first":[126,136],"factors":[127,137],"can":[128],"be":[129],"discovered":[130],"less":[132],"effort.":[133],"Since":[134],"tend":[138],"describe":[140],"large":[141],"portions":[142],"data,":[145],"optimization,":[147],"along":[148],"others,":[150],"contributes":[152],"overall":[155],"improvement":[156],"algorithm's":[159],"performance.":[160],"An":[161],"experimental":[162],"evaluation":[163],"shows":[164],"GreCon3":[166],"substantially":[167],"outperforms":[168],"its":[169],"predecessor":[170],"GreCon2.":[171],"The":[172],"proposed":[173],"algorithm":[174],"thus":[175],"advances":[176],"state":[178],"art":[181],"based":[184],"on":[185],"FCA":[186],"enables":[188],"efficient":[189],"datasets":[192],"previously":[193],"infeasible":[194],"algorithm.":[198]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-18T00:00:00"}