• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.141-144
• /
• 2008

Many studies have been conducted on extracting buildings from ALS(Airborne Laser Scanning) data. After segmentation or classification of building points, additional steps such as generalization is required to get straight boundary lines that better approximate the real ones. In much research, orthogonal constraints are used to improve accuracies and qualities. All the lines of the building boundaries are assumed to be either parallel or perpendicular mutually. However, this assumption is not valid in many cases and more complex shapes of buildings have been increased. A new algorithm is presented that is applicable to various complex buildings. It consists of three steps of boundary tracing, grouping, and regularization. The performance of our approach was evaluated by applying the algorithm to some buildings and the results showed that our proposed method has good potential for extracting building boundaries of various shapes.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.4
• /
• pp.271-276
• /
• 2006

To implement a generalization of value functions in Adaptive Search Element (ASE)-reinforcement learning, CMAC (Cerebellar Model Articulation Controller) is integrated into ASE controller. ASE-reinforcement learning scheme is briefly studied to discuss how CMAC is integrated into ASE controller. Neighbourhood Sequential Training for CMAC is utilized to establish the look-up table and to produce discrete control outputs. In computer simulation, an ASE controller and a couple of ASE-CMAC neural network are trained to balance the inverted pendulum on a cart. The number of trials until the controllers are established and the learning performance of the controllers are evaluated to find that generalization ability of the CMAC improves the speed of the ASE-reinforcement learning enough to realize the cartpole control system.

• Communications for Statistical Applications and Methods
• /
• v.22 no.4
• /
• pp.333-348
• /
• 2015

In this paper, we study a generalization of the modified Weibull distribution. The generalization follows the recent work of Cordeiro et al. (2013) and is based on a class of exponentiated generalized distributions that can be interpreted as a double construction of Lehmann. We introduce a class of exponentiated generalized modified Weibull (EGMW) distribution and provide a list of some well-known distributions embedded within the proposed distribution. We derive some mathematical properties of this class that include ordinary moments, generating function and order statistics. We propose a maximum likelihood method to estimate model parameters and provide simulation results to assess the model performance. Real data is used to illustrate the usefulness of the proposed distribution for modeling reliability data.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.108-117
• /
• 1996

In this paper, we propose a new type of recurrent neural network architecture in which each output unit is connected with itself and fully-connected with other output units and all hidden units. The proposed recurrent network differs from Jordan's and Elman's recurrent networks in view of functions and architectures because it was originally extended from the multilayer feedforward neural network for improving the discrimination and generalization power. We also prove the convergence property of learning algorithm of the proposed recurrent neural network and analyze the performance of the proposed recurrent neural network by performing recognition experiments with the totally unconstrained handwritten numeral database of Concordia University of Canada. Experimental results confirmed that the proposed recurrent neural network improves the discrimination and generalization power in recognizing spatial patterns.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.3
• /
• pp.175-184
• /
• 2008

To construct user profiles automatically, an extraction method for representative keywords from a set of documents is needed. In our previous works, we suggested such a method and showed its usefulness. Here, we apply it to the classification problem and observe how much it contributes to performance improvement. The method can be used as a linear document classifier with few modifications. So, we first evaluate its performance for that case. The method is also applicable to some non-linear classification methods such as GIS (Generalized Instance Set). In GIS algorithm, generalized instances are built from training documents by a generalization function and then the K-NN algorithm is applied to them, where the method can be used as a generalization function. For comparative works, two famous linear classification methods, Rocchio and Widrow-Hoff algorithms, are also used. Experimental results show that our method is better than the others for the case that only positive documents are considered, but not when negative documents are considered together.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1110-1127
• /
• 2022

To improve the training efficiency and generalization performance of a support vector machine (SVM) in a large-scale set, an optimal SVM learning method based on adaptive sparse sampling and the granularity shift factor is presented. The proposed method combines sampling optimization with learner optimization. First, an adaptive sparse sampling method based on the potential function density clustering is designed to adaptively obtain sparse sampling samples, which can achieve a reduction in the training sample set and effectively approximate the spatial structure distribution of the original sample set. A granularity shift factor method is then constructed to optimize the SVM decision hyperplane, which fully considers the neighborhood information of each granularity region in the sparse sampling set. Experiments on an artificial dataset and three benchmark datasets show that the proposed method can achieve a relatively higher training efficiency, as well as ensure a good generalization performance of the learner. Finally, the effectiveness of the proposed method is verified.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.179-183
• /
• 2006

ECG consists of various waveforms of electric signals of heat. Datamining can be used for analyzing and classifying the waveforms. Conventional studies classifying electrocardiogram have problems like extraction of distorted characteristics, overfitting, etc. This study classifies electrocardiograms by using BP algorithm and SVM to solve the problems. As results, this study finds that SVM provides an effective prohibition of overfitting in neural networks and guarantees a sole global solution, showing excellence in generalization performance.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.79-89
• /
• 2016

In this paper, we proposed the object classification method using genetic and dynamic random forest consisting of optimal combination of unit tree. The random forest can ensure good generalization performance in combination of large amount of trees by assigning the randomization to the training samples and feature selection, etc. allocated to the decision tree as an ensemble classification model which combines with the unit decision tree based on the bagging. However, the random forest is composed of unit trees randomly, so it can show the excellent classification performance only when the sufficient amounts of trees are combined. There is no quantitative measurement method for the number of trees, and there is no choice but to repeat random tree structure continuously. The proposed algorithm is composed of random forest with a combination of optimal tree while maintaining the generalization performance of random forest. To achieve this, the problem of improving the classification performance was assigned to the optimization problem which found the optimal tree combination. For this end, the genetic algorithm methodology was applied. As a result of experiment, we had found out that the proposed algorithm could improve about 3~5% of classification performance in specific cases like common database and self infrared database compare with the existing random forest. In addition, we had shown that the optimal tree combination was decided at 55~60% level from the maximum trees.

• Korea Journal of Hospital Management
• /
• v.17 no.4
• /
• pp.87-115
• /
• 2012

This research classified hospital specialization strategy types through cluster analysis, analyzed fitness of hospital specialization strategy types for external environment or organizational structure, and examined relation between hospital specialization strategy types and organizational performance. This research surveyed 1,437 hospitals which have more than 30 patient's bed and practice national health service in Korea. Specifically, this research divided into two part : external fit - analysis of relation between external environment and specialization strategy, internal fit-analysis of relation between organizational structure factors and specialization strategy. also, as the organizational performance for achieving specialization strategic purpose, not only the productivity, efficiency, profit but also the medical quality was considered. In case of external fit, many hospitals chose integration type if there are a lot of competitive hospitals and regional population. Particularly, if there are many competitive hospitals, concentration type is chosen. In contrast, if there are many doctors in the region, differentiation type is chosen. In case of internal fit, according to organization type and patient's bed number, hospitals chose different types. If it is a general hospital and has a few bed number, generalization or concentration type is chosen. Tertiary hospital or the hospital with many patient's bed chose differentiation type. According to the number of specialists, if there are a few specialists, generalization or concentration type is chosen. If there are many specialists, differentiation type has high fitness for the hospital. In relation to strategy types and organizational performance, differentiation type has best result. Differentiation type has a good result in 7 items out of 11.

• Journal of information and communication convergence engineering
• /
• v.21 no.3
• /
• pp.198-207
• /
• 2023

Responding to changes in artificial intelligence models and the data environment is crucial for increasing data-learning accuracy and inference stability of industrial applications. A learning model that is overfitted to specific training data leads to poor learning performance and a deterioration in flexibility. Therefore, an early stopping technique is used to stop learning at an appropriate time. However, this technique does not consider the homogeneity and independence of the data collected by heterogeneous nodes in a differential network environment, thus resulting in low learning accuracy and degradation of system performance. In this study, the generalization performance of neural networks is maximized, whereas the effect of the homogeneity of datasets is minimized by achieving an accuracy of 99.7%. This corresponds to a decrease in delay time by a factor of 2.33 and improvement in performance by a factor of 2.5 compared with the conventional method.