• Journal of Digital Convergence
• /
• v.17 no.5
• /
• pp.117-125
• /
• 2019

This study measured inefficiencies of Korean banks with weighted Russell directional distance function, WRDDM, for the years of 2004-2013. Checking contributions of inputs and outputs to these inefficiencies, we found that non-performing loan as undesirable output was the most influential factor. The annual average of inefficiencies of Korean banks was 0.3912, and it consisted of non-performing loan 0.1883, output factors 0.098 except non-performing loan, input factors 0.098. The annual average inefficiency went sharply up from 0.2995 to 0.4829 mainly due to the sharp increase of inefficiency of non-performing loan from 0.1088 to 0.2678 before and after 2007-2008 Global financial crisis. We empirically showed the non-performing loan needed to be considered since it was the most important factor among the influential factors of technical inefficiency such as manpower, total deposit, securities, and non-performing loan. This study had some limitation since we did not control financial environment factor in WRDDM.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.2
• /
• pp.219-224
• /
• 2020

Binary classification has been broadly investigated in machine learning. In addition, binary classification can be easily extended to multi class problems. To successfully utilize machine learning methods for classification tasks, preprocessing and feature extraction steps are essential. These are important steps to improve their classification performances. In this paper, we propose a new learning method based on weighted least squares. In the weighted least squares, designing weights has a significant role. Due to this necessity, we also propose a new technique to obtain weights that can achieve feature transformation. Based on this weighting technique, we also propose a method to combine the learning and feature extraction processes together to perform both processes simultaneously in one step. The proposed method shows the promising performance on five UCI machine learning data sets.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.1
• /
• pp.85-103
• /
• 2015

We prove some sharp extremal distance results for functions in various spaces of analytic functions on bounded strictly pseudoconvex domains with smooth boundary. Also, we obtain atomic decompositions in multifunctional Bloch and weighted Bergman spaces of analytic functions on strictly pseudoconvex domains with smooth boundary, which extend known results in the classical case of a single function.

• Communications for Statistical Applications and Methods
• /
• v.11 no.1
• /
• pp.153-160
• /
• 2004

In recent years, the size of data set which we usually handle is enormous, so a lot of outliers could be included in data set. Therefore the robust procedures that automatically handle outliers become very importance issue. We consider the robust estimation problem of location parameter in the univariate case. In this paper, we propose a new method for defining robustness weights for the weighted mean based on the median distance of observations and compare its performance with several existing robust estimators by a simulation study. It turns out that the proposed method is very competitive.

• Journal of the Korean Statistical Society
• /
• v.24 no.2
• /
• pp.349-360
• /
• 1995

This paper deals with the robustness properties of the minimum disparity estimation in linear regression models. The estimators defined as statistical quantities whcih minimize the blended weight Hellinger distance between a weighted kernel density estimator of the residuals and a smoothed model density of the residuals. It is shown that if the weights of the density estimator are appropriately chosen, the estimates of the regression parameters are robust.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.3
• /
• pp.169-180
• /
• 2013

The modification of conditional Fuzzy C-Means (CFCM) with Gaussian weights (CFCM_GW) is accomplished for blind equalization of channels in this paper. The proposed CFCM_GW can deal with both of linear and nonlinear channels, because it searches for the optimal desired states of an unknown channel in a direct manner, which is not dependent on the type of channel structure. In the search procedure of CFCM_GW, the Bayesian likelihood fitness function, the Gaussian weighted partition matrix and the conditional constraint are exploited. Especially, in contrast to the common Euclidean distance in conventional Fuzzy C-Means(FCM), the Gaussian weighted partition matrix and the conditional constraint in the proposed CFCM_GW make it more robust to the heavy noise communication environment. The selected channel states by CFCM_GW are always close to the optimal set of a channel even when the additive white Gaussian noise (AWGN) is heavily corrupted. These given channel states are utilized as the input of the Bayesian equalizer to reconstruct transmitted symbols. The simulation studies demonstrate that the performance of the proposed method is relatively superior to those of the existing conventional FCM based approaches in terms of accuracy and speed.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.409-414
• /
• 2010

The applications based on geographical location are increasing rapidly in wireless sensor networks (WSN). Recently, various localization algorithms have been proposed but the majority of algorithms rely on the specific hardware to measure the distance from the signal sources. In this paper, we propose the Weighted Multiple Rings Localization(WMRL). We assume that each deployed anchor node may periodically emit the successive beacon signals of the different power level. Then, the beacon signals form the concentric rings depending on their emitted power level, theoretically. The proposed algorithm defines the different weighting factor based on the ratio of each radius of ring. Also, If a sensor node may listen, it can find the innermost ring of the propagated signal for each anchor node. Based on this information, the location of a sensor node is derived by a weighted sum of coordinates of the surrounding anchor nodes. Our proposed algorithm is fully distributed and does not require any additional hardwares and the unreliable distance indications such as RSSI and LQI. Nevertheless, the simulation results show that the WMRL with two rings twice outperforms centroid algorithm. In the case of WMRL with three rings, the accuracy is approximately equal to WCL(Weighted Centroid Localization).

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.34-45
• /
• 2005

In this paper, a novel implementation of a person verification system based on depth-weighted Hausdorff distance (DWHD) using the surface curvature of the face is proposed. The definition of Hausdorff distance is a measure of the correspondence of two point sets. The approach works by finding the nose tip that has a protrusion shape on the face. In feature recognition of 3D face image, one has to take into consideration the orientated frontal posture to normalize after extracting face area from original image. The binary images are extracted by using the threshold values for the curvature value of surface for the person which has differential depth and surface characteristic information. The proposed DWHD measure for comparing two pixel sets were used, because it is simple and robust. In the experimental results, the minimum curvature which has low pixel distribution achieves recognition rate of 98% among the proposed methods.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.1-11
• /
• 2009

Recently there has arisen concern in both the database community and the graphics society about data retrieval from large motion databases because the high dimensionality of motion data implies high costs. In this circumstance, finding an effective distance measure and an efficient query processing method for such data is a challenging problem. This paper presents an elaborate motion query processing system, SMoFinder (Similar Motion Finder), which incorporates a novel kinematic distance measure and an efficient indexing strategy via adaptive frame segmentation. To this end, we regard human motions as multi-linkage kinematics and propose the weighted Minkowski distance metric. For efficient indexing, we devise a new adaptive segmentation method that chooses representative frames among similar frames and stores chosen frames instead of all frames. For efficient search, we propose a new search method that processes k-nearest neighbors queries over only representative frames. Our experimental results show that the size of motion databases is reduced greatly (${\times}1/25$) but the search capability of SMoFinder is equal to or superior to that of other systems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.2
• /
• pp.41-48
• /
• 1982

This paper presents an efficient algorithm for finding a new facility(center) in the Euclidean plane in accordance with minimax criterion: that is, the facility is located to minimize the maximum weighted Euclidean distance. The method given in this paper involves computational geometry. Some possible extensions of this problem are also discussed.