{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/subgroup-discovery","name":"Subgroup Discovery","slug":"subgroup-discovery","description_markdown":null,"categories":[{"name":"Computer Code","url":"/area/computer-code"},{"name":"Methodology","url":"/area/methodology"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":47,"papers_with_code":18,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/data-mining","name":"Data Mining"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":47,"of":47,"of_with_code":18,"tagged_in_all":47,"counts":{"archive_papers_tagged":47,"with_a_code_link":18,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":47,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/discovering-outstanding-subgroup-lists-for","slug":"discovering-outstanding-subgroup-lists-for","title":"Discovering outstanding subgroup lists for numeric targets using MDL","date":"2020-06-16","arxiv_id":"2006.09186","repositories_listed":3,"syntology":null},{"url":"/paper/discover-and-mitigate-multiple-biased","slug":"discover-and-mitigate-multiple-biased","title":"Discover and Mitigate Multiple Biased Subgroups in Image Classifiers","date":"2024-03-19","arxiv_id":"2403.12777","repositories_listed":2,"syntology":null},{"url":"/paper/what-makes-my-queries-slow-subgroup-discovery","slug":"what-makes-my-queries-slow-subgroup-discovery","title":"\"What makes my queries slow?\": Subgroup Discovery for SQL Workload Analysis","date":"2021-08-09","arxiv_id":"2108.03906","repositories_listed":2,"syntology":null},{"url":"/paper/robust-subgroup-discovery","slug":"robust-subgroup-discovery","title":"Robust subgroup discovery","date":"2021-03-25","arxiv_id":"2103.13686","repositories_listed":2,"syntology":null},{"url":"/paper/discovering-multiple-antibiotic-resistance","slug":"discovering-multiple-antibiotic-resistance","title":"Discovering multiple antibiotic resistance phenotypes using diverse top-k subgroup list discovery","date":"2025-06-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/subgroups-a-python-library-for-subgroup","slug":"subgroups-a-python-library-for-subgroup","title":"Subgroups: A Python library for Subgroup Discovery","date":"2024-09-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/using-constraints-to-discover-sparse-and","slug":"using-constraints-to-discover-sparse-and","title":"Using Constraints to Discover Sparse and Alternative Subgroup Descriptions","date":"2024-06-03","arxiv_id":"2406.01411","repositories_listed":1,"syntology":null},{"url":"/paper/mining-java-memory-errors-using-subjective","slug":"mining-java-memory-errors-using-subjective","title":"Mining Java Memory Errors using Subjective Interesting Subgroups with Hierarchical Targets","date":"2023-10-01","arxiv_id":"2310.00781","repositories_listed":1,"syntology":null},{"url":"/paper/vlsd-an-efficient-subgroup-discovery","slug":"vlsd-an-efficient-subgroup-discovery","title":"VLSD—An Efficient Subgroup Discovery Algorithm Based on Equivalence Classes and Optimistic Estimate","date":"2023-05-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/subgroup-discovery-in-unstructured-data","slug":"subgroup-discovery-in-unstructured-data","title":"Subgroup Discovery in Unstructured Data","date":"2022-07-15","arxiv_id":"2207.07781","repositories_listed":1,"syntology":null},{"url":"/paper/identifying-the-leading-factors-of","slug":"identifying-the-leading-factors-of","title":"Identifying the Leading Factors of Significant Weight Gains Using a New Rule Discovery Method","date":"2021-11-04","arxiv_id":"2111.04475","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-summaries-of-black-box-incident","slug":"interpretable-summaries-of-black-box-incident","title":"Interpretable Summaries of Black Box Incident Triaging with Subgroup Discovery","date":"2021-08-06","arxiv_id":"2108.03013","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-subgraphs-with-surprising","slug":"explainable-subgraphs-with-surprising","title":"Explainable Subgraphs with Surprising Densities: A Subgroup Discovery Approach","date":"2020-01-10","arxiv_id":"2002.00793","repositories_listed":1,"syntology":null},{"url":"/paper/scenario-discovery-via-rule-extraction","slug":"scenario-discovery-via-rule-extraction","title":"REDS: Rule Extraction for Discovering Scenarios","date":"2019-10-03","arxiv_id":"1910.01713","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-based-silhouette-community","slug":"embedding-based-silhouette-community","title":"Embedding-based Silhouette Community Detection","date":"2019-07-17","arxiv_id":"1908.02556","repositories_listed":1,"syntology":null},{"url":"/paper/fairvis-visual-analytics-for-discovering","slug":"fairvis-visual-analytics-for-discovering","title":"FairVis: Visual Analytics for Discovering Intersectional Bias in Machine Learning","date":"2019-04-10","arxiv_id":"1904.05419","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-with-contrastive-latent","slug":"unsupervised-learning-with-contrastive-latent","title":"Unsupervised learning with contrastive latent variable models","date":"2018-11-14","arxiv_id":"1811.06094","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-learning-with-contrastive-latent#ran","syntology_url":"https://syntology.ai/paper/1811.06094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.06094"}},"official":{"repos":["kseverso/contrastive-LVM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-principal-component-analysis","slug":"contrastive-principal-component-analysis","title":"Contrastive Principal Component Analysis","date":"2017-09-20","arxiv_id":"1709.06716","repositories_listed":1,"syntology":null},{"url":null,"slug":"subgroup-performance-analysis-in-hidden","title":"Subgroup Performance Analysis in Hidden Stratifications","date":"2025-03-13","arxiv_id":"2503.10382","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-consensus-set-for-the-aggregation-of","title":"A consensus set for the aggregation of partial rankings: the case of the Optimal Set of Bucket Orders Problem","date":"2025-02-19","arxiv_id":"2502.13769","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairpriori-improving-biased-subgroup","title":"Fairpriori: Improving Biased Subgroup Discovery for Deep Neural Network Fairness","date":"2024-06-25","arxiv_id":"2407.01595","repositories_listed":0,"syntology":null},{"url":null,"slug":"peripheral-nervous-system-responses-to-food","title":"Peripheral Nervous System Responses to Food Stimuli: Analysis Using Data Science Approaches","date":"2024-05-21","arxiv_id":"2405.15810","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgroup-discovery-in-moocs-a-big-data","title":"Subgroup Discovery in MOOCs: A Big Data Application for Describing Different Types of Learners","date":"2024-02-10","arxiv_id":"2403.05555","repositories_listed":0,"syntology":null},{"url":null,"slug":"faircompass-operationalising-fairness-in","title":"FairCompass: Operationalising Fairness in Machine Learning","date":"2023-12-27","arxiv_id":"2312.16726","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-is-moody-discovering-data-modification","title":"Data is Moody: Discovering Data Modification Rules from Process Event Logs","date":"2023-12-22","arxiv_id":"2312.14571","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-gained-subgroup-discovery-in","title":"A new algorithm for Subgroup Set Discovery based on Information Gain","date":"2023-07-26","arxiv_id":"2307.15089","repositories_listed":0,"syntology":null},{"url":null,"slug":"tree-based-subgroup-discovery-in-electronic","title":"Tree-based Subgroup Discovery In Electronic Health Records: Heterogeneity of Treatment Effects for DTG-containing Therapies","date":"2022-08-30","arxiv_id":"2208.14329","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-system-level-debug-using-rule","title":"Accelerating System-Level Debug Using Rule Learning and Subgroup Discovery Techniques","date":"2022-07-02","arxiv_id":"2207.00622","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgroup-discovery-of-parkinson-s-disease-by","title":"Subgroup discovery of Parkinson's Disease by utilizing a multi-modal smart device system","date":"2022-05-12","arxiv_id":"2205.05961","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsity-based-feature-selection-for","title":"Sparsity-based Feature Selection for Anomalous Subgroup Discovery","date":"2022-01-06","arxiv_id":"2201.02008","repositories_listed":0,"syntology":null},{"url":null,"slug":"pedagogical-rule-extraction-for-learning","title":"Pedagogical Rule Extraction to Learn Interpretable Models - an Empirical Study","date":"2021-12-25","arxiv_id":"2112.13285","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-clustering-via-multi-polytope","title":"Interpretable Clustering via Multi-Polytope Machines","date":"2021-12-10","arxiv_id":"2112.05653","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-can-subgroup-discovery-help-aiops","title":"How Can Subgroup Discovery Help AIOps?","date":"2021-09-10","arxiv_id":"2109.04909","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-exceptionality-detection-in-time-series","title":"Local Exceptionality Detection in Time Series Using Subgroup Discovery","date":"2021-08-05","arxiv_id":"2108.11751","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploratory-analysis-of-news-sentiment-using","title":"Exploratory Analysis of News Sentiment Using Subgroup Discovery","date":"2021-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mint-mdl-based-approach-for-mining","title":"Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets","date":"2020-11-30","arxiv_id":"2011.14843","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-nonparametric-cost-effectiveness","title":"Bayesian Nonparametric Cost-Effectiveness Analyses: Causal Estimation and Adaptive Subgroup Discovery","date":"2020-02-11","arxiv_id":"2002.04706","repositories_listed":0,"syntology":null},{"url":null,"slug":"preservation-of-anomalous-subgroups-on","title":"Preservation of Anomalous Subgroups On Machine Learning Transformed Data","date":"2019-11-09","arxiv_id":"1911.03674","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-discriminative-pattern","title":"Towards Efficient Discriminative Pattern Mining in Hybrid Domains","date":"2019-08-15","arxiv_id":"1908.06801","repositories_listed":0,"syntology":null},{"url":null,"slug":"190503297","title":"Interpretable Subgroup Discovery in Treatment Effect Estimation with Application to Opioid Prescribing Guidelines","date":"2019-05-08","arxiv_id":"1905.03297","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-stage-fault-warning-for-large-electric","title":"Multi-Stage Fault Warning for Large Electric Grids Using Anomaly Detection and Machine Learning","date":"2019-03-15","arxiv_id":"1903.06700","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-for-subgroup-discovery-under","title":"Machine learning for subgroup discovery under treatment effect","date":"2019-02-27","arxiv_id":"1902.10327","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-rule-sets-for-identifying-subgroups","title":"Causal Rule Sets for Identifying Subgroups with Enhanced Treatment Effect","date":"2017-10-16","arxiv_id":"1710.05426","repositories_listed":0,"syntology":null},{"url":null,"slug":"subjectively-interesting-subgroup-discovery","title":"Subjectively Interesting Subgroup Discovery on Real-valued Targets","date":"2017-10-12","arxiv_id":"1710.04521","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiently-discovering-locally-exceptional","title":"Efficiently Discovering Locally Exceptional yet Globally Representative Subgroups","date":"2017-09-22","arxiv_id":"1709.07941","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-consistent-statements-about","title":"Identifying Consistent Statements about Numerical Data with Dispersion-Corrected Subgroup Discovery","date":"2017-01-26","arxiv_id":"1701.07696","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexibly-mining-better-subgroups","title":"Flexibly Mining Better Subgroups","date":"2015-10-28","arxiv_id":"1510.08382","repositories_listed":0,"syntology":null}],"syntology_records":1,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/task/subgroup-discovery/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/subgroup-discovery/papers/ran/1","json":"/task/subgroup-discovery/papers/ran/1.json","rows":1}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"d72ea270e8e1b97c26b6e9e8d3e6ce83e69dc0957161ba977880a748d278a422","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}