{"id":"https://openalex.org/W2005890650","doi":"https://doi.org/10.1142/s0129054108005681","title":"SUCCINCT MINIMAL GENERATORS: THEORETICAL FOUNDATIONS AND APPLICATIONS","display_name":"SUCCINCT MINIMAL GENERATORS: THEORETICAL FOUNDATIONS AND APPLICATIONS","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W2005890650","doi":"https://doi.org/10.1142/s0129054108005681","mag":"2005890650"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054108005681","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054108005681","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023183266","display_name":"Tarek Hamrouni","orcid":"https://orcid.org/0000-0001-7453-6447"},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR","TN"],"is_corresponding":true,"raw_author_name":"TAREK HAMROUNI","raw_affiliation_strings":["CRIL-CNRS, IUT de Lens, Lens, France","Department of Computer Science, Faculty of Sciences of Tunis, Tunis, Tunisia"],"affiliations":[{"raw_affiliation_string":"CRIL-CNRS, IUT de Lens, Lens, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Department of Computer Science, Faculty of Sciences of Tunis, Tunis, Tunisia","institution_ids":["https://openalex.org/I108714496"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070511935","display_name":"Sadok Ben Yahia","orcid":"https://orcid.org/0000-0001-8939-8948"},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"SADOK BEN YAHIA","raw_affiliation_strings":["Department of Computer Science, Faculty of Sciences of Tunis, Tunis, Tunisia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Sciences of Tunis, Tunis, Tunisia","institution_ids":["https://openalex.org/I108714496"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057686129","display_name":"Engelbert Mephu Nguifo","orcid":"https://orcid.org/0000-0001-9119-678X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"ENGELBERT MEPHU NGUIFO","raw_affiliation_strings":["CRIL-CNRS, IUT de Lens, Lens, France"],"affiliations":[{"raw_affiliation_string":"CRIL-CNRS, IUT de Lens, Lens, France","institution_ids":["https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023183266"],"corresponding_institution_ids":["https://openalex.org/I108714496","https://openalex.org/I1294671590"],"apc_list":null,"apc_paid":null,"fwci":3.5413,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.93334482,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","issue":"02","first_page":"271","last_page":"296"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9984999895095825,"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/T11106","display_name":"Data Management and Algorithms","score":0.9747999906539917,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.7163137793540955},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.6634647846221924},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5991001725196838},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5963466167449951},{"id":"https://openalex.org/keywords/closure-operator","display_name":"Closure operator","score":0.5399729013442993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.532211422920227},{"id":"https://openalex.org/keywords/equivalence-class","display_name":"Equivalence class (music)","score":0.5049882531166077},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5011003017425537},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43841487169265747},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43389877676963806},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4211019277572632},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3591156601905823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35564157366752625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3283998370170593},{"id":"https://openalex.org/keywords/closed-set","display_name":"Closed set","score":0.21194389462471008},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.16655001044273376},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11222943663597107},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08553430438041687}],"concepts":[{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.7163137793540955},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.6634647846221924},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5991001725196838},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5963466167449951},{"id":"https://openalex.org/C160771489","wikidata":"https://www.wikidata.org/wiki/Q10564851","display_name":"Closure operator","level":3,"score":0.5399729013442993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.532211422920227},{"id":"https://openalex.org/C2777044963","wikidata":"https://www.wikidata.org/wiki/Q5384707","display_name":"Equivalence class (music)","level":2,"score":0.5049882531166077},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5011003017425537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43841487169265747},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43389877676963806},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4211019277572632},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3591156601905823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35564157366752625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3283998370170593},{"id":"https://openalex.org/C164953516","wikidata":"https://www.wikidata.org/wiki/Q320357","display_name":"Closed set","level":2,"score":0.21194389462471008},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.16655001044273376},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11222943663597107},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08553430438041687},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054108005681","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054108005681","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-02134392v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02134392","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Int. J. Found. Comput. Sci., 2008, 19, pp.271--296. ⟨10.1142/S0129054108005681⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W8631370","https://openalex.org/W53681585","https://openalex.org/W59577043","https://openalex.org/W106642128","https://openalex.org/W179066337","https://openalex.org/W180578187","https://openalex.org/W1506481577","https://openalex.org/W1516597685","https://openalex.org/W1536736992","https://openalex.org/W1537030879","https://openalex.org/W1537875506","https://openalex.org/W1553696291","https://openalex.org/W1553853102","https://openalex.org/W1578949701","https://openalex.org/W1997309399","https://openalex.org/W2019726902","https://openalex.org/W2051508823","https://openalex.org/W2054658115","https://openalex.org/W2110893883","https://openalex.org/W2115822498","https://openalex.org/W2129555316","https://openalex.org/W2150942997","https://openalex.org/W2153818052","https://openalex.org/W2156471806","https://openalex.org/W2160334555","https://openalex.org/W2161033190","https://openalex.org/W2293888039","https://openalex.org/W2396903734","https://openalex.org/W2906317256","https://openalex.org/W4242635839","https://openalex.org/W4255318870","https://openalex.org/W4285719527","https://openalex.org/W4301824062"],"related_works":["https://openalex.org/W2382232876","https://openalex.org/W2182642161","https://openalex.org/W4255196547","https://openalex.org/W2358659170","https://openalex.org/W146502352","https://openalex.org/W2055587080","https://openalex.org/W2065657484","https://openalex.org/W2379751811","https://openalex.org/W2034764251","https://openalex.org/W2141058666"],"abstract_inverted_index":{"In":[0,127,229],"data":[1],"mining":[2],"applications,":[3],"highly":[4],"sized":[5],"contexts":[6],"are":[7,75],"handled":[8],"what":[9],"usually":[10],"results":[11],"in":[12,34,59],"a":[13,168,173,196,234,258,262,306],"considerably":[14],"large":[15],"set":[16,269],"of":[17,24,63,73,160,167,199,215,237,266,285,288,310,334,341],"frequent":[18,42],"itemsets,":[19,67],"even":[20],"for":[21],"high":[22],"values":[23],"the":[25,53,60,71,91,95,100,143,158,164,212,224,238,267,283,311,324,332],"minimum":[26],"support":[27],"threshold.":[28],"An":[29],"interesting":[30],"solution":[31],"consists":[32],"then":[33,279],"applying":[35],"an":[36,122,125,178,184,192,220,328],"appropriate":[37],"closure":[38,83],"operator":[39],"that":[40,48,182],"structures":[41],"itemsets":[43,50],"into":[44,282],"equivalence":[45,97],"classes,":[46],"such":[47],"two":[49],"belong":[51],"to":[52,172,177,222,252,271,295,316],"same":[54,61],"class":[55],"if":[56],"they":[57,129],"appear":[58],"sets":[62],"objects.":[64],"Among":[65],"equivalent":[66],"minimal":[68,77,135,216],"elements":[69],"(w.r.t.":[70],"number":[72],"items)":[74],"called":[76,85],"generators":[78,217],"(MGs),":[79],"while":[80],"their":[81,107],"associated":[82,108,171],"is":[84,90,118],"closed":[86],"itemset":[87,115],"(CI),":[88],"and":[89,106,124,137,152,187,299],"largest":[92],"one":[93],"within":[94,226],"corresponding":[96],"class.":[98],"Thus,":[99],"pairs":[101],"-":[102,110,150,154],"composed":[103],"by":[104,121,206,243],"MGs":[105],"CIs":[109],"make":[111],"easier":[112],"localizing":[113],"each":[114],"since":[116],"it":[117,293],"necessarily":[119],"encompassed":[120],"MG":[123,151,170,268],"CI.":[126],"addition,":[128],"offer":[130],"informative":[131,300],"implication/association":[132],"rules,":[133,321],"with":[134],"premises":[136],"maximal":[138],"conclusions,":[139],"which":[140],"losslessly":[141],"represent":[142],"entire":[144],"rule":[145],"set.":[146,228],"These":[147],"important":[148,339],"concepts":[149],"CI":[153,175],"were":[155],"hence":[156],"at":[157],"origin":[159],"various":[161],"works.":[162],"Nevertheless,":[163],"inherent":[165],"absence":[166],"unique":[169],"given":[174],"leads":[176,183],"intra-class":[179],"combinatorial":[180],"redundancy":[181,225],"exhaustive":[185],"storage":[186],"impractical":[188],"use.":[189],"This":[190,202,247,291],"motivated":[191],"in-depth":[193],"study":[194,203,236,309],"towards":[195,337],"lossless":[197,264],"reduction":[198,265],"this":[200,227,230],"redundancy.":[201],"was":[204],"started":[205],"Dong":[207,244],"et":[208,245],"al.":[209,246],"who":[210],"introduced":[211],"succinct":[213,298],"system":[214,248],"(SSMG)":[218],"as":[219,240],"attempt":[221],"eliminate":[223],"paper,":[231],"we":[232,260,304],"give":[233,305],"thorough":[235,307],"SSMG":[239,277],"formerly":[241],"defined":[242],"will":[249,278],"be":[250,280],"shown":[251],"suffer":[253],"from":[254,323],"some":[255],"flaws.":[256],"As":[257],"remedy,":[259],"introduce":[261],"new":[263,276],"allowing":[270,315],"overcome":[272],"its":[273],"limitations.":[274],"The":[275],"incorporated":[281],"framework":[284],"generic":[286],"bases":[287],"association":[289,320],"rules.":[290,301],"makes":[292],"possible":[294],"only":[296],"maintain":[297],"After":[302],"that,":[303],"formal":[308],"related":[312],"inference":[313],"mechanisms":[314],"derive":[317],"all":[318],"redundant":[319,342],"starting":[322],"maintained":[325],"ones.":[326],"Finally,":[327],"experimental":[329],"evaluation":[330],"shows":[331],"utility":[333],"our":[335],"approach":[336],"eliminating":[338],"rate":[340],"information.":[343]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}