• 제목/요약/키워드: Classification of patterns

검색결과 1,245건 처리시간 0.036초

설계패턴의 효율적 분류와 관리 (Efficient Classification and Management of Design Patterns)

  • 한정수;김귀정
    • 한국콘텐츠학회:학술대회논문집
    • /
    • 한국콘텐츠학회 2004년도 추계 종합학술대회 논문집
    • /
    • pp.389-394
    • /
    • 2004
  • 본 논문에서는 디자인 패턴을 분류하기 위해 패턴구조의 특성을 가지고 분류하였다. 그리고 클러스터링에 의한 분류는 패싯 분류에 의한 방법보다 높은 정확도를 보여주었다. 따라서 자동화된 분류방법인 클러스터링 알고리즘을 사용하여 디자인 패턴을 분류하는 것이 효과적이라 할 수 있다. 디자인 패턴의 분류는 검색 시 유사한 패턴들이 같은 카테고리에 저장이 되므로 유사패턴을 비교하여 사용할 수 있으며, 패턴 클러스터링에 의해 분류되고, 패턴의 링크정보를 이용하여 저장하므로 저장소를 효율적으로 관리할 수 있다.

  • PDF

한국전통문양의 유형에 따른 분류에 관한 연구 (A Study on Classification of Koran Traditional Patterns Based on Their Types)

  • 장수경
    • 복식문화연구
    • /
    • 제2권2호
    • /
    • pp.283-295
    • /
    • 1994
  • A systematic classification of Korean traditional patterns has been made according to their objects and presenting methods. The classification is represented with 3 levels of categories. First, the superordinate category is composed of 7 groups of patterns, i.e. Naturals, Animals, Plants, Artifacts, Geometric, Composites, and Others. Second, the basic category is composed of motifs in each group. Third, the subordinate category is composed of 3 types, i.e. realistic, stylized, abstracted, according to the degree of simplification. As this classification is a method for organizing informations in Korean traditional patterns in a systematic way, it can offer a useful basis for computerization of the patterns.

  • PDF

TEMPORAL CLASSIFICATION METHOD FOR FORECASTING LOAD PATTERNS FROM AMR DATA

  • Lee, Heon-Gyu;Shin, Jin-Ho;Ryu, Keun-Ho
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
    • /
    • pp.594-597
    • /
    • 2007
  • We present in this paper a novel mid and long term power load prediction method using temporal pattern mining from AMR (Automatic Meter Reading) data. Since the power load patterns have time-varying characteristic and very different patterns according to the hour, time, day and week and so on, it gives rise to the uninformative results if only traditional data mining is used. Also, research on data mining for analyzing electric load patterns focused on cluster analysis and classification methods. However despite the usefulness of rules that include temporal dimension and the fact that the AMR data has temporal attribute, the above methods were limited in static pattern extraction and did not consider temporal attributes. Therefore, we propose a new classification method for predicting power load patterns. The main tasks include clustering method and temporal classification method. Cluster analysis is used to create load pattern classes and the representative load profiles for each class. Next, the classification method uses representative load profiles to build a classifier able to assign different load patterns to the existing classes. The proposed classification method is the Calendar-based temporal mining and it discovers electric load patterns in multiple time granularities. Lastly, we show that the proposed method used AMR data and discovered more interest patterns.

  • PDF

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

  • Kim Gui-Jung;Han Jung-Soo
    • International Journal of Contents
    • /
    • 제2권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

RECURRENT PATTERNS IN DST TIME SERIES

  • Kim, Hee-Jeong;Lee, Dae-Young;Choe, Won-Gyu
    • Journal of Astronomy and Space Sciences
    • /
    • 제20권2호
    • /
    • pp.101-108
    • /
    • 2003
  • This study reports one approach for the classification of magnetic storms into recurrent patterns. A storm event is defined as a local minimum of Dst index. The analysis of Dst index for the period of year 1957 through year 2000 has demonstrated that a large portion of the storm events can be classified into a set of recurrent patterns. In our approach, the classification is performed by seeking a categorization that minimizes thermodynamic free energy which is defined as the sum of classification errors and entropy. The error is calculated as the squared sum of the value differences between events. The classification depends on the noise parameter T that represents the strength of the intrinsic error in the observation and classification process. The classification results would be applicable in space weather forecasting.

다층 셀룰라 비선형 회로망(CNN)을 이용한 고속 패턴 분류 (Fast Pattern Classification with the Multi-layer Cellular Nonlinear Networks (CNN))

  • 오태완;이혜정;손홍락;김형석
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제52권9호
    • /
    • pp.540-546
    • /
    • 2003
  • A fast pattern classification algorithm with Cellular Nonlinear Network-based dynamic programming is proposed. The Cellular Nonlinear Networks is an analog parallel processing architecture and the dynamic programing is an efficient computation algorithm for optimization problem. Combining merits of these two technologies, fast pattern classification with optimization is formed. On such CNN-based dynamic programming, if exemplars and test patterns are presented as the goals and the start positions, respectively, the optimal paths from test patterns to their closest exemplars are found. Such paths are utilized as aggregating keys for the classification. The algorithm is similar to the conventional neural network-based method in the use of the exemplar patterns but quite different in the use of the most likely path finding of the dynamic programming. The pattern classification is performed well regardless of degree of the nonlinearity in class borders.

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

  • 한정수;김귀정
    • 한국콘텐츠학회논문지
    • /
    • 제2권1호
    • /
    • pp.68-76
    • /
    • 2002
  • 클러스터링은 부품 분류의 대표적인 방법인데, 클래스나 모듈의 응집도와 결합도를 이용한 기존의 클러스터링 방법은 클래스간의 관계에 중점을 둔 디자인 패턴을 기존의 클러스터링 방법을 이용하는 것은 효과적일 수 있다. 본 논문에서는 디자인 패턴을 분류하기 위해 패턴 구조의 특성을 가지고 분류하였다. 그리고 클러스터링에 의한 분류는 패싯 분류에 의한 방법보다 높은 정확도를 보여주었다. 따라서 자동화된 분류방법인 클러스터링 알고리즘을 사용하여 디자인 패턴을 분류하는 것이 효과적이라 할 수 있다. 디자인 패턴의 분류는 검색 시 유사한 패턴들이 같은 카테고리에 저장이 되므로 유사 패턴을 비교하여 사용할 수 있으며, 패턴 클러스터링에 의해 분류되고, 패턴의 링크정보를 이용하여 저장하므로 저장소를 효율적으로 관리할 수 있다.

  • PDF

Negative Selection Algorithm for DNA Pattern Classification

  • Lee, Dong-Wook;Sim, Kwee-Bo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.190-195
    • /
    • 2004
  • We propose a pattern classification algorithm using self-nonself discrimination principle of immune cells and apply it to DNA pattern classification problem. Pattern classification problem in bioinformatics is very important and frequent one. In this paper, we propose a classification algorithm based on the negative selection of the immune system to classify DNA patterns. The negative selection is the process to determine an antigenic receptor that recognize antigens, nonself cells. The immune cells use this antigen receptor to judge whether a self or not. If one composes ${\eta}$ groups of antigenic receptor for ${\eta}$ different patterns, these receptor groups can classify into ${\eta}$ patterns. We propose a pattern classification algorithm based on the negative selection in nucleotide base level and amino acid level. Also to show the validity of our algorithm, experimental results of RNA group classification are presented.

  • PDF

Temporal Classification Method for Forecasting Power Load Patterns From AMR Data

  • Lee, Heon-Gyu;Shin, Jin-Ho;Park, Hong-Kyu;Kim, Young-Il;Lee, Bong-Jae;Ryu, Keun-Ho
    • 대한원격탐사학회지
    • /
    • 제23권5호
    • /
    • pp.393-400
    • /
    • 2007
  • We present in this paper a novel power load prediction method using temporal pattern mining from AMR(Automatic Meter Reading) data. Since the power load patterns have time-varying characteristic and very different patterns according to the hour, time, day and week and so on, it gives rise to the uninformative results if only traditional data mining is used. Also, research on data mining for analyzing electric load patterns focused on cluster analysis and classification methods. However despite the usefulness of rules that include temporal dimension and the fact that the AMR data has temporal attribute, the above methods were limited in static pattern extraction and did not consider temporal attributes. Therefore, we propose a new classification method for predicting power load patterns. The main tasks include clustering method and temporal classification method. Cluster analysis is used to create load pattern classes and the representative load profiles for each class. Next, the classification method uses representative load profiles to build a classifier able to assign different load patterns to the existing classes. The proposed classification method is the Calendar-based temporal mining and it discovers electric load patterns in multiple time granularities. Lastly, we show that the proposed method used AMR data and discovered more interest patterns.

BAYESIAN CLASSIFICATION AND FREQUENT PATTERN MINING FOR APPLYING INTRUSION DETECTION

  • Lee, Heon-Gyu;Noh, Ki-Yong;Ryu, Keun-Ho
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
    • /
    • pp.713-716
    • /
    • 2005
  • In this paper, in order to identify and recognize attack patterns, we propose a Bayesian classification using frequent patterns. In theory, Bayesian classifiers guarantee the minimum error rate compared to all other classifiers. However, in practice this is not always the case owing to inaccuracies in the unrealistic assumption{ class conditional independence) made for its use. Our method addresses the problem of attribute dependence by discovering frequent patterns. It generates frequent patterns using an efficient FP-growth approach. Since the volume of patterns produced can be large, we propose a pruning technique for selection only interesting patterns. Also, this method estimates the probability of a new case using different product approximations, where each product approximation assumes different independence of the attributes. Our experiments show that the proposed classifier achieves higher accuracy and is more efficient than other classifiers.

  • PDF