• 천문학회보
• /
• 제41권2호
• /
• pp.54.2-54.2
• /
• 2016

We present a machine learning approach to estimating stellar atmospheric parameters, effective temperature (Teff), surface gravity (log g), and metallicity ([Fe/H]) for stars observed during the course of the Sloan Digital Sky Survey (SDSS). For training a neural network, we randomly sampled the SDSS data with stellar parameters available from SEGUE Stellar Parameter Pipeline (SSPP) to cover the parameter space as wide as possible. We selected stars that are not included in the training sample as validation sample to determine the accuracy and precision of each parameter. We also divided the training and validation samples into four groups that cover signal-to-noise ratio (S/N) of 10-20, 20-30, 30-50, and over 50 to assess the effect of S/N on the parameter estimation. We find from the comparison of the network-driven parameters with the SSPP ones the range of the uncertainties of 73~123 K in Teff, 0.18~0.42 dex in log g, and 0.12~0.25 dex in [Fe/H], respectively, depending on the S/N range adopted. We conclude that these precisions are high enough to study the chemical and kinematic properties of the Galactic disk and halo stars, and we will attempt to apply this technique to Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST), which plans to obtain about 8 million stellar spectra, in order to estimate stellar parameters.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2004년도 추계학술대회
• /
• pp.63-75
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. We analyze Gyeongnam social indicator survey data using decision tree techniques for environmental information. We can use these decision tree outputs for environmental preservation and improvement.

• 한국정보과학회논문지:데이타베이스
• /
• 제32권1호
• /
• pp.1-11
• /
• 2005

군집 질의는 사용자에 의해 명시된 질의 영역 내에서 큐브상의 군집 정보를 계산한다. 프리픽스-섬 기법에 기초한 기존의 방법론은 데이타의 누적된 합을 저장하기 위해 프리픽스-섬 큐브(PC)로 불리는 부가적인 큐브를 사용하므로 높은 저장공간 오버헤드를 초래한다. 이러한 저장공간 오버헤드는 기억장치의 추가적인 비용뿐만 아니라 업데이트의 부가적인 증식(propagation)과 더 많은 물리적 장치로의 접근시간을 유발시킨다. 본 논문에서는 대용량 데이타 웨어하우스에서 PC의 저장공간을 획기적으로 감소시킬 수 있는 'SPEC'으로 불리는 새로운 프리픽스-섬 큐브를 제안한다. SPEC은 PC내 셀들간의 종속에 의한 업데이트 증식을 감소시킨다. 이를 위해 대용량 데이타 큐브로부터 조밀한 서브큐브들을 발견하는 효과적인 알고리즘을 개발한다 다양한 차원의 데이타 큐브와 여러 가지 크기의 질의에 대해 폭 넓은 실험을 행하여 본 논문에서 제안한 방법의 효과와 성능을 조사한다. 실험적인 결과는 SPEC이 적절한 질의 성능을 유지하면서도 PC 저장공간을 상당히 감소시킴을 보여준다.

• Structural Monitoring and Maintenance
• /
• 제7권3호
• /
• pp.261-281
• /
• 2020

Civil structures may experience progressive deterioration and damage under environmental and operational conditions over their service life. Finite element (FE) model updating method is one of the most important approaches for damage identification in structures due to its capabilities in structural health monitoring. Although various damage detection approaches have been investigated on structures, there are limited studies on large-sized space structures. Thus, this paper aims to investigate the applicability and efficiency of sensitivity-based FE model updating framework for damage identification in large space structures from a distinct point of view. This framework facilitates modeling and model updating in large and geometric complicated space structures. Considering sensitivity-based FE model updating and vibration measurements, the discrepancy between acceleration response data in real damaged structure and hypothetical damaged structure have been minimized through adjusting the updating parameters. The feasibility and efficiency of the above-mentioned approach for damage identification has finally been demonstrated with two numerical examples: a flat double layer grid and a double layer diamatic dome. According to the results, this method can detect, localize, and quantify damages in large-scaled space structures very accurately which is robust to noisy data. Also, requiring a remarkably small number of iterations to converge, typically less than four, demonstrates the computational efficiency of this method.

• Journal of Astronomy and Space Sciences
• /
• 제32권2호
• /
• pp.113-120
• /
• 2015

When humans explore the Moon, lunar caves will be an ideal base to provide a shelter from the hazards of radiation, meteorite impact, and extreme diurnal temperature differences. In order to ascertain the existence of caves on the Moon, it is best to visit the Moon in person. The Google Lunar X Prize(GLXP) competition started recently to attempt lunar exploration missions. Ones of those groups competing, plan to land on a pit of Lacus Mortis and determine the existence of a cave inside this pit. In this pit, there is a ramp from the entrance down to the inside of the pit, which enables a rover to approach the inner region of the pit. In this study, under the assumption of the existence of a cave in this pit, a 3D model was developed based on the optical image data. Since this model simulates the actual terrain, the rendering of the model agrees well with the image data. Furthermore, the 3D printing of this model will enable more rigorous investigations and also could be used to publicize lunar exploration missions with ease.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.435-443
• /
• 2007

An important approach towards solving the scattered data problem is by using radial basis functions. However, for a large class of smooth basis functions such as Gaussians, the existing theories guarantee the interpolant to approximate well only for a very small class of very smooth approximate which is the so-called 'native' space. The approximands f need to be extremely smooth. Hence, the purpose of this paper is to study approximation by a scattered shifts of a radial basis functions. We provide error estimates on larger spaces, especially on the homogeneous Sobolev spaces.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 추계학술대회 학술발표 논문집
• /
• pp.433-439
• /
• 1998

In this paper, we present an approach to the structure identification based on the input space partition methods and to the parameter identification by hybrid learning method in neuro-fuzzy system. The structure identification can automatically estimate the number of membership function and fuzzy rule using grid partition, tree partition, scatter partition from numerical input-output data. And then the parameter identification is carried out by the hybrid learning scheme using back-propagation and least squares estimate. Finally, we sill show its usefulness for neuro-fuzzy modeling to truck backer-upper control.

• International Journal of Aeronautical and Space Sciences
• /
• 제3권1호
• /
• pp.19-29
• /
• 2002

Decentralized filtering for a formation flight instrumentation system by INS/GPS integration is considered in this paper. An elaborate tuning method of the measurement noise covariance is suggested to compensate modeling errors caused by decentralizing the extended Kalman filter. It does not require large data transfer between formation vehicles. Covariance analysis exhibits the superior performance of the proposed approach when compared with the existent decentralized filter and the global filter, which has the target-filter performance.

• 전자공학회논문지CI
• /
• 제41권6호
• /
• pp.39-46
• /
• 2004

클러스터 분석에 있어 중요한 문제 중의 하나는 주어진 데이터에 내재된 적절한 클러스터의 수를 찾아내는 것이다. 본 논문에서는 이러한 클러스터의 개수를 체계적으로 결정하기 위하여 IRC (Input Representation Coverage) 개념을 새로이 정의하고, 이를 이용하여 주어진 데이터에 적합한 클러스터의 개수를 자동 결정하는 방법을 제시한다. 또한, 이러한 방법의 유용성 및 응용성을 알아보기 위하여 가상 데이터를 가지고 분석 실험을 하였으며, 실험을 통해 데이터에 내재된 실제 클러스터의 개수를 찾아내는 데에 제안된 방법이 매우 유용하게 사용될 수 있음을 보여준다.

• ETRI Journal
• /
• 제43권6호
• /
• pp.1058-1080
• /
• 2021

Crime is not a completely random event but rather shows a pattern in space and time. Capturing the dynamic nature of crime patterns is a challenging task. Crime prediction models that rely only on neighborhood influence and demographic features might not be able to capture the dynamics of crime patterns, as demographic data collection does not occur frequently and is static. This work proposes a novel approach for crime count and hotspot prediction to capture the dynamic nature of crime patterns using taxi data along with historical crime and demographic data. The proposed approach predicts crime events in spatial units and classifies each of them into a hotspot category based on the number of crime events. Four models are proposed, which consider different covariates to select a set of independent variables. The experimental results show that the proposed combined subset model (CSM), in which static and dynamic aspects of crime are combined by employing the taxi dataset, is more accurate than the other models presented in this study.