• Korean Journal of Computational Design and Engineering
• /
• v.14 no.6
• /
• pp.382-389
• /
• 2009

Recently, knowledge management has been required in companies as a tool of competitiveness. Companies have constructed Enterprise Resource Planning(ERP) system in order to manage huge knowledge. But, it is not easy to formalize knowledge in organization. We focused on data mining system by genetic programming(GP). Data mining system by genetic programming can be useful tools to derive and extract the necessary information and knowledge from the huge accumulated data. However when we don't have enough amounts of data to perform the learning process of genetic programming, we have to reduce input parameter(s) or increase number of learning or training data. In this study, an enhanced data mining method combining Genetic Programming with Self organizing map, that reduces the number of input parameters, is suggested. Experiment results through a prototype implementation are also discussed.

• Journal of the Korean Society of Industry Convergence
• /
• v.6 no.1
• /
• pp.37-42
• /
• 2003

In this paper a self-organizing fuzzy system with rule pruning is proposed. A conventional self-organizing fuzzy system having only rule generation has a drawback in generating many slightly different rules from the existing rules which results in increased computation time and slowly learning. The proposed self-organizing fuzzy system generates fuzzy rules based on input-output data and prunes redundant rules which are caused by parameter training. The proposed system has a simple structure but performs almost equivalent function to the conventional self-organizing fuzzy system. Also, this system has better learning speed than the conventional system. Simulation results on several numerical examples demonstrate the performance of the proposed system.

• International Journal of Computer Science & Network Security
• /
• v.21 no.6
• /
• pp.23-28
• /
• 2021

The article discusses the features of adaptation of the parameters of the physical layer of data transmission in self-organizing networks based on unmanned aerial vehicles operating in the conditions of "smart cities". The concept of cities of this type is defined, the historical path of formation, the current state and prospects for further development in the aspect of transition to "smart cities" of the third generation are shown. Cities of this type are aimed at providing more comfortable and safe living conditions for citizens and autonomous automated work of all components of the urban economy. The perspective of the development of urban mobile automated technical means of infocommunications is shown, one of the leading directions of which is the creation and active use of wireless self-organizing networks based on unmanned aerial vehicles. The advantages of using small-sized unmanned aerial vehicles for organizing networks of this type are considered, as well as the range of tasks to be solved in the conditions of modern "smart cities". It is shown that for the transition to self-organizing networks in the conditions of "smart cities" of the third generation, it is necessary to ensure the adaptation of various levels of OSI network models to dynamically changing operating conditions, which is especially important for the physical layer. To maintain an acceptable level of the value of the bit error probability when transmitting command and telemetry data, it is proposed to adaptively change the coding rate depending on the signal-to-noise ratio at the receiver input (or on the number of channel decoder errors), and when transmitting payload data, it is also proposed to adaptively change the coding rate together with the choice of modulation methods that differ in energy and spectral efficiency. As options for the practical implementation of these solutions, it is proposed to use an approach based on the principles of neuro-fuzzy control, for which examples of determining the boundaries of theoretically achievable efficiency are given.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.1-20
• /
• 2001

The amount of financial information in sophisticated large data bases is huge and makes interfirm performance comparisons very difficult or at least very time consuming. The purpose of this paper is to investigate whether neural networks in the form of self-organizing maps (SOM) can be successfully employed to manage the complexity for competitive financial benchmarking. SOM is known to be very effective to visualize results by projecting multi-dimensional financial data into two-dimensional output space. Using the SOM, we overcome the problems of finding an appropriate underlying distribution and the functional form of data when structuring and analyzing a large data base, and show an efficient procedure of competitive financial benchmarking through clustering firms on two-dimensional visual space according to their respective financial competitiveness. For the empirical purpose, we analyze the data base of annual reports of 100 Korean listed companies over the years 1998, 1999, and 2000.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.9 no.1
• /
• pp.36-41
• /
• 2009

Self organizing map(SOM) is one of the unsupervised methods based on the competitive learning. Many clustering works have been performed using SOM. It has offered the data visualization according to its result. The visualized result has been used for decision process of descriptive data mining as exploratory data analysis. In this paper we propose improvement of SOM using stratified sampling of statistics. The stratification leads to improve the performance of SOM. To verify improvement of our study, we make comparative experiments using the data sets form UCI machine learning repository and simulation data.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.507-517
• /
• 2003

Self-organizing map (SOM) has been developed mainly by T. Kohonen and his colleagues as a unsupervised learning neural network. Because of its topological ordering property, SOM is known to be very useful in pattern recognition and text information retrieval areas. Recently, data miners use Kohonen´s mapping method frequently in exploratory analyses of large data sets. One problem facing SOM builder is that there exists no sensible criterion for evaluating goodness-of-fit of the map at hand. In this short communication, we propose valid evaluation procedures for the Kohonen SOM of any size. The methods can be used in selecting the best map among several candidates.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.2
• /
• pp.105-127
• /
• 2003

In this paper, four different data mining techniques, two neural networks and two statistical modeling techniques, are compared in terms of prediction accuracy in the context of bankruptcy prediction. In business setting, how to accurately detect the condition of a firm has been an important event in the literature. In neural networks, Backpropagation (BP) network and the Kohonen self-organizing feature map, are selected and compared each other while in statistical modeling techniques, discriminant analysis and logistic regression are also performed to provide performance benchmarks for the neural network experiment. The findings suggest that the BP network is a better choice among the data mining tools compared. This paper also identified some distinctive characteristics of Kohonen self-organizing feature map.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.3
• /
• pp.41-51
• /
• 2006

Clustering is to group similar objects into clusters. Until now there are a lot of approaches using Self-Organizing feature Maps (SOFMS) But they have problems with a small output-layer nodes and initial weight. For example, one of them is a one-dimension map of c output-layer nodes, if they want to make c clusters. This approach has problems to classify elaboratively. This Paper suggests one-dimensional output-layer nodes in SOFMs. The number of output-layer nodes is more than those of clusters intended to find and the order of output-layer nodes is ascending in the sum of the output-layer node's weight. We un find input data in SOFMs output node and classify input data in output nodes using Euclidean distance. The proposed algorithm was tested on well-known IRIS data and TSPLIB. The results of this computational study demonstrate the superiority of the proposed algorithm.

• Korean Journal of Social Welfare
• /
• v.64 no.1
• /
• pp.5-30
• /
• 2012

This study was carried out to understand the mean of neighbourhood and community organizing model on lived experiences of their organizing and members which had changed. The methods of collecting data was progressed in depth interview. According to study questions and analysis challenges based on theory, we analyzed texts. outcome of study we understood experiences of their organizing and members which had changed. In changing phases of organizational dimension, meaning of 'the discovery of the community problem' was extracted. In this time, organization's members set the goal and experience qualitative and quantitative changes of organization. On the other hand, changing phases of individual dimension were followed, which are 'escaping from locked life', 'reconstruction of self image', 'reconstructing the meaning of both family and self-concept' as well as 'reconstructing the meaning of both neighbourhood and self-concept'. Conclusively, we suggested practical implication, which might increase the effect of neighbourhood and community organizing model.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.257-264
• /
• 2005

This paper suggests a heuristic algorithm for the clustering problem. Clustering involves grouping similar objects into a cluster. Clustering is used in a wide variety of fields including data mining, marketing, and biology. Until now there are a lot of approaches using Self-Organizing Feature Maps(SOFMs). But they have problems with a small output-layer nodes and initial weight. For example, one of them is a one-dimension map of k output-layer nodes, if they want to make k clusters. This approach has problems to classify elaboratively. This paper suggests one-dimensional output-layer nodes in SOFMs. The number of output-layer nodes is more than those of clusters intended to find and the order of output-layer nodes is ascending in the sum of the output-layer node's weight. We can find input data in SOFMs output node and classify input data in output nodes using Euclidean distance. We use the well known IRIS data as an experimental data. Unsupervised clustering of IRIS data typically results in 15 - 17 clustering error. However, the proposed algorithm has only six clustering errors.