{"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/binary-classification-in-unstructured-space","title":"Binary Classification in Unstructured Space With Hypergraph Case-Based Reasoning","arxiv_id":"1806.06232","date":"2018-06-16","proceeding":null,"authors":["Alexandre Quemy"],"abstract":"Binary classification is one of the most common problem in machine learning.\nIt consists in predicting whether a given element belongs to a particular\nclass. In this paper, a new algorithm for binary classification is proposed\nusing a hypergraph representation. The method is agnostic to data\nrepresentation, can work with multiple data sources or in non-metric spaces,\nand accommodates with missing values. As a result, it drastically reduces the\nneed for data preprocessing or feature engineering. Each element to be\nclassified is partitioned according to its interactions with the training set.\nFor each class, a seminorm over the training set partition is learnt to\nrepresent the distribution of evidence supporting this class.\n  Empirical validation demonstrates its high potential on a wide range of\nwell-known datasets and the results are compared to the state-of-the-art. The\ntime complexity is given and empirically validated. Its robustness with regard\nto hyperparameter sensitivity is studied and compared to standard\nclassification methods. Finally, the limitation of the model space is\ndiscussed, and some potential solutions proposed.","url_abs":"http://arxiv.org/abs/1806.06232v3","url_pdf":"http://arxiv.org/pdf/1806.06232v3.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":"binary-classification-in-unstructured-space","repo_url":"https://github.com/aquemy/HCBR","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"binary-classification","task_name":"Binary Classification"},{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"feature-engineering","task_name":"Feature Engineering"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"missing-values","task_name":"Missing Values"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"aquemy/HCBR","kind":"official","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":"3feda3bdff90e7755513ca4d938e65573b15e72c0eb31f01bc1f388fdfda7ae3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}