{"url":"/task/clustering-algorithms-evaluation","name":"Clustering Algorithms Evaluation","slug":"clustering-algorithms-evaluation","description_markdown":null,"categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":12,"papers_with_code":9,"benchmarks":10,"benchmark_tables_in_archive":10,"benchmark_tables_shown":10,"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":13,"subtasks":1,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/clustering-algorithms-evaluation-on-fashion-2","slug":"clustering-algorithms-evaluation-on-fashion-2","dataset":"Fashion-MNIST","dataset_url":"/dataset/fashion-mnist","rows_in_archive":6,"metrics":["ARI","F1-score","NMI"],"first_row_in_archive_order":{"model":"AE+GIT","paper_title":"Git: Clustering Based on Graph of Intensity Topology","paper_url":"/paper/git-clustering-based-on-graph-of-intensity","paper_date":"2021-10-04","arxiv_id":"2110.01274","code_links":[{"title":"gaozhangyang/DGC","url":"https://github.com/gaozhangyang/DGC"},{"title":"gaozhangyang/git","url":"https://github.com/gaozhangyang/git"},{"title":"yangyucheng000/University","url":"https://github.com/yangyucheng000/University/tree/main/model-2/git"},{"title":"2024-MindSpore-1/Code2","url":"https://github.com/2024-MindSpore-1/Code2/tree/main/model-1/git"}],"syntology":null}},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-mnist","slug":"clustering-algorithms-evaluation-on-mnist","dataset":"MNIST","dataset_url":"/dataset/mnist","rows_in_archive":6,"metrics":["ARI","F1-score","NMI"],"first_row_in_archive_order":{"model":"AE+GIT","paper_title":"Git: Clustering Based on Graph of Intensity Topology","paper_url":"/paper/git-clustering-based-on-graph-of-intensity","paper_date":"2021-10-04","arxiv_id":"2110.01274","code_links":[{"title":"gaozhangyang/DGC","url":"https://github.com/gaozhangyang/DGC"},{"title":"gaozhangyang/git","url":"https://github.com/gaozhangyang/git"},{"title":"yangyucheng000/University","url":"https://github.com/yangyucheng000/University/tree/main/model-2/git"},{"title":"2024-MindSpore-1/Code2","url":"https://github.com/2024-MindSpore-1/Code2/tree/main/model-1/git"}],"syntology":null}},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-olivetti","slug":"clustering-algorithms-evaluation-on-olivetti","dataset":"Olivetti face","dataset_url":"/dataset/olivetti-face","rows_in_archive":5,"metrics":["F1-score","ARI","NMI"],"first_row_in_archive_order":{"model":"GIT","paper_title":"Git: Clustering Based on Graph of Intensity Topology","paper_url":"/paper/git-clustering-based-on-graph-of-intensity","paper_date":"2021-10-04","arxiv_id":"2110.01274","code_links":[{"title":"gaozhangyang/DGC","url":"https://github.com/gaozhangyang/DGC"},{"title":"gaozhangyang/git","url":"https://github.com/gaozhangyang/git"},{"title":"yangyucheng000/University","url":"https://github.com/yangyucheng000/University/tree/main/model-2/git"},{"title":"2024-MindSpore-1/Code2","url":"https://github.com/2024-MindSpore-1/Code2/tree/main/model-1/git"}],"syntology":null}},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-97","slug":"clustering-algorithms-evaluation-on-97","dataset":"97 synthetic datasets","dataset_url":"/dataset/97-synthetic-datasets","rows_in_archive":2,"metrics":["HIT-THE-BEST","Rank difference"],"first_row_in_archive_order":{"model":"CVDD","paper_title":"An Internal Validity Index Based on Density-Involved Distance","paper_url":"/paper/an-internal-validity-index-based-on-density","paper_date":"2019-03-22","arxiv_id":null,"code_links":[{"title":"hulianyu/CVDD","url":"https://github.com/hulianyu/CVDD"}],"syntology":null}},{"leaderboard":"/sota/clustering-algorithms-evaluation-on","slug":"clustering-algorithms-evaluation-on","dataset":"ionosphere","dataset_url":"/dataset/ionosphere","rows_in_archive":1,"metrics":["Purity"],"first_row_in_archive_order":{"model":"CVDD","paper_title":"An Internal Validity Index Based on Density-Involved Distance","paper_url":"/paper/an-internal-validity-index-based-on-density","paper_date":"2019-03-22","arxiv_id":null,"code_links":[{"title":"hulianyu/CVDD","url":"https://github.com/hulianyu/CVDD"}],"syntology":null}},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-iris","slug":"clustering-algorithms-evaluation-on-iris","dataset":"iris","dataset_url":"/dataset/iris-1","rows_in_archive":1,"metrics":["Purity"],"first_row_in_archive_order":{"model":"CVDD","paper_title":"An Internal Validity Index Based on Density-Involved Distance","paper_url":"/paper/an-internal-validity-index-based-on-density","paper_date":"2019-03-22","arxiv_id":null,"code_links":[{"title":"hulianyu/CVDD","url":"https://github.com/hulianyu/CVDD"}],"syntology":null}},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-jaffe","slug":"clustering-algorithms-evaluation-on-jaffe","dataset":"JAFFE","dataset_url":"/dataset/jaffe","rows_in_archive":1,"metrics":["Purity"],"first_row_in_archive_order":{"model":"CVDD","paper_title":"An Internal Validity Index Based on Density-Involved Distance","paper_url":"/paper/an-internal-validity-index-based-on-density","paper_date":"2019-03-22","arxiv_id":null,"code_links":[{"title":"hulianyu/CVDD","url":"https://github.com/hulianyu/CVDD"}],"syntology":null}},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-pathbased","slug":"clustering-algorithms-evaluation-on-pathbased","dataset":"pathbased","dataset_url":"/dataset/pathbased","rows_in_archive":1,"metrics":["Purity"],"first_row_in_archive_order":{"model":"CVDD","paper_title":"An Internal Validity Index Based on Density-Involved Distance","paper_url":"/paper/an-internal-validity-index-based-on-density","paper_date":"2019-03-22","arxiv_id":null,"code_links":[{"title":"hulianyu/CVDD","url":"https://github.com/hulianyu/CVDD"}],"syntology":null}},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-pixraw10p","slug":"clustering-algorithms-evaluation-on-pixraw10p","dataset":"pixraw10P","dataset_url":"/dataset/pixraw10p","rows_in_archive":1,"metrics":["Purity"],"first_row_in_archive_order":{"model":"CVDD","paper_title":"An Internal Validity Index Based on Density-Involved Distance","paper_url":"/paper/an-internal-validity-index-based-on-density","paper_date":"2019-03-22","arxiv_id":null,"code_links":[{"title":"hulianyu/CVDD","url":"https://github.com/hulianyu/CVDD"}],"syntology":null}},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-seeds","slug":"clustering-algorithms-evaluation-on-seeds","dataset":"seeds","dataset_url":"/dataset/seeds","rows_in_archive":1,"metrics":["Purity"],"first_row_in_archive_order":{"model":"CVDD","paper_title":"An Internal Validity Index Based on Density-Involved Distance","paper_url":"/paper/an-internal-validity-index-based-on-density","paper_date":"2019-03-22","arxiv_id":null,"code_links":[{"title":"hulianyu/CVDD","url":"https://github.com/hulianyu/CVDD"}],"syntology":null}}],"datasets":[{"url":"/dataset/mnist","name":"MNIST","full_name":"","num_papers_in_archive":7651},{"url":"/dataset/fashion-mnist","name":"Fashion-MNIST","full_name":"","num_papers_in_archive":3202},{"url":"/dataset/jaffe","name":"JAFFE","full_name":"Japanese Female Facial Expression","num_papers_in_archive":93},{"url":"/dataset/ionosphere","name":"ionosphere","full_name":"","num_papers_in_archive":67},{"url":"/dataset/pathbased","name":"pathbased","full_name":"","num_papers_in_archive":25},{"url":"/dataset/seeds","name":"seeds","full_name":"","num_papers_in_archive":22},{"url":"/dataset/iris-1","name":"iris","full_name":"iris","num_papers_in_archive":20},{"url":"/dataset/pixraw10p","name":"pixraw10P","full_name":"pixraw10P","num_papers_in_archive":9},{"url":"/dataset/97-synthetic-datasets","name":"97 synthetic datasets","full_name":"","num_papers_in_archive":3},{"url":"/dataset/olivetti-face","name":"Olivetti face","full_name":"Olivetti face","num_papers_in_archive":3},{"url":"/dataset/failure-dataset-openstack","name":"Failure-Dataset-OpenStack","full_name":"","num_papers_in_archive":2},{"url":"/dataset/mall-customer","name":"Online retail dataset","full_name":"","num_papers_in_archive":2},{"url":"/dataset/satimage","name":"Satimage","full_name":"","num_papers_in_archive":2}],"subtasks":[{"url":"/task/novel-class-discovery","name":"Novel Class Discovery"}],"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":9,"of":9,"tagged_in_all":12,"items":[{"url":"/paper/git-clustering-based-on-graph-of-intensity","title":"Git: Clustering Based on Graph of Intensity Topology","date":"2021-10-04","arxiv_id":"2110.01274","repositories_listed":4,"syntology":null},{"url":"/paper/csts-a-benchmark-for-the-discovery-of","title":"CSTS: A Benchmark for the Discovery of Correlation Structures in Time Series Clustering","date":"2025-05-20","arxiv_id":"2505.14596","repositories_listed":1,"syntology":null},{"url":"/paper/autoencoder-based-iterative-modeling-and","title":"Autoencoder Based Iterative Modeling and Multivariate Time-Series Subsequence Clustering Algorithm","date":"2022-09-09","arxiv_id":"2209.04213","repositories_listed":1,"syntology":null},{"url":"/paper/the-area-under-the-roc-curve-as-a-measure-of","title":"The Area Under the ROC Curve as a Measure of Clustering Quality","date":"2020-09-04","arxiv_id":"2009.02400","repositories_listed":1,"syntology":null},{"url":"/paper/an-internal-cluster-validity-index-based-on","title":"An Internal Cluster Validity Index Using a Distance-based Separability Measure","date":"2020-09-02","arxiv_id":"2009.01328","repositories_listed":1,"syntology":null},{"url":"/paper/a-predictive-model-for-the-identification-of","title":"A predictive model for the identification of learning styles in MOOC environments","date":"2019-10-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-internal-validity-index-based-on-density","title":"An Internal Validity Index Based on Density-Involved Distance","date":"2019-03-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clubmark-a-parallel-isolation-framework-for","title":"Clubmark: a Parallel Isolation Framework for Benchmarking and Profiling Clustering Algorithms on NUMA Architectures","date":"2018-11-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cdf-transform-shift-an-effective-way-to-deal","title":"CDF Transform-and-Shift: An effective way to deal with datasets of inhomogeneous cluster densities","date":"2018-10-05","arxiv_id":"1810.02897","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-25T09:33:49+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"}}