{"id":"https://openalex.org/W4224691544","doi":"https://doi.org/10.1145/3532187","title":"MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining","display_name":"MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining","publication_year":2022,"publication_date":"2022-04-25","ids":{"openalex":"https://openalex.org/W4224691544","doi":"https://doi.org/10.1145/3532187"},"language":"en","primary_location":{"id":"doi:10.1145/3532187","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3532187","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":true,"oa_status":"green","oa_url":"https://hdl.handle.net/11577/3456674","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021603227","display_name":"Leonardo Pellegrina","orcid":"https://orcid.org/0000-0002-6601-5526"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Leonardo Pellegrina","raw_affiliation_strings":["Universit\u00e0 di Padova, Padova, Italy"],"raw_orcid":"https://orcid.org/0000-0002-6601-5526","affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Padova, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088088780","display_name":"Cyrus Cousins","orcid":"https://orcid.org/0000-0002-1691-0282"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cyrus Cousins","raw_affiliation_strings":["Brown University, Providence, RI"],"raw_orcid":"https://orcid.org/0000-0002-1691-0282","affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060279781","display_name":"Fabio Vandin","orcid":"https://orcid.org/0000-0003-2244-2320"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabio Vandin","raw_affiliation_strings":["Universit\u00e0 di Padova, Padova, Italy"],"raw_orcid":"https://orcid.org/0000-0003-2244-2320","affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Padova, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021368473","display_name":"Matteo Riondato","orcid":"https://orcid.org/0000-0003-2523-4420"},"institutions":[{"id":"https://openalex.org/I177605424","display_name":"Amherst College","ror":"https://ror.org/028vqfs63","country_code":"US","type":"education","lineage":["https://openalex.org/I177605424"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matteo Riondato","raw_affiliation_strings":["Amherst College, Amherst, MA"],"raw_orcid":"https://orcid.org/0000-0003-2523-4420","affiliations":[{"raw_affiliation_string":"Amherst College, Amherst, MA","institution_ids":["https://openalex.org/I177605424"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.456,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.93287462,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"16","issue":"6","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":1.0,"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":1.0,"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.9957000017166138,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9916999936103821,"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/monte-carlo-method","display_name":"Monte Carlo method","score":0.561275839805603},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.5475042462348938},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.511020302772522},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5007960796356201},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.45972320437431335},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4437854588031769},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.43828973174095154},{"id":"https://openalex.org/keywords/false-positive-paradox","display_name":"False positive paradox","score":0.4331092834472656},{"id":"https://openalex.org/keywords/ultrametric-space","display_name":"Ultrametric space","score":0.41305258870124817},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40486449003219604},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3394896686077118},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.2483699917793274},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20897647738456726},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19546490907669067},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.07890063524246216}],"concepts":[{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.561275839805603},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.5475042462348938},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.511020302772522},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5007960796356201},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.45972320437431335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4437854588031769},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.43828973174095154},{"id":"https://openalex.org/C64869954","wikidata":"https://www.wikidata.org/wiki/Q1859747","display_name":"False positive paradox","level":2,"score":0.4331092834472656},{"id":"https://openalex.org/C61067352","wikidata":"https://www.wikidata.org/wiki/Q1897429","display_name":"Ultrametric space","level":3,"score":0.41305258870124817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40486449003219604},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3394896686077118},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.2483699917793274},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20897647738456726},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19546490907669067},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.07890063524246216},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3532187","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3532187","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"},{"id":"pmh:oai:www.research.unipd.it:11577/3456674","is_oa":true,"landing_page_url":"https://hdl.handle.net/11577/3456674","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:www.research.unipd.it:11577/3456674","is_oa":true,"landing_page_url":"https://hdl.handle.net/11577/3456674","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4044692664","display_name":"RI: Small: Statistically Sound and Computationally Efficient Data Analysis Through Algorithmic Applications of Rademacher Averages","funder_award_id":"1813444","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1549565124","https://openalex.org/W1614597761","https://openalex.org/W1979462644","https://openalex.org/W2028944004","https://openalex.org/W2031690114","https://openalex.org/W2078825395","https://openalex.org/W2090479884","https://openalex.org/W2104579579","https://openalex.org/W2129501055","https://openalex.org/W2167784882","https://openalex.org/W2241571695","https://openalex.org/W2539631169","https://openalex.org/W2568140450","https://openalex.org/W2579923771","https://openalex.org/W2754504587","https://openalex.org/W2809301005","https://openalex.org/W2908113893","https://openalex.org/W2909295950","https://openalex.org/W2950421339","https://openalex.org/W2963855376","https://openalex.org/W2964277278","https://openalex.org/W2989661724","https://openalex.org/W2998574808","https://openalex.org/W3002429729","https://openalex.org/W3004139501","https://openalex.org/W3025180762","https://openalex.org/W3034606263","https://openalex.org/W3034714759","https://openalex.org/W3036474431","https://openalex.org/W3099883620","https://openalex.org/W3103529187","https://openalex.org/W3171759920","https://openalex.org/W4236362309","https://openalex.org/W4245619290","https://openalex.org/W4254721730","https://openalex.org/W6770207831"],"related_works":["https://openalex.org/W3105794585","https://openalex.org/W4287598215","https://openalex.org/W4288563602","https://openalex.org/W4236333616","https://openalex.org/W2999666600","https://openalex.org/W1612061217","https://openalex.org/W2080736371","https://openalex.org/W1995164207","https://openalex.org/W4300720232","https://openalex.org/W1650804063"],"abstract_inverted_index":{"\u201cI\u2019m":[0],"an":[1,14,85,170,201],"MC":[2],"still":[3],"as":[4,35,81],"honest\u201d":[5],"\u2013":[6],"Eminem,":[7],"Rap":[8],"God":[9],"We":[10,243],"present":[11],"MCRapper":[12,115,132,163,245],",":[13,164],"algorithm":[15,171],"for":[16,25,173,255],"efficient":[17],"computation":[18,210],"of":[19,27,56,91,93,129,139,162,176,186,192,195,197,204,211,224],"Monte-Carlo":[20],"Empirical":[21],"Rademacher":[22],"Averages":[23],"(MCERA)":[24],"families":[26],"functions":[28,72,95,141],"exhibiting":[29],"poset":[30],"(e.g.,":[31,96],"lattice)":[32],"structure,":[33],"such":[34],"those":[36],"that":[37,250],"arise":[38],"in":[39],"many":[40],"pattern":[41,154,206],"mining":[42,155],"tasks.":[43,258],"The":[44],"MCERA":[45],"allows":[46],"us":[47],"to":[48,52,67,136,142,168,214],"compute":[49],"upper":[50,134],"bounds":[51,135,213],"the":[53,76,100,130,137,140,147,159,174,187,193,205,209,215,222,240,253],"maximum":[54],"deviation":[55],"sample":[57,83,106],"means":[58],"from":[59,84,107,153],"their":[60,256],"expectations,":[61],"thus":[62],"it":[63,167],"can":[64],"be":[65],"used":[66],"find":[68],"both":[69],"(1)":[70],"statistically-significant":[71],"(i.e.,":[73],"patterns)":[74,98],"when":[75,99],"available":[77,101],"data":[78,102],"is":[79,103,116],"seen":[80],"a":[82,104,108,117,150],"unknown":[86],"distribution,":[87],"and":[88,145,189,208,230,246,248],"(2)":[89],"approximations":[90,185],"collections":[92],"high-expectation":[94],"frequent":[97],"small":[105],"large":[109],"dataset.":[110],"This":[111],"flexibility":[112],"offered":[113],"by":[114,182],"big":[118],"advantage":[119],"over":[120],"previously":[121],"proposed":[122],"solutions,":[123],"which":[124,199],"could":[125],"only":[126],"achieve":[127],"one":[128],"two.":[131],"uses":[133],"discrepancy":[138],"efficiently":[143],"explore":[144],"prune":[146],"search":[148],"space,":[149],"technique":[151],"borrowed":[152],"itself.":[156],"To":[157],"show":[158,249],"practical":[160],"use":[161],"we":[165],"employ":[166],"develop":[169],"TFP-R":[172,218,247],"task":[175],"True":[177],"Frequent":[178],"Pattern":[179],"(TFP)":[180],"mining,":[181],"appropriately":[183],"computing":[184],"negative":[188],"positive":[190],"borders":[191],"collection":[194],"patterns":[196],"interest,":[198],"allow":[200],"effective":[202],"pruning":[203],"space":[207],"strong":[212],"supremum":[216],"deviation.":[217],"gives":[219],"guarantees":[220],"on":[221],"probability":[223],"including":[225],"any":[226],"false":[227],"positives":[228],"(precision)":[229],"exhibits":[231],"higher":[232],"statistical":[233],"power":[234],"(recall)":[235],"than":[236],"existing":[237],"methods":[238],"offering":[239],"same":[241],"guarantees.":[242],"evaluate":[244],"they":[251],"outperform":[252],"state-of-the-art":[254],"respective":[257]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}