{"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/classification-using-link-prediction","title":"Classification Using Link Prediction","arxiv_id":"1810.00717","date":"2018-10-01","proceeding":null,"authors":["Seyed Amin Fadaee","Maryam Amir Haeri"],"abstract":"Link prediction in a graph is the problem of detecting the missing links that\nwould be formed in the near future. Using a graph representation of the data,\nwe can convert the problem of classification to the problem of link prediction\nwhich aims at finding the missing links between the unlabeled data (unlabeled\nnodes) and their classes. To our knowledge, despite the fact that numerous\nalgorithms use the graph representation of the data for classification, none\nare using link prediction as the heart of their classifying procedure. In this\nwork, we propose a novel algorithm called CULP (Classification Using Link\nPrediction) which uses a new structure namely Label Embedded Graph or LEG and a\nlink predictor to find the class of the unlabeled data. Different link\npredictors along with Compatibility Score - a new link predictor we proposed\nthat is designed specifically for our settings - has been used and showed\npromising results for classifying different datasets. This paper further\nimproved CULP by designing an extension called CULM which uses a majority vote\n(hence the M in the acronym) procedure with weights proportional to the\npredictions' confidences to use the predictive power of multiple link\npredictors and also exploits the low level features of the data. Extensive\nexperimental evaluations shows that both CULP and CULM are highly accurate and\ncompetitive with the cutting edge graph classifiers and general classifiers.","url_abs":"http://arxiv.org/abs/1810.00717v1","url_pdf":"http://arxiv.org/pdf/1810.00717v1.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":"classification-using-link-prediction","repo_url":"https://github.com/aminfadaee/culp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.00717","atlas_url":"https://app.syntology.ai/?focus=1810.00717","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":"1810.00717"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.00717\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.00717"},"call":"get_concepts_for_paper(arxiv_id=\"1810.00717\")"}],"by_repo":[{"repo":"aminfadaee/culp","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":"bc18ecee0910f3ce240c474231b3ef43f33ade2f61c901a66c162bf2258d943f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}