Hee Yong Youn

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Pardis Birzhandi

> Home > Persons > Hee Yong Youn

Publications

2022
[j87]
- view
  authority control:
- export record
  dblp key:
  - journals/soco/BirzhandiKY22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/BirzhandiKY22
Pardis Birzhandi, Kyung Tae Kim, Hee Yong Youn:
Reduction of training data for support vector machine: a survey. Soft Comput. 26(8): 3729-3742 (2022)
2019
[j72]
- view
  authority control:
- export record
  dblp key:
  - journals/aai/BirzhandiKLY19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aai/BirzhandiKLY19
Pardis Birzhandi, Kyung Tae Kim, Byung Jun Lee, Hee Yong Youn:
Reduction of Training Data Using Parallel Hyperplane for Support Vector Machine. Appl. Artif. Intell. 33(6): 497-516 (2019)
[j66]
- view
  authority control:
- export record
  dblp key:
  - journals/tjs/BirzhandiY19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tjs/BirzhandiY19
Pardis Birzhandi, Hee Yong Youn:
CBCH (clustering-based convex hull) for reducing training time of support vector machine. J. Supercomput. 75(8): 5261-5279 (2019)
[c222]
- view
  authority control:
- export record
  dblp key:
  - conf/iiaiaai/KimKBLY19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iiaiaai/KimKBLY19
SangYoun Kim, Sejun Kim, Pardis Birzhandi, Pei Heng Li, Hee Yong Youn:
A Solution for Dynamic Controller Provisioning Problem of SDN using Harmony Search. IIAI-AAI 2019: 605-610

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.