{"id":"https://openalex.org/W4254687075","doi":"https://doi.org/10.1137/1.9781611972788.10","title":"Discovering Relational Item Sets Efficiently","display_name":"Discovering Relational Item Sets Efficiently","publication_year":2008,"publication_date":"2008-04-24","ids":{"openalex":"https://openalex.org/W4254687075","doi":"https://doi.org/10.1137/1.9781611972788.10"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611972788.10","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611972788.10","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 SIAM International Conference on Data Mining","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/A5028773618","display_name":"Arne Koopman","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Arne Koopman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109045829","display_name":"Arno Siebes","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arno Siebes","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028773618"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3838,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.93991394,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"108","last_page":"119"},"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.9959999918937683,"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.9959999918937683,"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.9659000039100647,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9222000241279602,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/relational-database","display_name":"Relational database","score":0.6925634145736694},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.6723392605781555},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6394946575164795},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6205304265022278},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5404866337776184},{"id":"https://openalex.org/keywords/relational-calculus","display_name":"Relational calculus","score":0.5357593297958374},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.48968008160591125},{"id":"https://openalex.org/keywords/apriori-algorithm","display_name":"Apriori algorithm","score":0.48415952920913696},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4570811092853546},{"id":"https://openalex.org/keywords/relational-model","display_name":"Relational model","score":0.40475326776504517},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4031760096549988},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.37044692039489746},{"id":"https://openalex.org/keywords/association-rule-learning","display_name":"Association rule learning","score":0.24770545959472656},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.075906902551651}],"concepts":[{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.6925634145736694},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.6723392605781555},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6394946575164795},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6205304265022278},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5404866337776184},{"id":"https://openalex.org/C99436015","wikidata":"https://www.wikidata.org/wiki/Q1722436","display_name":"Relational calculus","level":4,"score":0.5357593297958374},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.48968008160591125},{"id":"https://openalex.org/C81440476","wikidata":"https://www.wikidata.org/wiki/Q513511","display_name":"Apriori algorithm","level":3,"score":0.48415952920913696},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4570811092853546},{"id":"https://openalex.org/C40207289","wikidata":"https://www.wikidata.org/wiki/Q755662","display_name":"Relational model","level":3,"score":0.40475326776504517},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4031760096549988},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.37044692039489746},{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.24770545959472656},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.075906902551651},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611972788.10","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611972788.10","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 SIAM International Conference on Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2085988990","https://openalex.org/W2005835473","https://openalex.org/W60748262","https://openalex.org/W2056340443","https://openalex.org/W2378275298","https://openalex.org/W1510134535","https://openalex.org/W1487241321","https://openalex.org/W2156787493","https://openalex.org/W1974998563","https://openalex.org/W2126493028"],"abstract_inverted_index":{"Frequent":[0],"item":[1,38,88,95,148,177],"set":[2,145,157,173],"mining":[3,8],"is":[4,22,33,52,64,69],"a":[5,19,116,143,171,206],"major":[6],"data":[7],"research":[9],"area.":[10],"Generalising":[11],"from":[12],"the":[13,41,48,55,71,83,120,131,155,162,181,190,198,211],"standard":[14,72],"single":[15,163],"table":[16],"case":[17],"to":[18,35,130,141,169],"multi-relational":[20,42,87,176],"setting":[21],"simple":[23,34],"in":[24,28,40,70,119,161],"principle,":[25],"but":[26],"hard":[27],"practice.":[29],"That":[30],"is,":[31],"it":[32,68],"define":[36],"frequent":[37,57],"sets":[39,96],"setting,":[43],"as":[44,46],"well":[45],"extending":[47],"A-Priori":[49],"algorithm.":[50],"It":[51,133],"hard,":[53],"because":[54],"well-known":[56],"pattern":[58],"explosion":[59],"at":[60],"low":[61],"min-sup":[62],"settings":[63],"far":[65,223],"worse":[66],"than":[67],"case.":[73],"In":[74,197],"this":[75,203],"paper":[76],"we":[77,200],"introduce":[78],"an":[79],"effective":[80],"algorithm":[81],"for":[82],"discovery":[84],"of":[85,104,146,158,174,195,210],"frequent,":[86],"sets.":[89,149,178],"These":[90],"relational":[91],"patterns":[92,124,160],"show":[93,201],"which":[94],"occur":[97],"together.":[98],"Answering":[99],"questions":[100],"like:":[101],"\u2018What":[102],"type":[103],"Books":[105],"are":[106,126],"bought":[107],"together":[108],"with":[109,128],"what":[110],"Record":[111],"types?\u2019.":[112],"Hence,":[113],"they":[114],"provide":[115],"symmetric":[117],"insight":[118],"relation":[121],"and":[122,165],"reveal":[123],"that":[125,202],"relevant":[127],"respect":[129],"relation.":[132],"extends":[134],"our":[135],"earlier":[136],"work":[137],"on":[138],"using":[139],"MDL":[140],"discover":[142],"small":[144,156,172],"characteristic":[147,159,175],"The":[150],"algorithm,":[151],"R-KRIMP,":[152],"first":[153],"discovers":[154],"tables":[164,216],"then":[166],"combines":[167],"these":[168],"find":[170],"This":[179],"reduces":[180],"original":[182],"search":[183],"space":[184],"dramatically":[185],"and,":[186],"hence,":[187],"brings":[188],"down":[189],"computational":[191],"complexity":[192],"by":[193],"orders":[194],"magnitude.":[196],"experiments":[199],"approach":[204],"yields":[205],"very":[207],"good":[208],"approximation":[209],"naive":[212],"approach,":[213],"joining":[214],"all":[215],"into":[217],"one":[218],"huge":[219],"table,":[220],"while":[221],"being":[222],"more":[224],"efficient.":[225]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}