{"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/fence-gan-towards-better-anomaly-detection","title":"Fence GAN: Towards Better Anomaly Detection","arxiv_id":"1904.01209","date":"2019-04-02","proceeding":null,"authors":["Cuong Phuc Ngo","Amadeus Aristo Winarto","Connie Kou Khor Li","Sojeong Park","Farhan Akram","Hwee Kuan Lee"],"abstract":"Anomaly detection is a classical problem where the aim is to detect anomalous\ndata that do not belong to the normal data distribution. Current\nstate-of-the-art methods for anomaly detection on complex high-dimensional data\nare based on the generative adversarial network (GAN). However, the traditional\nGAN loss is not directly aligned with the anomaly detection objective: it\nencourages the distribution of the generated samples to overlap with the real\ndata and so the resulting discriminator has been found to be ineffective as an\nanomaly detector. In this paper, we propose simple modifications to the GAN\nloss such that the generated samples lie at the boundary of the real data\ndistribution. With our modified GAN loss, our anomaly detection method, called\nFence GAN (FGAN), directly uses the discriminator score as an anomaly\nthreshold. Our experimental results using the MNIST, CIFAR10 and KDD99 datasets\nshow that Fence GAN yields the best anomaly classification accuracy compared to\nstate-of-the-art methods.","url_abs":"http://arxiv.org/abs/1904.01209v1","url_pdf":"http://arxiv.org/pdf/1904.01209v1.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":"fence-gan-towards-better-anomaly-detection","repo_url":"https://github.com/phuccuongngo99/Fence_GAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"anomaly-classification","task_name":"Anomaly Classification"},{"task_slug":"anomaly-detection","task_name":"Anomaly Detection"},{"task_slug":null,"task_name":"Generative Adversarial Network"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.01209","atlas_url":"https://app.syntology.ai/?focus=1904.01209","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":"1904.01209"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.01209\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.01209"},"call":"get_concepts_for_paper(arxiv_id=\"1904.01209\")"}],"by_repo":[{"repo":"phuccuongngo99/Fence_GAN","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":"c8f3b0399ea9516fe7006e07e0e78d004f5bc50e8ff03dc40748fdaf7fee6890","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}