{"id":"https://openalex.org/W2007278728","doi":"https://doi.org/10.1145/1055558.1055580","title":"Computational complexity of itemset frequency satisfiability","display_name":"Computational complexity of itemset frequency satisfiability","publication_year":2004,"publication_date":"2004-06-14","ids":{"openalex":"https://openalex.org/W2007278728","doi":"https://doi.org/10.1145/1055558.1055580","mag":"2007278728"},"language":"en","primary_location":{"id":"doi:10.1145/1055558.1055580","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1055558.1055580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-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/A5073211270","display_name":"Toon Calders","orcid":"https://orcid.org/0000-0002-4943-6978"},"institutions":[{"id":"https://openalex.org/I149213910","display_name":"University of Antwerp","ror":"https://ror.org/008x57b05","country_code":"BE","type":"education","lineage":["https://openalex.org/I149213910"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Toon Calders","raw_affiliation_strings":["University of Antwerp, Belgium","University of Antwerp (Belgium)#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Antwerp, Belgium","institution_ids":["https://openalex.org/I149213910"]},{"raw_affiliation_string":"University of Antwerp (Belgium)#TAB#","institution_ids":["https://openalex.org/I149213910"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073211270"],"corresponding_institution_ids":["https://openalex.org/I149213910"],"apc_list":null,"apc_paid":null,"fwci":18.5719,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.98868593,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"143","last_page":"154"},"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/T11652","display_name":"Imbalanced Data Classification Techniques","score":0.9894999861717224,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9796000123023987,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7701568603515625},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6987590193748474},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6352115869522095},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.502373456954956},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42299383878707886},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41216713190078735}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7701568603515625},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6987590193748474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6352115869522095},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.502373456954956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42299383878707886},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41216713190078735}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1055558.1055580","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1055558.1055580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:publications/fb3c929b-dac3-4083-9867-26cb4bebdbc3","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/fb3c929b-dac3-4083-9867-26cb4bebdbc3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Calders, T 2004, Computational complexity of itemset frequency satisfiability. in A Deutsch (ed.), Proceedings 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'04, Paris, France, June 14-16, 2004). Association for Computing Machinery, Inc., pp. 143-154.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.8349","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.8349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.adrem.ua.ac.be/bibrem/pubs/CALDERSPODS04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.721","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.721","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sigmod.org/pods/proc04/pdf/P-15.pdf","raw_type":"text"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/154263","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/154263","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In: Proc. PODS Int. Conf. Principles of Database Systems","raw_type":"info:ulb-repo/semantics/openurl/proceeding"},{"id":"pmh:tue:oai:pure.tue.nl:publications/fb3c929b-dac3-4083-9867-26cb4bebdbc3","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/fb3c929b-dac3-4083-9867-26cb4bebdbc3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'04, Paris, France, June 14-16, 2004), 143 - 154","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W103761935","https://openalex.org/W1509162044","https://openalex.org/W1917796552","https://openalex.org/W2005277728","https://openalex.org/W2011039300","https://openalex.org/W2045487373","https://openalex.org/W2128906841","https://openalex.org/W2129555316","https://openalex.org/W2141115288","https://openalex.org/W2166559705","https://openalex.org/W2171479472","https://openalex.org/W2207839030","https://openalex.org/W2914728526","https://openalex.org/W2914795094","https://openalex.org/W4213009134","https://openalex.org/W4248358572","https://openalex.org/W6990023262"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2189341500"],"abstract_inverted_index":{"Computing":[0],"frequent":[1,105],"itemsets":[2],"is":[3,45,52,59,94],"one":[4],"of":[5,37,69,89,91,102],"the":[6,35,38,42,70,86],"most":[7],"prominent":[8],"problems":[9],"in":[10,41,47,65,104,111],"data":[11,112],"mining.":[12,113],"We":[13,61,99],"introduce":[14],"a":[15,28,92],"new,":[16],"related":[17],"problem,":[18],"called":[19],"FREQSAT:":[20],"given":[21,73],"some":[22],"itemset-interval":[23],"pairs,":[24],"does":[25],"there":[26],"exist":[27],"database":[29,71],"such":[30],"that":[31,50,57],"for":[32],"every":[33],"pair":[34],"frequency":[36],"itemset":[39,106],"falls":[40],"interval?":[43],"It":[44],"shown":[46],"this":[48],"paper":[49],"FREQSAT":[51,80,96,103],"not":[53],"finitely":[54],"axiomatizable":[55],"and":[56,109],"it":[58],"NP-complete.":[60],"also":[62],"study":[63],"cases":[64],"which":[66],"other":[67],"characteristics":[68,77],"are":[72],"as":[74],"well.":[75],"These":[76],"can":[78],"complicate":[79],"even":[81],"more.":[82],"For":[83],"example,":[84],"when":[85],"maximal":[87],"number":[88],"duplicates":[90],"transaction":[93],"known,":[95],"becomes":[97],"PP-hard.":[98],"describe":[100],"applications":[101],"mining":[107],"algorithms":[108],"privacy":[110]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}