• Title/Summary/Keyword: SOM (Self-Organizing Map)

Search Result 235, Processing Time 0.036 seconds

Categorization of End-Users' Load Patterns Applied to Dynamically-Administered Critical Peak Pricing (Critical Peak Pricing 요금제 적용을 위한 소비자 부하 패턴 분류)

  • Joo, Jhi-Young;Kwon, Sang-Hyeok;Ahn, Sang-Ho;Yoon, Yong-Tae
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.586-587
    • /
    • 2008
  • 지난 논문 "Critical Peak Pricing 요금제를 이용한 일반 수용가 대상 수요관리의 방법" 및 그 후속 연구에서는 일반 수용가를 대상으로 한 효율적인 수요관리의 한 방법으로써 Critical Peak Pricing 요금제를 제안하였다[1]. 또한 이 요금제에서 핵심이 되는 최적 critical peak 시점을 푸는 하위 문제들 및 방법론을 제시하였는데, 이 논문에서는 그 하위 문제들 중 수용가의 부하를 예측하는 문제를 다룬다. 우리는 energy service provider(ESP)가 관리해야 할 수용가의 수가 매우 많다는 점에 주목하여, 각 수용가의 1일 부하 사용량 패턴을 몇 개의 그룹으로 나누어 각 그룹에 대해 critical peak 최적 시점을 결정하는 연구를 수행하였다. 이러한 수용가 부하량 패턴 그룹화를 위해 인공 지능의 여러 기법 중 하나인 self-organizing map(SOM)을 사용하였다.

  • PDF

Clustering Gene Expression Data by MCL Algorithm (MCL 알고리즘을 사용한 유전자 발현 데이터 클러스터링)

  • Shon, Ho-Sun;Ryu, Keun-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.4
    • /
    • pp.27-33
    • /
    • 2008
  • The clustering of gene expression data is used to analyze the results of microarray studies. This clustering is one of the frequently used methods in understanding degrees of biological change and gene expression. In biological research, MCL algorithm is an algorithm that clusters nodes within a graph, and is quick and efficient. We have modified the existing MCL algorithm and applied it to microarray data. In applying the MCL algorithm we put forth a simulation that adjusts two factors, namely inflation and diagonal tent and converted them by making use of Markov matrix. Furthermore, in order to distinguish class more clearly in the modified MCL algorithm we took the average of each row and used it as a threshold. Therefore, the improved algorithm can increase accuracy better than the existing ones. In other words, in the actual experiment, it showed an average of 70% accuracy when compared with an existing class. We also compared the MCL algorithm with the self-organizing map(SOM) clustering, K-means clustering and hierarchical clustering (HC) algorithms. And the result showed that it showed better results than ones derived from hierarchical clustering and K-means method.

Development of Sasang Type Diagnostic Test with Neural Network (신경망을 사용한 사상체질 진단검사 개발 연구)

  • Chae, Han;Hwang, Sang-Moon;Eom, Il-Kyu;Kim, Byoung-Chul;Kim, Young-In;Kim, Byung-Joo;Kwon, Young-Kyu
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.23 no.4
    • /
    • pp.765-771
    • /
    • 2009
  • The medical informatics for clustering Sasang types with collected clinical data is important for the personalized medicine, but it has not been thoroughly studied yet. The purpose of this study was to examine the usefulness of neural network data mining algorithm for traditional Korean medicine. We used Kohonen neural network, the Self-Organizing Map (SOM), for the analysis of biomedical information following data pre-processing and calculated the validity index as percentage correctly predicted and type-specific sensitivity. We can extract 12 data fields from 30 after data pre-processing with correlation analysis and latent functional relationship analysis. The profile of Myers-Briggs Type Inidcator and Bio-Impedance Analysis data which are clustered with SOM was similar to that of original measurements. The percentage correctly predicted was 56%, and sensitivity for So-Yang, Tae-Eum and So-Eum type were 56%, 48%, and 61%, respectively. This study showed that the neural network algorithm for clustering Sasang types based on clinical data is useful for the sasang type diagnostic test itself. We discussed the importance of data pre-processing and clustering algorithm for the validity of medical devices in traditional Korean medicine.

Crowd Density Estimation with Multi-class Adaboost in elevator (다중 클래스 아다부스트를 이용한 엘리베이터 내 군집 밀도 추정)

  • Kim, Dae-Hun;Lee, Young-Hyun;Ku, Bon-Hwa;Ko, Han-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.7
    • /
    • pp.45-52
    • /
    • 2012
  • In this paper, an crowd density in elevator estimation method based on multi-class Adaboost classifier is proposed. The SOM (Self-Organizing Map) based conventional methods have shown insufficient performance in practical scenarios and have weakness for low reproducibility. The proposed method estimates the crowd density using multi-class Adaboost classifier with texture features, namely, GLDM(Grey-Level Dependency Matrix) or GGDM(Grey-Gradient Dependency Matrix). In order to classify into multi-label, weak classifier which have better performance is generated by modifying a weight update equation of general Adaboost algorithm. The crowd density is classified into four categories depending on the number of persons in the crowd, which can be 0 person, 1-2 people, 3-4 people, and 5 or more people. The experimental results under indoor environment show the proposed method improves detection rate by about 20% compared to that of the conventional method.

CLUSTERING DNA MICROARRAY DATA BY STOCHASTIC ALGORITHM

  • Shon, Ho-Sun;Kim, Sun-Shin;Wang, Ling;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.438-441
    • /
    • 2007
  • Recently, due to molecular biology and engineering technology, DNA microarray makes people watch thousands of genes and the state of variation from the tissue samples of living body. With DNA Microarray, it is possible to construct a genetic group that has similar expression patterns and grasp the progress and variation of gene. This paper practices Cluster Analysis which purposes the discovery of biological subgroup or class by using gene expression information. Hence, the purpose of this paper is to predict a new class which is unknown, open leukaemia data are used for the experiment, and MCL (Markov CLustering) algorithm is applied as an analysis method. The MCL algorithm is based on probability and graph flow theory. MCL simulates random walks on a graph using Markov matrices to determine the transition probabilities among nodes of the graph. If you look at closely to the method, first, MCL algorithm should be applied after getting the distance by using Euclidean distance, then inflation and diagonal factors which are tuning modulus should be tuned, and finally the threshold using the average of each column should be gotten to distinguish one class from another class. Our method has improved the accuracy through using the threshold, namely the average of each column. Our experimental result shows about 70% of accuracy in average compared to the class that is known before. Also, for the comparison evaluation to other algorithm, the proposed method compared to and analyzed SOM (Self-Organizing Map) clustering algorithm which is divided into neural network and hierarchical clustering. The method shows the better result when compared to hierarchical clustering. In further study, it should be studied whether there will be a similar result when the parameter of inflation gotten from our experiment is applied to other gene expression data. We are also trying to make a systematic method to improve the accuracy by regulating the factors mentioned above.

  • PDF

Considering Customer Buying Sequences to Enhance the Quality of Collaborative Filtering (구매순서를 고려한 개선된 협업필터링 방법론)

  • Cho, Yeong-Bin;Cho, Yoon-Ho
    • Journal of Intelligence and Information Systems
    • /
    • v.13 no.2
    • /
    • pp.69-80
    • /
    • 2007
  • The preferences of customers change over time. However, existing collaborative filtering (CF) systems are static, since they only incorporate information regarding whether a customer buys a product during a certain period and do not make use of the purchase sequences of customers. Therefore, the quality of the recommendations of the typical CF could be improved through the use of information on such sequences. In this study, we propose a new methodology for enhancing the quality of CF recommendation that uses customer purchase sequences. The proposed methodology is applied to a large department store in Korea and compared to existing CF techniques. Various experiments using real-world data demonstrate that the proposed methodology provides higher quality recommendations than do typical CF techniques with better performance.

  • PDF

Financial Fraud Detection using Data Mining: A Survey

  • Sudhansu Ranjan Lenka;Bikram Kesari Ratha
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.9
    • /
    • pp.169-185
    • /
    • 2024
  • Due to levitate and rapid growth of E-Commerce, most of the organizations are moving towards cashless transaction Unfortunately, the cashless transactions are not only used by legitimate users but also it is used by illegitimate users and which results in trouncing of billions of dollars each year worldwide. Fraud prevention and Fraud Detection are two methods used by the financial institutions to protect against these frauds. Fraud prevention systems (FPSs) are not sufficient enough to provide fully security to the E-Commerce systems. However, with the combined effect of Fraud Detection Systems (FDS) and FPS might protect the frauds. However, there still exist so many issues and challenges that degrade the performances of FDSs, such as overlapping of data, noisy data, misclassification of data, etc. This paper presents a comprehensive survey on financial fraud detection system using such data mining techniques. Over seventy research papers have been reviewed, mainly within the period 2002-2015, were analyzed in this study. The data mining approaches employed in this research includes Neural Network, Logistic Regression, Bayesian Belief Network, Support Vector Machine (SVM), Self Organizing Map(SOM), K-Nearest Neighbor(K-NN), Random Forest and Genetic Algorithm. The algorithms that have achieved high success rate in detecting credit card fraud are Logistic Regression (99.2%), SVM (99.6%) and Random Forests (99.6%). But, the most suitable approach is SOM because it has achieved perfect accuracy of 100%. But the algorithms implemented for financial statement fraud have shown a large difference in accuracy from CDA at 71.4% to a probabilistic neural network with 98.1%. In this paper, we have identified the research gap and specified the performance achieved by different algorithms based on parameters like, accuracy, sensitivity and specificity. Some of the key issues and challenges associated with the FDS have also been identified.

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.

Forecasting Vacant Technology of Patent Analysis System using Self Organizing Map and Matrix Analysis (자기조직화 지도와 매트릭스분석을 이용한 특허분석시스템의 공백기술 예측)

  • Jun, Sung-Hae;Park, Sang-Sung;Shin, Young-Geun;Jang, Dong-Sik;Chung, Ho-Seok
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.2
    • /
    • pp.462-480
    • /
    • 2010
  • Patent analysis is the extracting knowledge which is needed for the company's research and development strategy through accumulated worldwide patent database. In order to set the future direction of corresponding technology which is scheduled to be developed, the technology trends and deployment processes are identified by analyzing results of present patent applications. The patent analysis provides the required results for analyzing present patent applications. In this paper, we will carry out technology classification for related patent analysis methods and systems. Moreover we will investigate and analyze related domestic patents, U.S. patents and IEEE papers. Due to the characteristics of technology sector, not only patents are applied but also research papers are released actively about patent analysis system. We will analyze patents according to the technology classification by using the final searching results which come from the selected search words in this study. To find necessary niche technology which is needed for patent analysis system, matrix analysis was performed to all of valid patents and papers. Identifying the technology development trends of registered patent analysis systems, and presenting the future direction of technology development which is related to patent analysis system. To figure out the technology which is developed relatively weak based on domestic patents, U.S patent and research papers by analyzing the valid patents and papers with statistical test and self-organizing map quantitatively. Then, presenting the necessity of this technology development.

Pattern Analysis in East Asian Coasts by using Sea Level Anomaly and Sea Surface Temperature Data (해수면 높이와 해수면 온도 자료를 이용한 동아시아 해역의 패턴 분석)

  • Hwang, Do-Hyun;Jeong, Min-Ji;Kim, Na-Kyeong;Park, Mi-So;Kim, Bo-Ram;Yoon, Hong-Joo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.3
    • /
    • pp.525-532
    • /
    • 2021
  • In the ocean, it is difficult to separate the effects of one cause due to the multiple causes, but the self-organizing map can be analyzed by adding other factors to the cluster result. Therefore, in this study, the results of the clustering of sea level data were applied to sea surface temperature. Sea level data was clustered into a total of 6 nodes. The difference between sea surface temperature and sea level height has a one-month delay, which applied sea surface temperature data a month ago to the clustered results. As a result of comparing the mean of sea surface temperature of 140 to 150°E, where the sea surface temperature was variously distributed, in the case of nodes 1, 3, and 5, it was possible to find a meandering sea surface temperature distribution that is clearly distinguished from the sea level data. While nodes 2, 4 and 6, the sea surface temperature distribution was smooth. In this study, sea surface temperature data were applied to the clustered results of sea level data, but later it is necessary to apply wind or geostrophic velocity data to compare.