• Title/Summary/Keyword: 패턴 발견

Search Result 590, Processing Time 0.02 seconds

Web Service Discovery based on Process Information and QoS (프로세스 정보와 QoS를 고려한 웹 서비스 발견)

  • You So-Yeon;Yu Jeong-Youn;Lee Kyu-Chul
    • The Journal of Society for e-Business Studies
    • /
    • v.10 no.3
    • /
    • pp.85-110
    • /
    • 2005
  • OWL-S has a major leadership in the field of Web Service discovery and is being actively studied in LARKS and METEOR-S projects. These researches do not consider all components of OWL-S standards, and it is needed to enhance their discovery algorithms. In this paper, we propose matching algorithms based on process information such as process structure matching, service classification matching and business pattern matching algorithms. We also improve the QoS matching algorithm of METEOR-S project. Finally, we integrate these two kinds of matching algorithms as accommodate users preferences.

  • PDF

Analysis and Prediction of Power Consumption Pattern Using Spatiotemporal Data Mining Techniques in GIS-AMR System (GIS-AMR 시스템에서 시공간 데이터마이닝 기법을 이용한 전력 소비 패턴의 분석 및 예측)

  • Park, Jin-Hyoung;Lee, Heon-Gyu;Shin, Jin-Ho;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.307-316
    • /
    • 2009
  • In this paper, the spatiotemporal data mining methodology for detecting a cycle of power consumption pattern with the change of time and spatial was proposed, and applied to the power consumption data collected by GIS-AMR system with an aim to use its resulting knowledge in real world applications. First, partial clustering method was applied for cluster analysis concerned with the aim of customer's power consumption. Second, the patterns of customer's power consumption data which contain time and spatial attribute were detected by 3D cube mining method. Third, using the calendar pattern mining method for detection of cyclic patterns in the various time domains, the meanings and relationships of time attribute which is previously detected patterns were analyzed and predicted. For the evaluation of the proposed spatiotemporal data mining, we analyzed and predicted the power consumption patterns included the cycle of time and spatial feature from total 266,426 data of 3,256 customers with high power consumption from Jan. 2007 to Apr. 2007 supported by the GIS-AMR system in KEPRI. As a result of applying the proposed analysis methodology, cyclic patterns of each representative profiles of a group is identified on time and location.

The Optimal Operation Pattern and Heat Pricing Scheme for District Heating CHP System (지역난방용 열병합발전시스템의 최적운전패턴과 적정 열요금구조)

  • 권영한;김창수;진병문;김진오
    • Journal of Energy Engineering
    • /
    • v.5 no.2
    • /
    • pp.183-192
    • /
    • 1996
  • This paper presents a numerical model of the optimal operation pattern of the CHP system built for duel-purpose of power generation and district heat production. The model can be differently formulated in accordance with the view of planner: society, electric utility or district-heating company. Here, the operation pattern of the system components and the effect of heat price are of major interest in the study. From the case study, it was found that the optimal use of auxiliary heating equipment is very important to achieve the minimum societal cost. And, the multi-step heat pricing scheme is desirable to induce the voluntary behavior of both companies towards the societal optimal pattern.

  • PDF

Hybrid ASR Error Correction Using Word Sequence Pattern and Recurrent Neural Network (단어열 패턴 매칭과 Recurrent Neural Network를 이용한 하이브리드 음성 인식 오류 수정 방법)

  • Choi, Junhwi;Ryu, Seonghan;Lee, Kyusong;Park, Seonyeong;Yu, Hwanjo;Lee, Gary Geunbae
    • Annual Conference on Human and Language Technology
    • /
    • 2015.10a
    • /
    • pp.129-132
    • /
    • 2015
  • 본 논문에서는 단어열 패턴과 리커런트 신경망을 이용한 하이브리드 음성 인식 오류 수정 방법을 제안한다. 음성 인식 결과 문장에서 음성 인식 오류 단어가 발견되었을 경우에 첫째로 단어열 패턴과 그 패턴의 발음열 점수를 통해 1차적 수정을 하고 적절한 패턴을 찾지 못하였을 경우 음절단위로 구성된 Recurrent Neural Network를 통해 단어를 음절단위로 생성하여 2차적으로 오류를 수정한다. 해당 방법론을 한국어로 된 음성 인식 오류와 그 정답 문장으로 구성된 TV 가이드 영역 말뭉치를 바탕으로 성능을 평가하였고, 기존의 단순 단어열 패턴 기반의 음성 인식 오류 수정보다 성능이 향상되었음을 볼 수 있었다. 이 방법론은 음성 인식 오류와 정답의 말뭉치가 필요 없이 옳은 문장으로만 구성된 일반 말뭉치만으로 훈련이 가능하여, 음성 인식 엔진에 의존적이지 않는 강점이 있다.

  • PDF

Extracting Maximal Similar Paths between Two XML Documents using Sequential Pattern Mining (순차 패턴 마이닝을 사용한 두 XML 문서간 최대 유사 경로 추출)

  • 이정원;박승수
    • Journal of KIISE:Databases
    • /
    • v.31 no.5
    • /
    • pp.553-566
    • /
    • 2004
  • Some of the current main research areas involving techniques related to XML consist of storing XML documents, optimizing the query, and indexing. As such we may focus on the set of documents that are composed of various structures, but that are not shared with common structure such as the same DTD or XML Schema. In the case, it is essential to analyze structural similarities and differences among many documents. For example, when the documents from the Web or EDMS (Electronic Document Management System) are required to be merged or classified, it is very important to find the common structure for the process of handling documents. In this paper, we transformed sequential pattern mining algorithms(1) to extract maximal similar paths between two XML documents. Experiments with XML documents show that our transformed sequential pattern mining algorithms can exactly find common structures and maximal similar paths between them. For analyzing experimental results, similarity metrics based on maximal similar paths can exactly classify the types of XML documents.

A Pattern Comparison Algorithm for Pruning Fault Candidates (고장 대상 후보를 줄이기 위한 패턴 비교 알고리즘)

  • Cho, Hyung-Jun;Kang, Sung-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.11
    • /
    • pp.82-88
    • /
    • 2007
  • In this paper, we present a pattern comparison algorithm for reducing fault candidate lists. The number of fault candidates determines the total fault simulation time. To decrease the total fault diagnosis time, the reduction of the number of fault candidates is essential. Critical path tracing determines fault candidate lists detected by a set of tests using a backtracing algorithm starting at the primary outputs of a circuit. The proposed algorithm reduces fault candidates comparing failing patterns with good patterns during critical path tracing process. As we reduce all fault candidates of the circuit to more accurately suspected fault candidates, we can greatly reduce fault simulation time. The proposed algorithm greatly increases simulation speed than that of a conventional backtracing method. The proposed algorithm is applicable to both combinational and sequential circuits. Experimental results on ISCAS#85 and ISCAS#89 benchmark circuits showed fault candidates are pruned and fault diagnosis time is also decreased in proportion to fault candidate decrease.

A Study on the CBR Pattern using Similarity and the Euclidean Calculation Pattern (유사도와 유클리디안 계산패턴을 이용한 CBR 패턴연구)

  • Yun, Jong-Chan;Kim, Hak-Chul;Kim, Jong-Jin;Youn, Sung-Dae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.4
    • /
    • pp.875-885
    • /
    • 2010
  • CBR (Case-Based Reasoning) is a technique to infer the relationships between existing data and case data, and the method to calculate similarity and Euclidean distance is mostly frequently being used. However, since those methods compare all the existing and case data, it also has a demerit that it takes much time for data search and filtering. Therefore, to solve this problem, various researches have been conducted. This paper suggests the method of SE(Speed Euclidean-distance) calculation that utilizes the patterns discovered in the existing process of computing similarity and Euclidean distance. Because SE calculation applies the patterns and weight found during inputting new cases and enables fast data extraction and short operation time, it can enhance computing speed for temporal or spatial restrictions and eliminate unnecessary computing operation. Through this experiment, it has been found that the proposed method improves performance in various computer environments or processing rate more efficiently than the existing method that extracts data using similarity or Euclidean method does.

Identifying Variable-Length Palindromic Pairs in DNA Sequences (DNA사슬 내에서 다양한 길이의 팰린드롬쌍 검색 연구)

  • Kim, Hyoung-Rae;Jeong, Kyoung-Hee;Jeon, Do-Hong
    • The KIPS Transactions:PartB
    • /
    • v.14B no.6
    • /
    • pp.461-472
    • /
    • 2007
  • The emphasis in genome projects has Been moving towards the sequence analysis in order to extract biological "meaning"(e.g., evolutionary history of particular molecules or their functions) from the sequence. Especially. palindromic or direct repeats that appear in a sequence have a biophysical meaning and the problem is to recognize interesting patterns and configurations of words(strings of characters) over complementary alphabets. In this paper, we propose an algorithm to identify variable length palindromic pairs(longer than a threshold), where we can allow gaps(distance between words). The algorithm is called palindrome algorithm(PA) and has O(N) time complexity. A palindromic pair consists of a hairpin structure. By composing collected palindromic pairs we build n-pair palindromic patterns. In addition, we dot some of the longest pairs in a circle to represent the structure of a DNA sequence. We run the algorithm over several selected genomes and the results of E.coli K12 are presented. There existed very long palindromic pair patterns in the genomes, which hardly occur in a random sequence.

Seabird Distribution Patterns by Sighting Survey in the East Sea in Spring (목시조사(Sighting survey)에 의한 동해 봄철 해양성 조류의 분포 양상)

  • Kim, Hyun-Woo;Kim, Zang-Geun;Choi, Seok-Gwan
    • Korean Journal of Environment and Ecology
    • /
    • v.25 no.2
    • /
    • pp.123-131
    • /
    • 2011
  • Seabird distribution in the East Sea was studied from April to May 2007 using line transect counts. We observed a total of 1,379 individuals of 23 species including 14 species of seabird. The overall seabird sighting rate was 2.5 birds $km^{-2}$. The Streaked shearwater(Calonectris leucomelas)(74.5%) was the numerically dominant species. Ancient murrelets(Synthliboramphus antiquus)(8.3%), red-throated divers(Gavia stellata)(5.0%), common terns(Sterna hirundo)(2.1%), Pacific divers(Gavia pacifica)(2.0%), and black-tailed gulls (Larus crassirostris)(1.1%) were also frequently observed. The sightings of seabirds was highest between $36^{\circ}N$ and $37^{\circ}N$ of the coastal area of the Korean peninsular. However, the index of species diversity(H') was higher between $35^{\circ}N$ and $36^{\circ}N$. The sighting rates of most observed species decreased with distance from the coastline. The distribution patterns of Streaked shearwater were linked to the variation in the distribution pattern of minke whales(Balaenoptera acutorostrata). Also, spatial segregation was found in the distributions of the two species of divers(Gavia spp.).

RSP-DS: Real Time Sequential Patterns Analysis in Data Streams (RSP-DS: 데이터 스트림에서의 실시간 순차 패턴 분석)

  • Shin Jae-Jyn;Kim Ho-Seok;Kim Kyoung-Bae;Bae Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.9
    • /
    • pp.1118-1130
    • /
    • 2006
  • Existed pattern analysis algorithms in data streams environment have researched performance improvement and effective memory usage. But when new data streams come, existed pattern analysis algorithms have to analyze patterns again and have to generate pattern tree again. This approach needs many calculations in real situation that needs real time pattern analysis. This paper proposes a method that continuously analyzes patterns of incoming data streams in real time. This method analyzes patterns fast, and thereafter obtains real time patterns by updating previously analyzed patterns. The incoming data streams are divided into several sequences based on time based window. Informations of the sequences are inputted into a hash table. When the number of the sequences are over predefined bound, patterns are analyzed from the hash table. The patterns form a pattern tree, and later created new patterns update the pattern tree. In this way, real time patterns are always maintained in the pattern tree. During pattern analysis, suffixes of both new pattern and existed pattern in the tree can be same. Then a pointer is created from the new pattern to the existed pattern. This method reduce calculation time during duplicated pattern analysis. And old patterns in the tree are deleted easily by FIFO method. The advantage of our algorithm is proved by performance comparison with existed method, MILE, in a condition that pattern is changed continuously. And we look around performance variation by changing several variable in the algorithm.

  • PDF