Cited by 84Adversarial Robustness in Machine LearningDomain Adaptation and Few-Shot LearningAdvanced Neural Network Applications

Open Category Classification by Adversarial Sample Generation

Open access
Yu, Yang, Qu, Wei-Yang, Li, Nan, Guo, Zimin·2017·Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence

Abstract

In real-world classification tasks, it is difficult to collect training samples from all possible categories of the environment. Therefore, when an instance of an unseen class appears in the prediction stage, a robust classifier should be able to tell that it is from an unseen class, instead of classifying it to be any known category. In this paper, adopting the idea of adversarial learning, we propose the ASG framework for open-category classification. ASG generates positive and negative samples of seen categories in the unsupervised manner via an adversarial learning strategy. With the generated samples, ASG then learns to tell seen from unseen in the supervised manner. Experiments performed on several datasets show the effectiveness of ASG.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.24963/ijcai.2017/469

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 3

  1. Ma and Perkins, 2003] Junshui Ma and Simon Perkins. Time-series novelty detection using one-class support vec- tor machines. In IJCNN'03, volume 3, pages 1741-1745, 2003.
  2. Walter J Scheirer, Terrance E Boult, Anderson de Rezende Rocha, and Archana Sapkota. To- ward open set recognition. IEEE Transactions on Pat- tern Analysis and Machine Intelligence, 35(7):1757-1772, 2013.
  3. Zhou and Chen, 2002] Zhi-Hua Zhou and Zhao-Qian Chen. Hybrid decision tree. Knowledge-based systems, 15(8):515-528, 2002.

Cited by

Sorted by citations

Authors
Yu, Y., Qu, W.-Y., Li, N., & Guo, Z.
Affiliations
  • National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China
  • Nanjing University (CN)
  • Alibaba Group (China) (CN)
  • University of California, Berkeley (US)
ORCID
Li, Nan
Venue
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Published
2017-08
Pages
3357-3363
OpenAlex
W2962914604
Cited by
84
References
23
Citations by year
2026: 5 · 2025: 14 · 2024: 16 · 2023: 18 · 2022: 7 · 2021: 6 · 2020: 7 · 2019: 8 · 2018: 3
FWCI
2.25
Type
conference paper
Language
en
Open access
Locations
  • International Joint Conference on Artificial Intelligence (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Natural Science Foundation of China (61333014, 61375061)
  • Nanjing University
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
Keywords
open-set recognition, adversarial sample generation, adversarial learning, unseen class detection, robust classification

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review