• Title/Summary/Keyword: SOM algorithm

Search Result 128, Processing Time 0.031 seconds

Water demand forecasting at the DMA level considering sociodemographic and waterworks characteristics (사회인구통계 및 상수도시설 특성을 고려한 소블록 단위 물 수요예측 연구)

  • Saemmul Jin;Dooyong Choi;Kyoungpil Kim;Jayong Koo
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.37 no.6
    • /
    • pp.363-373
    • /
    • 2023
  • Numerous studies have established a correlation between sociodemographic characteristics and water usage, identifying population as a primary independent variable in mid- to long-term demand forecasting. Recent dramatic sociodemographic changes, including urban concentration-rural depopulation, low birth rates-aging population, and the rise in single-person households, are expected to impact water demand and supply patterns. This underscores the necessity for operational and managerial changes in existing water supply systems. While sociodemographic characteristics are regularly surveyed, the conducted surveys use aggregate units that do not align with the actual system. Consequently, many water demand forecasts have been conducted at the administrative district level without adequately considering the water supply system. This study presents an upward water demand forecasting model that accurately reflects real water facilities and consumers. The model comprises three key steps. Firstly, Statistics Korea's SGIS (Statistical Geological Information System) data was reorganized at the DMA level. Secondly, DMAs were classified using the SOM (Self-Organizing Map) algorithm to consider differences in water facilities and consumer characteristics. Lastly, water demand forecasting employed the PCR (Principal Component Regression) method to address multicollinearity and overfitting issues. The performance evaluation of this model was conducted for DMAs classified as rural areas due to the insufficient number of DMAs. The estimation results indicate that the correlation coefficients exceeded 0.9, and the MAPE remained within approximately 10% for the test dataset. This method is expected to be useful for reorganization plans, such as the expansion and contraction of existing facilities.

A sequential pattern analysis for dynamic discovery of customers' preference (고객의 동적 선호 탐색을 위한 순차패턴 분석 : (주)더페이스샵 사례)

  • Song, Ki-Ryong;Noh, Soeng-Ho;Lee, Jae-Kwang;Choi, Il-Young;Kim, Jae-Kyeong
    • 한국경영정보학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • pp.153-170
    • /
    • 2008
  • Customers' needs change every moment. Profitability of stores can't be increased anymore with an existing standardized chain store management. Accordingly, a personalized store management tool needs through prediction of customers' preference. In this study, we propose a recommending procedure using dynamic customers' preference by analyzing the transaction database. We utilize self-organizing map algorithm and association rule mining which are applied to cluster the chain stores and explore purchase sequence of customers. We demonstrate that the proposed methodology makes an effect on recommendation of products in the market which is characterized by a fast fashion and a short product life cycle.

  • PDF

Realtime Multiple Vehicle Routing Problem using Self-Organization Map (자기조작화 신경망을 이용한 복수차량의 실시간 경로계획)

  • 이종태;장재진
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.4
    • /
    • pp.97-109
    • /
    • 2000
  • This work proposes a neural network approach to solve vehicle routing problems which have diverse application areas such as vehicle routing and robot programming. In solving these problems, classical mathematical approaches have many difficulties. In particular, it is almost impossible to implement a real-time vehicle routing with multiple vehicles. Recently, many researchers proposed methods to overcome the limitation by adopting heuristic algorithms, genetic algorithms, neural network techniques and others. The most basic model for path planning is the Travelling Salesman Problem(TSP) for a minimum distance path. We extend this for a problem with dynamic upcoming of new positions with multiple vehicles. In this paper, we propose an algorithm based on SOM(Self-Organization Map) to obtain a sub-optimal solution for a real-time vehicle routing problem. We develope a model of a generalized multiple TSP and suggest and efficient solving procedure.

  • PDF

Control of Inverted Pendulum Using Continuous Time Deadbeat Control (연속계 Deadbeat제어를 적용한 도립진자 제어)

  • Kim, Jin-Yong;Kim, Seung-Youal;Lee, Keum-Won
    • Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
    • /
    • 2004.05a
    • /
    • pp.555-558
    • /
    • 2004
  • Due to the asymptotic property, deadbeat control can hardly applied to the continuous time system control. But some delay element method can deal such a problem. Except delay element method, well-known digital deadbeat control can br used with the aid of som smoothing elements. In this paper, and order smoothing element is used for the smoothing of the digital deadbeat controller. And this element is argumented to the plant, and so control problem is to control digitally the argumented system. We simulated this control system using Matlab language and finally apply this algorithm to the rotary inverted pendulum system.

  • PDF

Feature Extraction of Letter Using Pattern Classifier Neural Network (패턴분류 신경회로망을 이용한 문자의 특징 추출)

  • Ryoo Young-Jae
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.2
    • /
    • pp.102-106
    • /
    • 2003
  • This paper describes a new pattern classifier neural network to extract the feature from a letter. The proposed pattern classifier is based on relative distance, which is measure between an input datum and the center of cluster group. So, the proposed classifier neural network is called relative neural network(RNN). According to definitions of the distance and the learning rule, the structure of RNN is designed and the pseudo code of the algorithm is described. In feature extraction of letter, RNN, in spite of deletion of learning rate, resulted in the identical performance with those of winner-take-all(WTA), and self-organizing-map(SOM) neural network. Thus, it is shown that RNN is suitable to extract the feature of a letter.

A Study on an Inductive Motion Edit Methodology using a Uniform Posture Map (균등 자세 지도를 이용한 귀납적 동작 편집 기법에 관한 연구)

  • 이범로;정진현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2C
    • /
    • pp.162-171
    • /
    • 2003
  • It is difficult to reuse the captured motion data, because the data has a difficulty in editing it. In this paper, a uniform posture mar (UPM) algorithm, one of unsupervised learning neural network is proposed to edit the captured motion data. Because it needs much less computational cost than other motion editing algorithms, it is adequate to apply in teal-time applications. The UPM algorithm prevents from generating an unreal posture in learning phase. It not only makes more realistic motion curves, but also contributes to making more natural motions. Above of all, it complements the weakness of the existing algorithm where the calculation quantity increases in proportion to increase the number of restricted condition to solve the problems of high order articulated body. In this paper, it is shown two applications as a visible the application instance of UPM algorithm. One is a motion transition editing system, the other is a inductive inverse kinematics system. This method could be applied to produce 3D character animation based on key frame method, 3D game, and virtual reality, etc.

The Pattern Analysis of Financial Distress for Non-audited Firms using Data Mining (데이터마이닝 기법을 활용한 비외감기업의 부실화 유형 분석)

  • Lee, Su Hyun;Park, Jung Min;Lee, Hyoung Yong
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.4
    • /
    • pp.111-131
    • /
    • 2015
  • There are only a handful number of research conducted on pattern analysis of corporate distress as compared with research for bankruptcy prediction. The few that exists mainly focus on audited firms because financial data collection is easier for these firms. But in reality, corporate financial distress is a far more common and critical phenomenon for non-audited firms which are mainly comprised of small and medium sized firms. The purpose of this paper is to classify non-audited firms under distress according to their financial ratio using data mining; Self-Organizing Map (SOM). SOM is a type of artificial neural network that is trained using unsupervised learning to produce a lower dimensional discretized representation of the input space of the training samples, called a map. SOM is different from other artificial neural networks as it applies competitive learning as opposed to error-correction learning such as backpropagation with gradient descent, and in the sense that it uses a neighborhood function to preserve the topological properties of the input space. It is one of the popular and successful clustering algorithm. In this study, we classify types of financial distress firms, specially, non-audited firms. In the empirical test, we collect 10 financial ratios of 100 non-audited firms under distress in 2004 for the previous two years (2002 and 2003). Using these financial ratios and the SOM algorithm, five distinct patterns were distinguished. In pattern 1, financial distress was very serious in almost all financial ratios. 12% of the firms are included in these patterns. In pattern 2, financial distress was weak in almost financial ratios. 14% of the firms are included in pattern 2. In pattern 3, growth ratio was the worst among all patterns. It is speculated that the firms of this pattern may be under distress due to severe competition in their industries. Approximately 30% of the firms fell into this group. In pattern 4, the growth ratio was higher than any other pattern but the cash ratio and profitability ratio were not at the level of the growth ratio. It is concluded that the firms of this pattern were under distress in pursuit of expanding their business. About 25% of the firms were in this pattern. Last, pattern 5 encompassed very solvent firms. Perhaps firms of this pattern were distressed due to a bad short-term strategic decision or due to problems with the enterpriser of the firms. Approximately 18% of the firms were under this pattern. This study has the academic and empirical contribution. In the perspectives of the academic contribution, non-audited companies that tend to be easily bankrupt and have the unstructured or easily manipulated financial data are classified by the data mining technology (Self-Organizing Map) rather than big sized audited firms that have the well prepared and reliable financial data. In the perspectives of the empirical one, even though the financial data of the non-audited firms are conducted to analyze, it is useful for find out the first order symptom of financial distress, which makes us to forecast the prediction of bankruptcy of the firms and to manage the early warning and alert signal. These are the academic and empirical contribution of this study. The limitation of this research is to analyze only 100 corporates due to the difficulty of collecting the financial data of the non-audited firms, which make us to be hard to proceed to the analysis by the category or size difference. Also, non-financial qualitative data is crucial for the analysis of bankruptcy. Thus, the non-financial qualitative factor is taken into account for the next study. This study sheds some light on the non-audited small and medium sized firms' distress prediction in the future.

SOMk-NN Search Algorithm for Content-Based Retrieval (내용기반 검색을 위한 SOMk-NN탐색 알고리즘)

  • O, Gun-Seok;Kim, Pan-Gu
    • Journal of KIISE:Databases
    • /
    • v.29 no.5
    • /
    • pp.358-366
    • /
    • 2002
  • Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the high speed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space and generates a topological feature map. A topological feature map preserves the mutual relations (similarities) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Therefore each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented a k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

Design Optimization and Analysis of a RBCC Engine Flowpath Using a Kriging Model Based Genetic Algorithm (Kriging 모델기반 유전자 알고리즘을 이용한 RBCC 엔진 유로 최적설계 및 분석)

  • Chae, Sang-Hyun;Kim, Hye-Sung;Yee, Kwan-Jung;Oh, Se-Jong;Choi, Jeong-Yeol
    • Journal of the Korean Society of Propulsion Engineers
    • /
    • v.21 no.1
    • /
    • pp.51-62
    • /
    • 2017
  • A design optimization method is applied for the flow path design of RBCC engine, an important factor for the determining the propulsion performance operating at air-breathing mode. A design optimization was carried out to maximize the specific impulse of the RBCC engine by using a genetic algorithm based on the Kriging model. Results are analyzed using ANOVA and SOM. Design conditions of ramjet and scramjet mode are selected as Mach number 4 at 20 km altitude and Mach number 7 at 30 km, respectively. The optimized design presents that the specific impulse is increased by 7% and 10% on each condition than the baseline design.

Development of Sentiment Analysis Model for the hot topic detection of online stock forums (온라인 주식 포럼의 핫토픽 탐지를 위한 감성분석 모형의 개발)

  • Hong, Taeho;Lee, Taewon;Li, Jingjing
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.1
    • /
    • pp.187-204
    • /
    • 2016
  • Document classification based on emotional polarity has become a welcomed emerging task owing to the great explosion of data on the Web. In the big data age, there are too many information sources to refer to when making decisions. For example, when considering travel to a city, a person may search reviews from a search engine such as Google or social networking services (SNSs) such as blogs, Twitter, and Facebook. The emotional polarity of positive and negative reviews helps a user decide on whether or not to make a trip. Sentiment analysis of customer reviews has become an important research topic as datamining technology is widely accepted for text mining of the Web. Sentiment analysis has been used to classify documents through machine learning techniques, such as the decision tree, neural networks, and support vector machines (SVMs). is used to determine the attitude, position, and sensibility of people who write articles about various topics that are published on the Web. Regardless of the polarity of customer reviews, emotional reviews are very helpful materials for analyzing the opinions of customers through their reviews. Sentiment analysis helps with understanding what customers really want instantly through the help of automated text mining techniques. Sensitivity analysis utilizes text mining techniques on text on the Web to extract subjective information in the text for text analysis. Sensitivity analysis is utilized to determine the attitudes or positions of the person who wrote the article and presented their opinion about a particular topic. In this study, we developed a model that selects a hot topic from user posts at China's online stock forum by using the k-means algorithm and self-organizing map (SOM). In addition, we developed a detecting model to predict a hot topic by using machine learning techniques such as logit, the decision tree, and SVM. We employed sensitivity analysis to develop our model for the selection and detection of hot topics from China's online stock forum. The sensitivity analysis calculates a sentimental value from a document based on contrast and classification according to the polarity sentimental dictionary (positive or negative). The online stock forum was an attractive site because of its information about stock investment. Users post numerous texts about stock movement by analyzing the market according to government policy announcements, market reports, reports from research institutes on the economy, and even rumors. We divided the online forum's topics into 21 categories to utilize sentiment analysis. One hundred forty-four topics were selected among 21 categories at online forums about stock. The posts were crawled to build a positive and negative text database. We ultimately obtained 21,141 posts on 88 topics by preprocessing the text from March 2013 to February 2015. The interest index was defined to select the hot topics, and the k-means algorithm and SOM presented equivalent results with this data. We developed a decision tree model to detect hot topics with three algorithms: CHAID, CART, and C4.5. The results of CHAID were subpar compared to the others. We also employed SVM to detect the hot topics from negative data. The SVM models were trained with the radial basis function (RBF) kernel function by a grid search to detect the hot topics. The detection of hot topics by using sentiment analysis provides the latest trends and hot topics in the stock forum for investors so that they no longer need to search the vast amounts of information on the Web. Our proposed model is also helpful to rapidly determine customers' signals or attitudes towards government policy and firms' products and services.