• Title/Summary/Keyword: Clustering Design

Search Result 602, Processing Time 0.033 seconds

A Design of Clustering Classification Systems using Satellite Remote Sensing Images Based on Design Patterns (디자인 패턴을 적용한 위성영상처리를 위한 군집화 분류시스템의 설계)

  • Kim, Dong-Yeon;Kim, Jin-Il
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.319-326
    • /
    • 2002
  • In this paper, we have designed and implemented cluttering classification systems- unsupervised classifiers-for the processing of satellite remote sensing images. Implemented systems adopt various design patterns which include a factory pattern and a strategy pattern to support various satellite images'formats and to design compatible systems. The clustering systems consist of sequential clustering, K-Means clustering, ISODATA clustering and Fuzzy C-Means clustering classifiers. The systems are tested by using a Landsat TM satellite image for the classification input. As results, these clustering systems are well designed to extract sample data for the classification of satellite images of which there is no previous knowledge. The systems can be provided with real-time base clustering tools, compatibilities and components' reusabilities as well.

A Study on Efficient Classification of Pattern Using Object Oriented Relationship between Design Patterns

  • Kim Gui-Jung;Han Jung-Soo
    • International Journal of Contents
    • /
    • v.2 no.3
    • /
    • pp.11-17
    • /
    • 2006
  • The Clustering is representative method of components classification. The previous clustering methods that use cohesion and coupling cannot be effective because design pattern has focused on relation between classes. In this paper, we classified design patterns with features of object-oriented relationship. The result is that classification by clustering showed higher precision than classification by facet. It is effective that design patterns are classified by automatic clustering algorithm. When patterns are retrieved in classification of design patterns, we can use to compare them because similar pattern is saved to same category. Also we can manage repository efficiently because of storing patterns with link information.

  • PDF

A Study on the Development of Web Based Database System with Clustering for Ship Hull Form and Basic Design (클러스터링을 이용한 웹기반 선형/기본설계 지원 데이터베이스 시스템 구축에 관한 연구)

  • 권영중;이정준
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2001.05a
    • /
    • pp.38-42
    • /
    • 2001
  • An engineering database system is presented for ship hull form and hasic design. Web i, nd clustering systems are adopted to develope the system. It is appeared that the system is efficient and useful for integrated ship design.

  • PDF

A Study on Clustering Algorithm Using Design Pattern Structure (디자인 패턴 구조를 이용한 클러스터링에 관한 연구)

  • 한정수;김귀정
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.1
    • /
    • pp.68-76
    • /
    • 2002
  • Clustering is representative method of components classification. But, previous clustering method that use cohesion and coupling can not be effective, because design pattern has consisted by relation between classes. In this paper, we classified design patterns with special quality of pattern structure. Classification by clustering had expressed higher correctness degree than classification by facet. Therefore, can do that it is effective that classify design patterns using clustering algorithms that is automatic classification method. When we are searching design patterns, classification of design patterns can compare and analyze similar patterns because similar patterns is saved to same category. Also we can manage repository efficiently because of using and storing link information of patterns.

  • PDF

Comparing Classification Accuracy of Ensemble and Clustering Algorithms Based on Taguchi Design (다구찌 디자인을 이용한 앙상블 및 군집분석 분류 성능 비교)

  • Shin, Hyung-Won;Sohn, So-Young
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.1
    • /
    • pp.47-53
    • /
    • 2001
  • In this paper, we compare the classification performances of both ensemble and clustering algorithms (Data Bagging, Variable Selection Bagging, Parameter Combining, Clustering) to logistic regression in consideration of various characteristics of input data. Four factors used to simulate the logistic model are (1) correlation among input variables (2) variance of observation (3) training data size and (4) input-output function. In view of the unknown relationship between input and output function, we use a Taguchi design to improve the practicality of our study results by letting it as a noise factor. Experimental study results indicate the following: When the level of the variance is medium, Bagging & Parameter Combining performs worse than Logistic Regression, Variable Selection Bagging and Clustering. However, classification performances of Logistic Regression, Variable Selection Bagging, Bagging and Clustering are not significantly different when the variance of input data is either small or large. When there is strong correlation in input variables, Variable Selection Bagging outperforms both Logistic Regression and Parameter combining. In general, Parameter Combining algorithm appears to be the worst at our disappointment.

  • PDF

Fish Injured Rate Measurement Using Color Image Segmentation Method Based on K-Means Clustering Algorithm and Otsu's Threshold Algorithm

  • Sheng, Dong-Bo;Kim, Sang-Bong;Nguyen, Trong-Hai;Kim, Dae-Hwan;Gao, Tian-Shui;Kim, Hak-Kyeong
    • Journal of Power System Engineering
    • /
    • v.20 no.4
    • /
    • pp.32-37
    • /
    • 2016
  • This paper proposes two measurement methods for injured rate of fish surface using color image segmentation method based on K-means clustering algorithm and Otsu's threshold algorithm. To do this task, the following steps are done. Firstly, an RGB color image of the fish is obtained by the CCD color camera and then converted from RGB to HSI. Secondly, the S channel is extracted from HSI color space. Thirdly, by applying the K-means clustering algorithm to the HSI color space and applying the Otsu's threshold algorithm to the S channel of HSI color space, the binary images are obtained. Fourthly, morphological processes such as dilation and erosion, etc. are applied to the binary image. Fifthly, to count the number of pixels, the connected-component labeling is adopted and the defined injured rate is gotten by calculating the pixels on the labeled images. Finally, to compare the performances of the proposed two measurement methods based on the K-means clustering algorithm and the Otsu's threshold algorithm, the edge detection of the final binary image after morphological processing is done and matched with the gray image of the original RGB image obtained by CCD camera. The results show that the detected edge of injured part by the K-means clustering algorithm is more close to real injured edge than that by the Otsu' threshold algorithm.

Clustering Algorithms for Reducing Energy Consumption - A Review

  • Kinza Mubasher;Rahat Mansha
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.109-118
    • /
    • 2023
  • Energy awareness is an essential design flaw in wireless sensor network. Clustering is the most highly regarded energy-efficient technique that offers various benefits such as energy efficiency and network lifetime. Clusters create hierarchical WSNs that introduce the efficient use of limited sensor node resources and thus enhance the life of the network. The goal of this paper is to provide an analysis of the various energy efficient clustering algorithms. Analysis is based on the energy efficiency and network lifetime. This review paper provides an analysis of different energy-efficient clustering algorithms for WSNs.

Module Communization for Product Platform Design Using Clustering Analysis (군집 분석을 활용한 제품 플랫폼 설계를 위한 모듈 공용화)

  • Yoo, Jaewook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.3
    • /
    • pp.89-98
    • /
    • 2014
  • Platform-based product family design is recognized as an effective method to satisfy the mass customization which is a current market trend. In order to design platform-based product family successfully, it is the key work to define a good product platform, which is to identify the common modules that will be shared among the product family. In this paper the clustering analysis using dendrogram is proposed to capture the common modules of the platform. The clustering variables regarding both marketing and engineering sides are derived from the view point of top-down product development. A case study of a cordless drill/drive product family is presented to illustrate the feasibility and validity of the overall procedure developed in this research.

Codebook design for subspace distribution clustering hidden Markov model (Subspace distribution clustering hidden Markov model을 위한 codebook design)

  • Cho, Young-Kyu;Yook, Dong-Suk
    • Proceedings of the KSPS conference
    • /
    • 2005.04a
    • /
    • pp.87-90
    • /
    • 2005
  • Today's state-of the-art speech recognition systems typically use continuous distribution hidden Markov models with the mixtures of Gaussian distributions. To obtain higher recognition accuracy, the hidden Markov models typically require huge number of Gaussian distributions. Such speech recognition systems have problems that they require too much memory to run, and are too slow for large applications. Many approaches are proposed for the design of compact acoustic models. One of those models is subspace distribution clustering hidden Markov model. Subspace distribution clustering hidden Markov model can represent original full-space distributions as some combinations of a small number of subspace distribution codebooks. Therefore, how to make the codebook is an important issue in this approach. In this paper, we report some experimental results on various quantization methods to make more accurate models.

  • PDF

Mobile User Interface Pattern Clustering Using Improved Semi-Supervised Kernel Fuzzy Clustering Method

  • Jia, Wei;Hua, Qingyi;Zhang, Minjun;Chen, Rui;Ji, Xiang;Wang, Bo
    • Journal of Information Processing Systems
    • /
    • v.15 no.4
    • /
    • pp.986-1016
    • /
    • 2019
  • Mobile user interface pattern (MUIP) is a kind of structured representation of interaction design knowledge. Several studies have suggested that MUIPs are a proven solution for recurring mobile interface design problems. To facilitate MUIP selection, an effective clustering method is required to discover hidden knowledge of pattern data set. In this paper, we employ the semi-supervised kernel fuzzy c-means clustering (SSKFCM) method to cluster MUIP data. In order to improve the performance of clustering, clustering parameters are optimized by utilizing the global optimization capability of particle swarm optimization (PSO) algorithm. Since the PSO algorithm is easily trapped in local optima, a novel PSO algorithm is presented in this paper. It combines an improved intuitionistic fuzzy entropy measure and a new population search strategy to enhance the population search capability and accelerate the convergence speed. Experimental results show the effectiveness and superiority of the proposed clustering method.