Zobrazeno 1 - 10
of 140
pro vyhledávání: '"Byung-Ro Moon"'
Publikováno v:
Advances in Meteorology, Vol 2018 (2018)
Significant errors exist in automated meteorological data, and identifying them is very important. In this paper, we present a novel method for determining abnormal values in meteorological observations based on support vector regression (SVR). SVR i
Externí odkaz:
https://doaj.org/article/3eb40dc3f740488c80793f5641b354e0
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2016 (2016)
In genetic algorithms, selection or mating scheme is one of the important operations. In this paper, we suggest an adaptive mating scheme using previously suggested Hungarian mating schemes. Hungarian mating schemes consist of maximizing the sum of m
Externí odkaz:
https://doaj.org/article/ba51c6df00214873baaea94f870f9fdb
Publikováno v:
Swarm and Evolutionary Computation. 49:75-86
Graph pattern matching is a key problem in many applications which data is represented in the form of a graph, and this problem is generally defined as a subgraph isomorphism. In this paper, we analyze an incremental hybrid genetic algorithm for the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02e4e1dada4c7bef615a6ac304f5460a
https://doi.org/10.1016/j.swevo.2019.05.004
https://doi.org/10.1016/j.swevo.2019.05.004
Publikováno v:
Advances in Meteorology, Vol 2018 (2018)
Significant errors exist in automated meteorological data, and identifying them is very important. In this paper, we present a novel method for determining abnormal values in meteorological observations based on support vector regression (SVR). SVR i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cca6332285aae7a1136f9c41cf735398
https://doi.org/10.1155/2018/5439256
https://doi.org/10.1155/2018/5439256
Autor:
Byung-Ro Moon, Hansang Yun
Publikováno v:
GECCO (Companion)
A barrier tree is a model for representing the hierarchical distribution of local optima and valleys. While it is useful, constructing a barrier tree is challenging for a large problem instance. In this paper, we propose an efficient method to approx
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96deb503fe1700751772d621cf4234a5
https://doi.org/10.1145/3205651.3205715
https://doi.org/10.1145/3205651.3205715
Publikováno v:
GECCO
We suggest a use of genetic programming for transformation from a vector space to an understandable graph representation, which is part of a project to inspect the latent space in matrix factorization. Given a relation matrix, we can apply standard t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a970b0f00421d0affec2eddfbf7a03d1
https://doi.org/10.1145/3205455.3205493
https://doi.org/10.1145/3205455.3205493
Autor:
Byung-Ro Moon, Myoung Hoon Ha
A neural network-based chart pattern represents adaptive parametric features, including non-linear transformations, and a template that can be applied in the feature space. The search of neural network-based chart patterns has been unexplored despite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a795d43187013eb382d9914d304f2dc6
http://arxiv.org/abs/1706.05283
http://arxiv.org/abs/1706.05283
Autor:
Dong-Il Seo1 diseo@soar.snu.ac.kr, Byung-Ro Moon1 moon@soar.snu.ac.kr
Publikováno v:
Evolutionary Computation. Summer2007, Vol. 15 Issue 2, p169-198. 30p.
Publikováno v:
Information Processing Letters. 113:640-645
Since Laderman showed an algorithm for 3x3 matrix multiplication using 23 scalar multiplications, Johnson and McLoughlin used a numerical optimization and human controlled method to give two parameterized algorithms in which the coefficients are rati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7bde91fcb02f0139e02a4f7b8a38361
https://doi.org/10.1016/j.ipl.2013.05.011
https://doi.org/10.1016/j.ipl.2013.05.011
Publikováno v:
GECCO (Companion)
In this paper, we propose an incremental genetic algorithm applied to solve the maximum cut problem. We test the implementation of the algorithm on benchmark graph instances. We propose several methods to build up the sequence of subproblems, and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76dae64560b01f6a6eeadc9077e85af8
https://doi.org/10.1145/2908961.2908976
https://doi.org/10.1145/2908961.2908976