{"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/face-clustering","name":"Face Clustering","slug":"face-clustering","description_markdown":"Face Clustering in the videos","categories":[{"name":"Computer Vision","url":"/area/computer-vision"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":62,"papers_with_code":22,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":3,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/face-clustering-on-easycom","slug":"face-clustering-on-easycom","dataset":"EasyCom","dataset_url":"/dataset/easycom","rows_in_archive":1,"metrics":["NMI"],"first_row_in_archive_order":{"model":"VC TRSF.","paper_title":"Self-supervised Video-centralised Transformer for Video Face Clustering","paper_url":"/paper/self-supervised-video-centralised-transformer","paper_date":"2022-03-24","arxiv_id":"2203.13166","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/easycom","name":"EasyCom","full_name":"","num_papers_in_archive":22},{"url":"/dataset/moviegraphs","name":"MovieGraphs","full_name":"","num_papers_in_archive":13},{"url":"/dataset/a-view-from-somewhere-avfs","name":"A View From Somewhere (AVFS)","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/image-clustering","name":"Image Clustering"}],"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":62,"of":62,"of_with_code":22,"tagged_in_all":62,"counts":{"archive_papers_tagged":62,"with_a_code_link":22,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":62,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/linkage-based-face-clustering-via-graph","slug":"linkage-based-face-clustering-via-graph","title":"Linkage Based Face Clustering via Graph Convolution Network","date":"2019-03-27","arxiv_id":"1903.11306","repositories_listed":4,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/linkage-based-face-clustering-via-graph#ran","syntology_url":"https://syntology.ai/paper/1903.11306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11306"}},"official":{"repos":["Zhongdao/gcn_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sparse-subspace-clustering-algorithm-theory","slug":"sparse-subspace-clustering-algorithm-theory","title":"Sparse Subspace Clustering: Algorithm, Theory, and Applications","date":"2012-03-05","arxiv_id":"1203.1005","repositories_listed":4,"syntology":null},{"url":"/paper/learning-hierarchical-graph-neural-networks","slug":"learning-hierarchical-graph-neural-networks","title":"Learning Hierarchical Graph Neural Networks for Image Clustering","date":"2021-07-03","arxiv_id":"2107.01319","repositories_listed":3,"syntology":null},{"url":"/paper/learning-to-cluster-faces-via-confidence-and","slug":"learning-to-cluster-faces-via-confidence-and","title":"Learning to Cluster Faces via Confidence and Connectivity Estimation","date":"2020-04-01","arxiv_id":"2004.00445","repositories_listed":3,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-to-cluster-faces-via-confidence-and#ran","syntology_url":"https://syntology.ai/paper/2004.00445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00445"}},"official":{"repos":["yl-1993/learn-to-cluster"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/ada-nets-face-clustering-via-adaptive-1","slug":"ada-nets-face-clustering-via-adaptive-1","title":"Ada-NETS: Face Clustering via Adaptive Neighbour Discovery in the Structure Space","date":"2022-02-08","arxiv_id":"2202.03800","repositories_listed":2,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ada-nets-face-clustering-via-adaptive-1#ran","syntology_url":"https://syntology.ai/paper/2202.03800","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03800"}},"official":{"repos":["damo-cv/ada-nets","Thomas-wyh/Ada-NETS"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/an-online-algorithm-for-constrained-face","slug":"an-online-algorithm-for-constrained-face","title":"AN ONLINE ALGORITHM FOR CONSTRAINED FACE CLUSTERING IN VIDEOS","date":"2018-09-06","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/scalable-sparse-subspace-clustering-by","slug":"scalable-sparse-subspace-clustering-by","title":"Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit","date":"2015-07-05","arxiv_id":"1507.01238","repositories_listed":2,"syntology":null},{"url":"/paper/face-clustering-via-early-stopping-and-edge","slug":"face-clustering-via-early-stopping-and-edge","title":"Face Clustering via Early Stopping and Edge Recall","date":"2024-08-24","arxiv_id":"2408.13431","repositories_listed":1,"syntology":null},{"url":"/paper/local-connectivity-based-density-estimation","slug":"local-connectivity-based-density-estimation","title":"Local Connectivity-Based Density Estimation for Face Clustering","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/robust-graph-structure-learning-over-images","slug":"robust-graph-structure-learning-over-images","title":"Robust Graph Structure Learning via Multiple Statistical Tests","date":"2022-10-08","arxiv_id":"2210.03956","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robust-graph-structure-learning-over-images#ran","syntology_url":"https://syntology.ai/paper/2210.03956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03956"}},"official":{"repos":["thomas-wyh/b-attention"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-mitigating-hard-clusters-for-face","slug":"on-mitigating-hard-clusters-for-face","title":"On Mitigating Hard Clusters for Face Clustering","date":"2022-07-25","arxiv_id":"2207.11895","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/on-mitigating-hard-clusters-for-face#ran","syntology_url":"https://syntology.ai/paper/2207.11895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.11895"}},"official":{"repos":["echoanran/on-mitigating-hard-clusters"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/facemap-towards-unsupervised-face-clustering","slug":"facemap-towards-unsupervised-face-clustering","title":"FaceMap: Towards Unsupervised Face Clustering via Map Equation","date":"2022-03-21","arxiv_id":"2203.10090","repositories_listed":1,"syntology":null},{"url":"/paper/gcn-based-linkage-prediction-for-face","slug":"gcn-based-linkage-prediction-for-face","title":"A Linkage-based Doubly Imbalanced Graph Learning Framework for Face Clustering","date":"2021-07-06","arxiv_id":"2107.02477","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-face-clustering-on-a-large-1","slug":"structure-aware-face-clustering-on-a-large-1","title":"Structure-Aware Face Clustering on a Large-Scale Graph With 107 Nodes","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-face-clustering-on-a-large","slug":"structure-aware-face-clustering-on-a-large","title":"Structure-Aware Face Clustering on a Large-Scale Graph with $\\bf{10^{7}}$ Nodes","date":"2021-03-24","arxiv_id":"2103.13225","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structure-aware-face-clustering-on-a-large#ran","syntology_url":"https://syntology.ai/paper/2103.13225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13225"}},"official":{"repos":["sstzal/STAR-FC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-character-graph-via-online-face","slug":"dynamic-character-graph-via-online-face","title":"Dynamic Character Graph via Online Face Clustering for Movie Analysis","date":"2020-07-29","arxiv_id":"2007.14913","repositories_listed":1,"syntology":null},{"url":"/paper/video-face-clustering-with-unknown-number-of","slug":"video-face-clustering-with-unknown-number-of","title":"Video Face Clustering with Unknown Number of Clusters","date":"2019-08-09","arxiv_id":"1908.03381","repositories_listed":1,"syntology":null},{"url":"/paper/an-internal-validity-index-based-on-density","slug":"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/self-supervised-learning-of-face","slug":"self-supervised-learning-of-face","title":"Self-Supervised Learning of Face Representations for Video Face Clustering","date":"2019-03-03","arxiv_id":"1903.01000","repositories_listed":1,"syntology":null},{"url":"/paper/robust-subspace-clustering-via-tighter-rank","slug":"robust-subspace-clustering-via-tighter-rank","title":"Robust Subspace Clustering via Tighter Rank Approximation","date":"2015-10-30","arxiv_id":"1510.08971","repositories_listed":1,"syntology":null},{"url":"/paper/shape-interaction-matrix-revisited-and","slug":"shape-interaction-matrix-revisited-and","title":"Shape Interaction Matrix Revisited and Robustified: Efficient Subspace Clustering with Corrupted and Incomplete Data","date":"2015-09-09","arxiv_id":"1509.02649","repositories_listed":1,"syntology":null},{"url":"/paper/robust-subspace-clustering-via-smoothed-rank","slug":"robust-subspace-clustering-via-smoothed-rank","title":"Robust Subspace Clustering via Smoothed Rank Approximation","date":"2015-08-18","arxiv_id":"1508.04467","repositories_listed":1,"syntology":null},{"url":null,"slug":"videoclusternet-self-supervised-and-adaptive","title":"VideoClusterNet: Self-Supervised and Adaptive Face Clustering For Videos","date":"2024-07-16","arxiv_id":"2407.12214","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-face-representation-via-joint-label","title":"Improved Face Representation via Joint Label Classification and Supervised Contrastive Clustering","date":"2023-12-07","arxiv_id":"2312.04029","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-to-cluster-faces-with-better-subgraphs","title":"Learn to Cluster Faces with Better Subgraphs","date":"2023-04-21","arxiv_id":"2304.10831","repositories_listed":0,"syntology":null},{"url":null,"slug":"clip-cluster-clip-guided-attribute","title":"CLIP-Cluster: CLIP-Guided Attribute Hallucination for Face Clustering","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"face-clustering-via-graph-convolutional","title":"Face Clustering via Graph Convolutional Networks with Confidence Edges","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-robustness-of-deep-clustering-models","title":"On the Robustness of Deep Clustering Models: Adversarial Attacks and Defenses","date":"2022-10-04","arxiv_id":"2210.01940","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-to-cluster-faces-via-pairwise-1","title":"Learn to Cluster Faces via Pairwise Classification","date":"2022-05-26","arxiv_id":"2205.13117","repositories_listed":0,"syntology":null},{"url":null,"slug":"character-focused-video-thumbnail-retrieval","title":"Character-focused Video Thumbnail Retrieval","date":"2022-04-13","arxiv_id":"2204.06563","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-sparse-subspace-clustering","title":"Analysis of Sparse Subspace Clustering: Experiments and Random Projection","date":"2022-04-01","arxiv_id":"2204.00723","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-active-speaker-faces-for-diarization-in","title":"Using Active Speaker Faces for Diarization in TV shows","date":"2022-03-30","arxiv_id":"2203.15961","repositories_listed":0,"syntology":null},{"url":"/paper/self-supervised-video-centralised-transformer","slug":"self-supervised-video-centralised-transformer","title":"Self-supervised Video-centralised Transformer for Video Face Clustering","date":"2022-03-24","arxiv_id":"2203.13166","repositories_listed":0,"syntology":null},{"url":null,"slug":"density-based-clustering-with-kernel-1","title":"Density-Based Clustering with Kernel Diffusion","date":"2021-10-11","arxiv_id":"2110.05096","repositories_listed":0,"syntology":null},{"url":"/paper/face-body-voice-video-person-clustering-with","slug":"face-body-voice-video-person-clustering-with","title":"Face, Body, Voice: Video Person-Clustering with Multiple Modalities","date":"2021-05-20","arxiv_id":"2105.09939","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-cluster-faces-via-transformer","title":"Learning to Cluster Faces via Transformer","date":"2021-04-23","arxiv_id":"2104.11502","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-large-scale-face-clustering-using","title":"Efficient Large-Scale Face Clustering Using an Online Mixture of Gaussians","date":"2021-03-31","arxiv_id":"2103.17272","repositories_listed":0,"syntology":null},{"url":null,"slug":"orthogonal-subspace-decomposition-a-new","title":"Orthogonal Subspace Decomposition: A New Perspective of Learning Discriminative Features for Face Clustering","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-clustering-based-method-for-automatic","title":"A Clustering-Based Method for Automatic Educational Video Recommendation Using Deep Face-Features of Lecturers","date":"2020-10-09","arxiv_id":"2010.04676","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-face-self-supervised-multiview","title":"Robust Character Labeling in Movie Videos: Data Resources and Self-supervised Feature Adaptation","date":"2020-08-25","arxiv_id":"2008.11289","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-face-recognition-by-clustering","title":"Improving Face Recognition by Clustering Unlabeled Faces in the Wild","date":"2020-07-14","arxiv_id":"2007.06995","repositories_listed":0,"syntology":null},{"url":null,"slug":"density-aware-feature-embedding-for-face","title":"Density-Aware Feature Embedding for Face Clustering","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"is-an-affine-constraint-needed-for-affine-1","title":"Is an Affine Constraint Needed for Affine Subspace Clustering?","date":"2020-05-08","arxiv_id":"2005.03888","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-based-contrastive-learning-for","title":"Clustering based Contrastive Learning for Improving Face Representations","date":"2020-04-05","arxiv_id":"2004.02195","repositories_listed":0,"syntology":null},{"url":null,"slug":"constructing-the-f-graph-with-a-symmetric","title":"Constructing the F-Graph with a Symmetric Constraint for Subspace Clustering","date":"2019-12-17","arxiv_id":"1912.07871","repositories_listed":0,"syntology":null},{"url":null,"slug":"subspace-clustering-with-active-learning","title":"Subspace Clustering with Active Learning","date":"2019-11-08","arxiv_id":"1911.03299","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-subspace-clustering-with-independent","title":"Robust Subspace Clustering With Independent and Piecewise Identically Distributed Noise Modeling","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-kernelized-multi-view-self","title":"Robust Kernelized Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimization","date":"2017-09-15","arxiv_id":"1709.05083","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-recovery-in-hypergraphs","title":"Community Recovery in Hypergraphs","date":"2017-09-12","arxiv_id":"1709.03670","repositories_listed":0,"syntology":null},{"url":null,"slug":"face-clustering-representation-and-pairwise","title":"Face Clustering: Representation and Pairwise Constraints","date":"2017-06-15","arxiv_id":"1706.05067","repositories_listed":0,"syntology":null},{"url":null,"slug":"subspace-clustering-via-optimal-direction","title":"Subspace Clustering via Optimal Direction Search","date":"2017-06-12","arxiv_id":"1706.03860","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-proximity-aware-hierarchical-clustering-of","title":"A Proximity-Aware Hierarchical Clustering of Faces","date":"2017-03-14","arxiv_id":"1703.04835","repositories_listed":0,"syntology":null},{"url":null,"slug":"outlier-cluster-formation-in-spectral","title":"Outlier Cluster Formation in Spectral Clustering","date":"2017-03-03","arxiv_id":"1703.01028","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-hypergraphs-the-case-for","title":"Clustering with Hypergraphs: The Case for Large Hyperedges","date":"2016-10-04","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-stable-subspace-clustering-by-post","title":"Achieving stable subspace clustering by post-processing generic clustering results","date":"2016-05-27","arxiv_id":"1605.08680","repositories_listed":0,"syntology":null},{"url":null,"slug":"innovation-pursuit-a-new-approach-to-subspace","title":"Innovation Pursuit: A New Approach to Subspace Clustering","date":"2015-12-02","arxiv_id":"1512.00907","repositories_listed":0,"syntology":null},{"url":null,"slug":"logdet-rank-minimization-with-application-to","title":"LogDet Rank Minimization with Application to Subspace Clustering","date":"2015-07-03","arxiv_id":"1507.00908","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversity-induced-multi-view-subspace","title":"Diversity-Induced Multi-View Subspace Clustering","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"falrr-a-fast-low-rank-representation-solver","title":"FaLRR: A Fast Low Rank Representation Solver","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"greedy-subspace-clustering","title":"Greedy Subspace Clustering","date":"2014-10-31","arxiv_id":"1410.8864","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-subspace-segmentation-with-block","title":"Robust Subspace Segmentation with Block-diagonal Prior","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-clustering-and-its-application-to","title":"Constrained Clustering and Its Application to Face Clustering in Videos","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":6,"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":6,"papers_where_code_ran_first_page":"/task/face-clustering/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/face-clustering/papers/ran/1","json":"/task/face-clustering/papers/ran/1.json","rows":6}],"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":"81cbed73b2f62e2d70f49b7171431463fb95e685b3727815fa139a5ce9034254","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}