• Title/Summary/Keyword: SELF-ORGANIZING MAP

Search Result 424, Processing Time 0.027 seconds

Centroid Neural Network with Bhattacharyya Kernel (Bhattacharyya 커널을 적용한 Centroid Neural Network)

  • Lee, Song-Jae;Park, Dong-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.861-866
    • /
    • 2007
  • A clustering algorithm for Gaussian Probability Distribution Function (GPDF) data called Centroid Neural Network with a Bhattacharyya Kernel (BK-CNN) is proposed in this paper. The proposed BK-CNN is based on the unsupervised competitive Centroid Neural Network (CNN) and employs a kernel method for data projection. The kernel method adopted in the proposed BK-CNN is used to project data from the low dimensional input feature space into higher dimensional feature space so as the nonlinear problems associated with input space can be solved linearly in the feature space. In order to cluster the GPDF data, the Bhattacharyya kernel is used to measure the distance between two probability distributions for data projection. With the incorporation of the kernel method, the proposed BK-CNN is capable of dealing with nonlinear separation boundaries and can successfully allocate more code vector in the region that GPDF data are densely distributed. When applied to GPDF data in an image classification probleml, the experiment results show that the proposed BK-CNN algorithm gives 1.7%-4.3% improvements in average classification accuracy over other conventional algorithm such as k-means, Self-Organizing Map (SOM) and CNN algorithms with a Bhattacharyya distance, classed as Bk-Means, B-SOM, B-CNN algorithms.

A New Approach to Solve the TSP using an Improved Genetic Algorithm

  • Gao, Qian;Cho, Young-Im;Xi, Su Mei
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.4
    • /
    • pp.217-222
    • /
    • 2011
  • Genetic algorithms are one of the most important methods used to solve the Traveling Salesman Problem. Therefore, many researchers have tried to improve the Genetic Algorithm by using different methods and operations in order to find the optimal solution within reasonable time. This paper intends to find a new approach that adopts an improved genetic algorithm to solve the Traveling Salesman Problem, and compare with the well known heuristic method, namely, Kohonen Self-Organizing Map by using different data sets of symmetric TSP from TSPLIB. In order to improve the search process for the optimal solution, the proposed approach consists of three strategies: two separate tour segments sets, the improved crossover operator, and the improved mutation operator. The two separate tour segments sets are construction heuristic which produces tour of the first generation with low cost. The improved crossover operator finds the candidate fine tour segments in parents and preserves them for descendants. The mutation operator is an operator which can optimize a chromosome with mutation successfully by altering the mutation probability dynamically. The two improved operators can be used to avoid the premature convergence. Simulation experiments are executed to investigate the quality of the solution and convergence speed by using a representative set of test problems taken from TSPLIB. The results of a comparison between the new approach using the improved genetic algorithm and the Kohonen Self-Organizing Map show that the new approach yields better results for problems up to 200 cities.

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
    • Information Systems Review
    • /
    • v.10 no.2
    • /
    • pp.195-209
    • /
    • 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.

A Resource Clustering Method Considering Weight of Application Characteristic in Hybrid Cloud Environment (하이브리드 클라우드 환경에서의 응용 특성 가중치를 고려한 자원 군집화 기법)

  • Oh, Yoori;Kim, Yoonhee
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.8
    • /
    • pp.481-486
    • /
    • 2017
  • There are many scientists who want to perform experiments in a cloud environment, and pay-per-use services allow scientists to pay only for cloud services that they need. However, it is difficult for scientists to select a suitable set of resources since those resources are comprised of various characteristics. Therefore, classification is needed to support the effective utilization of cloud resources. Thus, a dynamic resource clustering method is needed to reflect the characteristics of the application that scientists want to execute. This paper proposes a resource clustering analysis method that takes into account the characteristics of an application in a hybrid cloud environment. The resource clustering analysis applies a Self-Organizing Map and K-means algorithm to dynamically cluster similar resources. The results of the experiment indicate that the proposed method can classify a similar resource cluster by reflecting the application characteristics.

Content-based Image Retrieval Using Data Fusion Strategy (데이터 융합을 이용한 내용기반 이미지 검색에 관한 연구)

  • Paik, Woo-Jin;Jung, Sun-Eun;Kim, Gi-Young;Ahn, Eui-Gun;Shin, Moon-Sun
    • Journal of the Korean Society for information Management
    • /
    • v.25 no.2
    • /
    • pp.49-68
    • /
    • 2008
  • In many information retrieval experiments, the data fusion techniques have been used to achieve higher effectiveness in comparison to the single evidence-based retrieval. However, there had not been many image retrieval studies using the data fusion techniques especially in combining retrieval results based on multiple retrieval methods. In this paper, we describe how the image retrieval effectiveness can be improved by combining two sets of the retrieval results using the Sobel operator-based edge detection and the Self Organizing Map(SOM) algorithms. We used the clip art images from a commercial collection to develop a test data set. The main advantage of using this type of the data set was the clear cut relevance judgment, which did not require any human intervention.

Application of SOM for the Detection of Spatial Distribution considering the Analysis of Basic Statistics for Water Quality and Runoff Data (수질 및 유량자료의 기초통계량 분석에 따른 공간분포 파악을 위한 SOM의 적용)

  • Jin, Young-Hoon;Kim, Yong-Gu;Roh, Kyong-Bum;Park, Sung-Chun
    • Journal of Korean Society on Water Environment
    • /
    • v.25 no.5
    • /
    • pp.735-741
    • /
    • 2009
  • In order to support the basic information for planning and performing the environment management such as Total Maximum Daily Loads (TMDLs), it is highly recommended to understand the spatial distribution of water quality and runoff data in the unit watersheds. Therefore, in the present study, we applied Self-Organizing Map (SOM) to detect the characteristics of spatial distribution of Biological Oxygen Demand (BOD) concentration and runoff data which have been measured in the Yeongsan, Seomjin, and Tamjin River basins. For the purpose, the input dataset for SOM was constructed with the mean, standard deviation, skewness, and kurtosis values of the respective data measured from the stations of 22-subbasins in the rivers. The results showed that the $4{\times}4$ array structure of SOM was selected by the trial and error method and the best performance was revealed when it classified the stations into three clusters according to the basic statistics. The cluster-1 and 2 were classified primarily by the skewness and kurtosis of runoff data and the cluster-3 including the basic statistics of YB_B, YB_C, and YB_D stations was clearly decomposed by the mean value of BOD concentration showing the worst condition of water quality among the three clusters. Consequently, the methodology based on the SOM proposed in the present study can be considered that it is highly applicable to detect the spatial distribution of BOD concentration and runoff data and it can be used effectively for the further utilization using different water quality items as a data analysis tool.

Classification of Consonants by SOM and LVQ (SOM과 LVQ에 의한 자음의 분류)

  • Lee, Chai-Bong;Lee, Chang-Young
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.1
    • /
    • pp.34-42
    • /
    • 2011
  • In an effort to the practical realization of phonetic typewriter, we concentrate on the classification of consonants in this paper. Since many of consonants do not show periodic behavior in time domain and thus the validity for Fourier analysis of them are not convincing, vector quantization (VQ) via LBG clustering is first performed to check if the feature vectors of MFCC and LPCC are ever meaningful for consonants. Experimental results of VQ showed that it's not easy to draw a clear-cut conclusion as to the validity of Fourier analysis for consonants. For classification purpose, two kinds of neural networks are employed in our study: self organizing map (SOM) and learning vector quantization (LVQ). Results from SOM revealed that some pairs of phonemes are not resolved. Though LVQ is free from this difficulty inherently, the classification accuracy was found to be low. This suggests that, as long as consonant classification by LVQ is concerned, other types of feature vectors than MFCC should be deployed in parallel. However, the combination of MFCC/LVQ was not found to be inferior to the classification of phonemes by language-moded based approach. In all of our work, LPCC worked worse than MFCC.

VQ Codebook Design and Feature Extraction of Image Information for Multimedia Information Searching (멀티미디어 정보검색에 적합한 영상정보의 벡터 양자화 코드북 설계 및 특징추출)

  • Seo, Seok-Bae;Kim, Dae-Jin;Kang, Dae-Seong
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.8
    • /
    • pp.101-112
    • /
    • 1999
  • In this paper, the codebook design method of VQ (vector quantization) is proposed an method to extract feature data of image for multimedia information searching. Conventional VQ codebook design methods are unsuitable to extract the feature data of images because they have too much computation time, memory for vector decoding and blocking effects like DCT (discrete cosine transform). The proposed design method is consists of the feature extraction by WT (wavelet transform) and the data group divide method by PCA (principal component analysis). WT is introduced to remove the blocking effect of an image with high compressing ratio. Computer simulations show that the proposed method has the better performance in processing speed than the VQ design method using SOM (self-organizing map).

  • PDF

Subsequent application of self-organizing map and hidden Markov models infer community states of stream benthic macroinvertebrates

  • Kim, Dong-Hwan;Nguyen, Tuyen Van;Heo, Muyoung;Chon, Tae-Soo
    • Journal of Ecology and Environment
    • /
    • v.38 no.1
    • /
    • pp.95-107
    • /
    • 2015
  • Because an ecological community consists of diverse species that vary nonlinearly with environmental variability, its dynamics are complex and difficult to analyze. To investigate temporal variations of benthic macroinvertebrate community, we used the community data that were collected at the sampling site in Baenae Stream near Busan, Korea, which is a clean stream with minimum pollution, from July 2006 to July 2013. First, we used a self-organizing map (SOM) to heuristically derive the states that characterizes the biotic condition of the benthic macroinvertebrate communities in forms of time series data. Next, we applied the hidden Markov model (HMM) to fine-tune the states objectively and to obtain the transition probabilities between the states and the emission probabilities that show the connection of the states with observable events such as the number of species, the diversity measured by Shannon entropy, and the biological water quality index (BMWP). While the number of species apparently addressed the state of the community, the diversity reflected the state changes after the HMM training along with seasonal variations in cyclic manners. The BMWP showed clear characterization of events that correspond to the different states based on the emission probabilities. The environmental factors such as temperature and precipitation also indicated the seasonal and cyclic changes according to the HMM. Though the usage of the HMM alone can guarantee the convergence of the training or the precision of the derived states based on field data in this study, the derivation of the states by the SOM that followed the fine-tuning by the HMM well elucidated the states of the community and could serve as an alternative reference system to reveal the ecological structures in stream communities.

Detecting response patterns of zooplankton to environmental parameters in shallow freshwater wetlands: discovery of the role of macrophytes as microhabitat for epiphytic zooplankton

  • Choi, Jong-Yun;Kim, Seong-Ki;Jeng, Kwang-Seuk;Joo, Gea-Jae
    • Journal of Ecology and Environment
    • /
    • v.38 no.2
    • /
    • pp.133-143
    • /
    • 2015
  • Freshwater macrophytes improve the structural heterogeneity of microhabitats in water, often providing an important habitat for zooplankton. Some studies have focused on the overall influence of macrophytes on zooplankton, but the effects of macrophyte in relation to different habitat characteristics of zooplankton (e.g., epiphytic and pelagic) have not been intensively studied. We hypothesized that different habitat structures (i.e., macrophyte habitat) would strongly affect zooplankton distribution. We investigated zooplankton density and diversity, macrophyte characteristics (dry weight and species number), and environmental parameters in 40 shallow wetlands in South Korea. Patterns in the data were analyzed using a self-organizing map (SOM), which extracts information through competitive and adaptive properties. A total of 20 variables (11 environmental parameters and 9 zooplankton groups) were patterned onto the SOM. Based on a U-matrix, 3 clusters were identified from the model. Zooplankton assemblages were positively related to macrophyte characteristics (i.e., dry weight and species number). In particular, epiphytic species (i.e., epiphytic rotifers and cladocerans) exhibited a clear relationship with macrophyte characteristics, while large biomass and greater numbers of macrophyte species supported high zooplankton assemblages. Consequently, habitat heterogeneity in the macrophyte bed was recognized as an important factor to determine zooplankton distribution, particularly in epiphytic species. The results indicate that macrophytes are critical for heterogeneity in lentic freshwater ecosystems, and the inclusion of diverse plant species in wetland construction or restoration schemes is expected to generate ecologically healthy food webs.