{"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/affinitynet-semi-supervised-few-shot-learning","title":"AffinityNet: semi-supervised few-shot learning for disease type prediction","arxiv_id":"1805.08905","date":"2018-05-22","proceeding":null,"authors":["Tianle Ma","Aidong Zhang"],"abstract":"While deep learning has achieved great success in computer vision and many\nother fields, currently it does not work very well on patient genomic data with\nthe \"big p, small N\" problem (i.e., a relatively small number of samples with\nhigh-dimensional features). In order to make deep learning work with a small\namount of training data, we have to design new models that facilitate few-shot\nlearning. Here we present the Affinity Network Model (AffinityNet), a data\nefficient deep learning model that can learn from a limited number of training\nexamples and generalize well. The backbone of the AffinityNet model consists of\nstacked k-Nearest-Neighbor (kNN) attention pooling layers. The kNN attention\npooling layer is a generalization of the Graph Attention Model (GAM), and can\nbe applied to not only graphs but also any set of objects regardless of whether\na graph is given or not. As a new deep learning module, kNN attention pooling\nlayers can be plugged into any neural network model just like convolutional\nlayers. As a simple special case of kNN attention pooling layer, feature\nattention layer can directly select important features that are useful for\nclassification tasks. Experiments on both synthetic data and cancer genomic\ndata from TCGA projects show that our AffinityNet model has better\ngeneralization power than conventional neural network models with little\ntraining data. The code is freely available at\nhttps://github.com/BeautyOfWeb/AffinityNet .","url_abs":"http://arxiv.org/abs/1805.08905v2","url_pdf":"http://arxiv.org/pdf/1805.08905v2.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":"affinitynet-semi-supervised-few-shot-learning","repo_url":"https://github.com/BeautyOfWeb/AffinityNet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"},{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"},{"task_slug":"graph-attention","task_name":"Graph Attention"},{"task_slug":"type-prediction","task_name":"Type prediction"},{"task_slug":"type","task_name":"Vocal Bursts Type Prediction"}],"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":"BeautyOfWeb/AffinityNet","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":"7ae229f483e8d4944ef2053822b0e02a51c1ef0d9efa779444ac294454e2a129","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}