{"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":"/paper/clustering-millions-of-faces-by-identity","title":"Clustering Millions of Faces by Identity","arxiv_id":"1604.00989","date":"2016-04-04","proceeding":null,"authors":["Charles Otto","Dayong Wang","Anil K. Jain"],"abstract":"In this work, we attempt to address the following problem: Given a large\nnumber of unlabeled face images, cluster them into the individual identities\npresent in this data. We consider this a relevant problem in different\napplication scenarios ranging from social media to law enforcement. In\nlarge-scale scenarios the number of faces in the collection can be of the order\nof hundreds of million, while the number of clusters can range from a few\nthousand to millions--leading to difficulties in terms of both run-time\ncomplexity and evaluating clustering and per-cluster quality. An efficient and\neffective Rank-Order clustering algorithm is developed to achieve the desired\nscalability, and better clustering accuracy than other well-known algorithms\nsuch as k-means and spectral clustering. We cluster up to 123 million face\nimages into over 10 million clusters, and analyze the results in terms of both\nexternal cluster quality measures (known face labels) and internal cluster\nquality measures (unknown face labels) and run-time. Our algorithm achieves an\nF-measure of 0.87 on a benchmark unconstrained face dataset (LFW, consisting of\n13K faces), and 0.27 on the largest dataset considered (13K images in LFW, plus\n123M distractor images). Additionally, we present preliminary work on video\nframe clustering (achieving 0.71 F-measure when clustering all frames in the\nbenchmark YouTube Faces dataset). A per-cluster quality measure is developed\nwhich can be used to rank individual clusters and to automatically identify a\nsubset of good quality clusters for manual exploration.","url_abs":"http://arxiv.org/abs/1604.00989v1","url_pdf":"http://arxiv.org/pdf/1604.00989v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"clustering-millions-of-faces-by-identity","repo_url":"https://github.com/varun-suresh/Clustering","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1604.00989","atlas_url":"https://app.syntology.ai/?focus=1604.00989","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1604.00989"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1604.00989\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1604.00989"},"call":"get_concepts_for_paper(arxiv_id=\"1604.00989\")"}],"by_repo":[{"repo":"varun-suresh/Clustering","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"bc270fe518585ddcfd7d83ea07034ddaa923c590ea10853268042b466a0daab1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}