{"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/fast-incremental-svdd-learning-algorithm-with","title":"Fast Incremental SVDD Learning Algorithm with the Gaussian Kernel","arxiv_id":"1709.00139","date":"2017-09-01","proceeding":null,"authors":["Hansi Jiang","Haoyu Wang","Wenhao Hu","Deovrat Kakde","Arin Chaudhuri"],"abstract":"Support vector data description (SVDD) is a machine learning technique that\nis used for single-class classification and outlier detection. The idea of SVDD\nis to find a set of support vectors that defines a boundary around data. When\ndealing with online or large data, existing batch SVDD methods have to be rerun\nin each iteration. We propose an incremental learning algorithm for SVDD that\nuses the Gaussian kernel. This algorithm builds on the observation that all\nsupport vectors on the boundary have the same distance to the center of sphere\nin a higher-dimensional feature space as mapped by the Gaussian kernel\nfunction. Each iteration involves only the existing support vectors and the new\ndata point. Moreover, the algorithm is based solely on matrix manipulations;\nthe support vectors and their corresponding Lagrange multiplier $\\alpha_i$'s\nare automatically selected and determined in each iteration. It can be seen\nthat the complexity of our algorithm in each iteration is only $O(k^2)$, where\n$k$ is the number of support vectors. Experimental results on some real data\nsets indicate that FISVDD demonstrates significant gains in efficiency with\nalmost no loss in either outlier detection accuracy or objective function\nvalue.","url_abs":"http://arxiv.org/abs/1709.00139v4","url_pdf":"http://arxiv.org/pdf/1709.00139v4.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":"fast-incremental-svdd-learning-algorithm-with","repo_url":"https://github.com/hs-jiang/FISVDD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"incremental-learning","task_name":"Incremental Learning"},{"task_slug":"outlier-detection","task_name":"Outlier Detection"}],"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":"hs-jiang/FISVDD","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":"5055280e3d6469cc5c508d8e81113448911d98bb1e639dbbdf4a8803a07829d8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}