{"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/active-learning-from-positive-and-unlabeled","title":"Active Learning from Positive and Unlabeled Data","arxiv_id":"1602.07495","date":"2016-02-24","proceeding":null,"authors":["Alireza Ghasemi","Hamid R. Rabiee","Mohsen Fadaee","Mohammad T. Manzuri","Mohammad H. Rohban"],"abstract":"During recent years, active learning has evolved into a popular paradigm for\nutilizing user's feedback to improve accuracy of learning algorithms. Active\nlearning works by selecting the most informative sample among unlabeled data\nand querying the label of that point from user. Many different methods such as\nuncertainty sampling and minimum risk sampling have been utilized to select the\nmost informative sample in active learning. Although many active learning\nalgorithms have been proposed so far, most of them work with binary or\nmulti-class classification problems and therefore can not be applied to\nproblems in which only samples from one class as well as a set of unlabeled\ndata are available.\n  Such problems arise in many real-world situations and are known as the\nproblem of learning from positive and unlabeled data. In this paper we propose\nan active learning algorithm that can work when only samples of one class as\nwell as a set of unlabelled data are available. Our method works by separately\nestimating probability desnity of positive and unlabeled points and then\ncomputing expected value of informativeness to get rid of a hyper-parameter and\nhave a better measure of informativeness./ Experiments and empirical analysis\nshow promising results compared to other similar methods.","url_abs":"http://arxiv.org/abs/1602.07495v1","url_pdf":"http://arxiv.org/pdf/1602.07495v1.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":"active-learning-from-positive-and-unlabeled","repo_url":"https://github.com/aghasemi/alpud","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"informativeness","task_name":"Informativeness"},{"task_slug":"multi-class-classification","task_name":"Multi-class Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1602.07495","atlas_url":"https://app.syntology.ai/?focus=1602.07495","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":"1602.07495"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1602.07495\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1602.07495"},"call":"get_concepts_for_paper(arxiv_id=\"1602.07495\")"}],"by_repo":[{"repo":"aghasemi/alpud","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":"da1b74e5be7211d3ac65501212a1394825f17c8b7cf8e800fb6f535054ed1ba3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}