{"id":"https://openalex.org/W2032579240","doi":"https://doi.org/10.1145/2541268.2541271","title":"Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs","display_name":"Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2032579240","doi":"https://doi.org/10.1145/2541268.2541271","mag":"2032579240"},"language":"en","primary_location":{"id":"doi:10.1145/2541268.2541271","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2541268.2541271","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Knowledge Discovery from Data","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/A5011937230","display_name":"Antonella Guzzo","orcid":"https://orcid.org/0000-0003-3159-0536"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Antonella Guzzo","raw_affiliation_strings":["University of Calabria, Rende (CS), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059697535","display_name":"Luigi Moccia","orcid":"https://orcid.org/0000-0002-2211-4928"},"institutions":[{"id":"https://openalex.org/I3005160176","display_name":"Institute for High Performance Computing and Networking","ror":"https://ror.org/04r5fge26","country_code":"IT","type":"facility","lineage":["https://openalex.org/I3005160176","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luigi Moccia","raw_affiliation_strings":["Consiglio Nazionale delle Ricerche - Istituto di Calcolo e Reti ad Alte Prestazioni, Rende (CS), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Consiglio Nazionale delle Ricerche - Istituto di Calcolo e Reti ad Alte Prestazioni, Rende (CS), Italy","institution_ids":["https://openalex.org/I3005160176"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052111624","display_name":"Domenico Sacc\u00e0","orcid":"https://orcid.org/0000-0003-3584-5372"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Domenico Sacc\u00e0","raw_affiliation_strings":["University of Calabria, Rende (CS), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009094578","display_name":"Edoardo Serra","orcid":"https://orcid.org/0000-0003-0689-5063"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Edoardo Serra","raw_affiliation_strings":["University of Calabria, Rende (CS), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1809,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.94253304,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"7","issue":"4","first_page":"1","last_page":"39"},"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.9998000264167786,"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.9998000264167786,"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.9926999807357788,"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/T11652","display_name":"Imbalanced Data Classification Techniques","score":0.9894000291824341,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.8725631237030029},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6153585314750671},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6021043062210083},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5460942983627319},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.5294456481933594},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4786021411418915},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4585781395435333},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4445541799068451},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4266882836818695},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37836354970932007},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37484902143478394},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.369393527507782},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3032129406929016},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2926257252693176},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.265156626701355}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.8725631237030029},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6153585314750671},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6021043062210083},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5460942983627319},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.5294456481933594},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4786021411418915},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4585781395435333},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4445541799068451},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4266882836818695},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37836354970932007},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37484902143478394},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.369393527507782},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3032129406929016},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2926257252693176},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.265156626701355},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2541268.2541271","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2541268.2541271","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Knowledge Discovery from Data","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7099999785423279}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"},{"id":"https://openalex.org/F4320326073","display_name":"Regione Calabria","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":63,"referenced_works":["https://openalex.org/W27502476","https://openalex.org/W36639738","https://openalex.org/W57116089","https://openalex.org/W1492330052","https://openalex.org/W1499019819","https://openalex.org/W1509162044","https://openalex.org/W1514516794","https://openalex.org/W1529582935","https://openalex.org/W1559984023","https://openalex.org/W1561397723","https://openalex.org/W1584153238","https://openalex.org/W1585646276","https://openalex.org/W1605132481","https://openalex.org/W1676134498","https://openalex.org/W1762430620","https://openalex.org/W1965392447","https://openalex.org/W1970217287","https://openalex.org/W1972004026","https://openalex.org/W1980189255","https://openalex.org/W1999602050","https://openalex.org/W2007278728","https://openalex.org/W2023612196","https://openalex.org/W2026797055","https://openalex.org/W2026815944","https://openalex.org/W2054784808","https://openalex.org/W2060917063","https://openalex.org/W2061100700","https://openalex.org/W2072764742","https://openalex.org/W2078937669","https://openalex.org/W2080947358","https://openalex.org/W2091095338","https://openalex.org/W2099019567","https://openalex.org/W2110868467","https://openalex.org/W2110893883","https://openalex.org/W2113233913","https://openalex.org/W2115799663","https://openalex.org/W2120055178","https://openalex.org/W2123108022","https://openalex.org/W2125227861","https://openalex.org/W2127034059","https://openalex.org/W2128906841","https://openalex.org/W2129555316","https://openalex.org/W2130099852","https://openalex.org/W2133864385","https://openalex.org/W2140190241","https://openalex.org/W2149896190","https://openalex.org/W2161033190","https://openalex.org/W2161067131","https://openalex.org/W2161229593","https://openalex.org/W2163277407","https://openalex.org/W2169245654","https://openalex.org/W2172154692","https://openalex.org/W2611147814","https://openalex.org/W2913688336","https://openalex.org/W2962819867","https://openalex.org/W2963908121","https://openalex.org/W4226054531","https://openalex.org/W4241051765","https://openalex.org/W4248358572","https://openalex.org/W4285719527","https://openalex.org/W4292230561","https://openalex.org/W4407232431","https://openalex.org/W6990023262"],"related_works":["https://openalex.org/W2002177687","https://openalex.org/W2058438338","https://openalex.org/W2019471580","https://openalex.org/W2606674369","https://openalex.org/W3135784370","https://openalex.org/W4287273005","https://openalex.org/W2776473626","https://openalex.org/W4288411600","https://openalex.org/W2924623028","https://openalex.org/W1966028935"],"abstract_inverted_index":{"Inverse":[0],"frequent":[1,25,51],"set":[2],"mining":[3],"(IFM)":[4],"is":[5,125,207,216,225,246,260,277,280,316,331],"the":[6,24,44,85,91,95,101,108,128,131,140,145,180,188,201,204,241,257,270,284,307,347,352],"problem":[7,150,224,254],"of":[8,33,75,84,116,121,130,187,203,236,243,255,283,299,309],"computing":[9],"a":[10,30,62,69,148,162,176,183,233,273,281,296,328],"transaction":[11],"database":[12],"D":[13],"satisfying":[14],"given":[15],"support":[16,63],"constraints":[17,41,93],"for":[18,94,165,199,220,326,354],"some":[19],"itemsets,":[20,98],"which":[21,135,166,200,245,315,327],"are":[22,47,52],"typically":[23],"ones.":[26],"This":[27],"article":[28,146,181],"proposes":[29],"new":[31],"formulation":[32],"IFM,":[34],"called":[35,190],"IFM":[36,76,87,122],"I":[37,77,123,193],"(IFM":[38],"with":[39,232,295],"infrequency":[40,92],"),":[42],"where":[43],"itemsets":[45,169],"that":[46,57,153,195,279],"not":[48],"listed":[49],"as":[50,81,219,227,344],"constrained":[53],"to":[54,68,100,118,158,171,212,262,268,288,318],"be":[55,79,137,263,319],"infrequent;":[56],"is,":[58],"they":[59],"must":[60],"have":[61],"less":[64,208],"than":[65,209],"or":[66,210],"equal":[67,211],"specified":[70],"unique":[71],"threshold.":[72],"An":[73],"instance":[74,83],"can":[78,136],"seen":[80],"an":[82,155,228,310],"original":[86,141],"by":[88,127,249,346],"making":[89],"explicit":[90],"minimal":[96,167,172],"infrequent":[97,168],"corresponding":[99],"so-called":[102],"negative":[103,132],"generator":[104,133],"border":[105],"defined":[106],"in":[107,139,217,264,293,322,357],"literature.":[109],"The":[110,222,301,333],"complexity":[111,215],"increase":[112],"from":[113],"PSPACE":[114,218],"(complexity":[115,120],"IFM)":[117],"NEXP":[119],")":[124],"caused":[126],"cardinality":[129,160],"border,":[134],"exponential":[138,239],"input":[142],"size.":[143],"Therefore,":[144],"introduces":[147],"specific":[149],"parameter":[151,205],"\u03ba":[152,206],"computes":[154],"upper":[156],"bound":[157],"this":[159,323],"using":[161],"hypergraph":[163],"interpretation":[164],"correspond":[170],"transversals.":[173],"By":[174],"fixing":[175],"constant":[177],"k":[178,184,191,213],",":[179,194],"formulates":[182],"-bounded":[185],"definition":[186],"problem,":[189],"-IFM":[192],"collects":[196],"all":[197],"instances":[198],"value":[202],"\u2014its":[214],"IFM.":[221],"bounded":[223],"encoded":[226],"integer":[229,251,312],"linear":[230,258,271,291,313],"program":[231,259],"large":[234],"number":[235,242,298],"variables":[237],"(actually":[238],"w.r.t.":[240],"constraints),":[244],"thereafter":[247],"approximated":[248],"relaxing":[250],"constraints\u2014the":[252],"decision":[253],"solving":[256],"proven":[261,317],"NP.":[265],"In":[266],"order":[267],"solve":[269,289],"program,":[272,314],"column":[274,336],"generation":[275,337],"technique":[276],"used":[278],"variation":[282],"simplex":[285],"method":[286,302],"designed":[287],"large-scale":[290],"programs,":[292],"particular":[294],"huge":[297],"variables.":[300],"at":[303],"each":[304],"step":[305],"requires":[306],"solution":[308,338],"auxiliary":[311],"NP":[320],"hard":[321],"case":[324],"and":[325],"greedy":[329],"heuristic":[330],"presented.":[332],"resulting":[334],"overall":[335],"algorithm":[339],"enjoys":[340],"very":[341],"good":[342],"scaling":[343],"evidenced":[345],"intensive":[348],"experimentation,":[349],"thereby":[350],"paving":[351],"way":[353],"its":[355],"application":[356],"real-life":[358],"scenarios.":[359]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}