• The Bulletin of The Korean Astronomical Society
• /
• v.41 no.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.10a
• /
• 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.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.1-11
• /
• 2005

An aggregation query computes aggregate information over a data cube in the query range specified by a user Existing methods based on the prefix-sum approach use an additional cube called the prefix-sum cube(PC), to store the cumulative sums of data, causing a high space overhead. This space overhead not only leads to extra costs for storage devices, but also causes additional propagations of updates and longer access time on physical devices. In this paper, we propose a new prefix-sum cube called 'SPEC' which drastically reduces the space of the PC in a large data warehouse. The SPEC decreases the update propagation caused by the dependency between values in cells of the PC. We develop an effective algorithm which finds dense sub-cubes from a large data cube. We perform an extensive experiment with respect to various dimensions of the data cube and query sizes, and examine the effectiveness and performance ot our proposed method. Experimental results show that the SPEC significantly reduces the space of the PC while maintaining a reasonable query performance.

• Structural Monitoring and Maintenance
• /
• v.7 no.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
• /
• v.32 no.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
• /
• v.23 no.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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• 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
• /
• v.3 no.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.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.6
• /
• pp.39-46
• /
• 2004

One of the significant issues in cluster analysis is to identify a proper number of clusters hidden under given data. In this paper we propose a novel approach to systematically determine the number of clusters based on Input Representation Coverage (IRC), which is newly defined as a quantified value of how well original input data in Gaussian feature space can be captured with a certain number of clusters. Furthermore, its usability and applicability is also investigated via experiments with synthetic data. Our experiment results show that the proposed approach is quite useful in approximately finding the real number of clusters implicitly contained in the data.

• ETRI Journal
• /
• v.43 no.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.