{"url":"/task/nonparametric-clustering","name":"Nonparametric Clustering","slug":"nonparametric-clustering","description_markdown":"Clustering when the number of clusters is unknwon","categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":18,"papers_with_code":5,"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":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":5,"of":5,"tagged_in_all":18,"items":[{"url":"/paper/a-new-paradigm-for-generative-adversarial","title":"A New Paradigm for Generative Adversarial Networks based on Randomized Decision Rules","date":"2023-06-23","arxiv_id":"2306.13641","repositories_listed":1,"syntology":null},{"url":"/paper/deepdpm-deep-clustering-with-an-unknown","title":"DeepDPM: Deep Clustering With an Unknown Number of Clusters","date":"2022-03-27","arxiv_id":"2203.14309","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-k-means-type-algorithm-for","title":"An efficient $k$-means-type algorithm for clustering datasets with incomplete records","date":"2018-02-23","arxiv_id":"1802.08363","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-nonparametric-clustering","title":"Adaptive Nonparametric Clustering","date":"2017-09-26","arxiv_id":"1709.09102","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-with-nonparametric-clustering","title":"Deep Learning with Nonparametric Clustering","date":"2015-01-13","arxiv_id":"1501.03084","repositories_listed":1,"syntology":null}],"syntology_records":0,"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}