• Title/Summary/Keyword: sequential pattern

Search Result 362, Processing Time 0.028 seconds

Study on the Development of Diagnosis Algorithm of Soeumin Symptomology (소음인(少陰人) 병증(病證) 진단 알고리즘 개발 연구)

  • Shin, Seung-Won;Lee, Eui-Ju;Koh, Byung-Hee;Lee, Jun-Hee
    • Journal of Sasang Constitutional Medicine
    • /
    • v.23 no.1
    • /
    • pp.33-43
    • /
    • 2011
  • 1. Objectives: This study is aimed to develop the algorithm, which can help clinicians diagnose Soeumin's symptomology, based on the indexes such as dry mouth, water drinking, sweat, urine, appetite, digestion, and stool, etc. 2. Methods: This research analyzes the items of "Donguisusebowon(東醫壽世保元)" to reveal the inevitable and sequential indexes of Soeumin's symptomology diagnosis, in order of exterior-interior pattern differentiation, favorable-unfavorable pattern differentiation, and mild-severe-dangerous-urgent pattern differentiation. 3. Results and Conclusions: 1) 1st step: Soeumin's exterior pattern and interior pattern are differentiated in terms of heat and cold, respectively. Stool and digestion are used to confirm the difference. 2) 2nd step: The existence of sweat is used to find out that an exterior pattern is with or without favor, while the indexes of stool, dry mouth, and generalized pain are used to identify an interior pattern with or without favor. 3) 3rd step: The favorably exterior-heat pattern can be either mild or severe by the indexes of cold-heat, stool, tidal fever, and manic raving, panting and straight looking, while the unfavorably exterior-heat pattern can be either dangerous or urgent by the ones of cold-heat, stool, and urine. And, the favorably interior-cold pattern can be either mild or severe by the indexes of stuffiness and fullness, jaundice, and edema, while the unfavorably interior-cold pattern can be either mild or severe by the ones of vexation level.

Mining Maximal Frequent Contiguous Sequences in Biological Data Sequences (생물학적 데이터 서열들에서 빈번한 최대길이 연속 서열 마이닝)

  • Kang, Tae-Ho;Yoo, Jae-Soo
    • The KIPS Transactions:PartD
    • /
    • v.15D no.2
    • /
    • pp.155-162
    • /
    • 2008
  • Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

A Dynamic Recommendation System Using User Log Analysis and Document Similarity in Clusters (사용자 로그 분석과 클러스터 내의 문서 유사도를 이용한 동적 추천 시스템)

  • 김진수;김태용;최준혁;임기욱;이정현
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.5
    • /
    • pp.586-594
    • /
    • 2004
  • Because web documents become creation and disappearance rapidly, users require the recommend system that offers users to browse the web document conveniently and correctly. One largely untapped source of knowledge about large data collections is contained in the cumulative experiences of individuals finding useful information in the collection. Recommendation systems attempt to extract such useful information by capturing and mining one or more measures of the usefulness of the data. The existing Information Filtering system has the shortcoming that it must have user's profile. And Collaborative Filtering system has the shortcoming that users have to rate each web document first and in high-quantity, low-quality environments, users may cover only a tiny percentage of documents available. And dynamic recommendation system using the user browsing pattern also provides users with unrelated web documents. This paper classifies these web documents using the similarity between the web documents under the web document type and extracts the user browsing sequential pattern DB using the users' session information based on the web server log file. When user approaches the web document, the proposed Dynamic recommendation system recommends Top N-associated web documents set that has high similarity between current web document and other web documents and recommends set that has sequential specificity using the extracted informations and users' session information.

Biped robot gait pattern generation using frequency feature of human's gait torque analysis (인간의 보행 회전력의 주파수 특징 분석을 이용한 이족로봇의 적응적 보행 패턴 생성)

  • Ha, Seung-Suk;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.1
    • /
    • pp.100-108
    • /
    • 2008
  • This paper proposes a method of adaptively generating a gait pattern of biped robot. The gait synthesis is based on human's gait pattern analysis. The proposed method can easily be applied to generate the natural and stable gait pattern of any biped robot. To analyze the human's gait pattern, sequential images of the human's gait on the sagittal plane are acquired from which the gait control values are extracted. The gait pattern of biped robot on the sagittal plane is adaptively generated by a genetic algorithm using the human's gait control values. However, galt trajectories of the biped robot on the sagittal Plane are not enough to construct the complete gait pattern because the bided robot moves on 3-dimension space. Therefore, the gait pattern on the frontal plane, generated from Zero Moment Point (ZMP), is added to the gait one acquired on the sagittal plane. Consequently, the natural and stable walking pattern for the biped robot is obtained.

Prediction of rock fragmentation and design of blasting pattern based on 3-D spatial distribution of rock factor

  • Sim, Hyeon-Jin;Han, Chang-Yeon;Nam, Hyeon-U
    • 지반과기술
    • /
    • v.3 no.3
    • /
    • pp.15-22
    • /
    • 2006
  • The optimum blasting pattern to excavate a quarry efficiently and economically can be determined based on the minimum production cost, which is generally estimated according to rock fragmentation. Therefore, it is a critical problem to predict fragment size distribution of blasted rocks over an entire quarry. By comparing various prediction models, it can be ascertained that the result obtained from Kuz-Ram model relatively coincides with that of field measurements. Kuz-Ram model uses the concept of rock factor to signify conditions of rock mass such as block size, rock jointing, strength and others. For the evaluation of total production cost, it is imperative to estimate 3-D spatial distribution of rock factor for the entire quarry. In this study, a sequential indicator simulation technique is adopted for estimation of spatial distribution of rock factor due to its higher reproducibility of spatial variability and distribution models than Kriging methods. Further, this can reduce the uncertainty of predictor using distribution information of sample data. The entire quarry is classified into three types of rock mass and optimum blasting pattern is proposed for each type based on 3-D spatial distribution of rock factor. In addition, plane maps of rock factor distribution for each ground level are provided to estimate production costs for each process and to make a plan for an optimum blasting pattern.

  • PDF

Efficient Update Algorithm of Sequential Pattern (효율적인 순차 패턴 갱신 알고리즘)

  • 김학자;김형근;황환규
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.178-180
    • /
    • 2003
  • 본 논문은 순차 패턴을 갱신하는 알고리즘을 제안한다. 갱신된 데이터베이스에서 새로운 순차 패턴을 찾는 비용을 줄이기 위해 갱신 전 데이터베이스에서 발견한 순차 패턴에 대한 정보와 추가되는 데이터베이스의 정보만으로 새로운 순차 패턴의 후보를 줄이는 방법으로, 갱신된 전체 데이터베이스를 대상으로 순차 패턴 마이닝 알고리즘을 재실행하는 방법에 비해 후보 셋이 줄어들고 이로 인해 연산 비용을 줄일 수 있는 장점이 있다.

  • PDF

Context Prediction Using Right and Wrong Patterns to Improve Sequential Matching Performance for More Accurate Dynamic Context-Aware Recommendation (보다 정확한 동적 상황인식 추천을 위해 정확 및 오류 패턴을 활용하여 순차적 매칭 성능이 개선된 상황 예측 방법)

  • Kwon, Oh-Byung
    • Asia pacific journal of information systems
    • /
    • v.19 no.3
    • /
    • pp.51-67
    • /
    • 2009
  • Developing an agile recommender system for nomadic users has been regarded as a promising application in mobile and ubiquitous settings. To increase the quality of personalized recommendation in terms of accuracy and elapsed time, estimating future context of the user in a correct way is highly crucial. Traditionally, time series analysis and Makovian process have been adopted for such forecasting. However, these methods are not adequate in predicting context data, only because most of context data are represented as nominal scale. To resolve these limitations, the alignment-prediction algorithm has been suggested for context prediction, especially for future context from the low-level context. Recently, an ontological approach has been proposed for guided context prediction without context history. However, due to variety of context information, acquiring sufficient context prediction knowledge a priori is not easy in most of service domains. Hence, the purpose of this paper is to propose a novel context prediction methodology, which does not require a priori knowledge, and to increase accuracy and decrease elapsed time for service response. To do so, we have newly developed pattern-based context prediction approach. First of ail, a set of individual rules is derived from each context attribute using context history. Then a pattern consisted of results from reasoning individual rules, is developed for pattern learning. If at least one context property matches, say R, then regard the pattern as right. If the pattern is new, add right pattern, set the value of mismatched properties = 0, freq = 1 and w(R, 1). Otherwise, increase the frequency of the matched right pattern by 1 and then set w(R,freq). After finishing training, if the frequency is greater than a threshold value, then save the right pattern in knowledge base. On the other hand, if at least one context property matches, say W, then regard the pattern as wrong. If the pattern is new, modify the result into wrong answer, add right pattern, and set frequency to 1 and w(W, 1). Or, increase the matched wrong pattern's frequency by 1 and then set w(W, freq). After finishing training, if the frequency value is greater than a threshold level, then save the wrong pattern on the knowledge basis. Then, context prediction is performed with combinatorial rules as follows: first, identify current context. Second, find matched patterns from right patterns. If there is no pattern matched, then find a matching pattern from wrong patterns. If a matching pattern is not found, then choose one context property whose predictability is higher than that of any other properties. To show the feasibility of the methodology proposed in this paper, we collected actual context history from the travelers who had visited the largest amusement park in Korea. As a result, 400 context records were collected in 2009. Then we randomly selected 70% of the records as training data. The rest were selected as testing data. To examine the performance of the methodology, prediction accuracy and elapsed time were chosen as measures. We compared the performance with case-based reasoning and voting methods. Through a simulation test, we conclude that our methodology is clearly better than CBR and voting methods in terms of accuracy and elapsed time. This shows that the methodology is relatively valid and scalable. As a second round of the experiment, we compared a full model to a partial model. A full model indicates that right and wrong patterns are used for reasoning the future context. On the other hand, a partial model means that the reasoning is performed only with right patterns, which is generally adopted in the legacy alignment-prediction method. It turned out that a full model is better than a partial model in terms of the accuracy while partial model is better when considering elapsed time. As a last experiment, we took into our consideration potential privacy problems that might arise among the users. To mediate such concern, we excluded such context properties as date of tour and user profiles such as gender and age. The outcome shows that preserving privacy is endurable. Contributions of this paper are as follows: First, academically, we have improved sequential matching methods to predict accuracy and service time by considering individual rules of each context property and learning from wrong patterns. Second, the proposed method is found to be quite effective for privacy preserving applications, which are frequently required by B2C context-aware services; the privacy preserving system applying the proposed method successfully can also decrease elapsed time. Hence, the method is very practical in establishing privacy preserving context-aware services. Our future research issues taking into account some limitations in this paper can be summarized as follows. First, user acceptance or usability will be tested with actual users in order to prove the value of the prototype system. Second, we will apply the proposed method to more general application domains as this paper focused on tourism in amusement park.

A Study on the Interrelationship between Geometry and Nonlinear Figure of Space (기하학과 비선형 공간 형태의 상관성에 관한 기초 연구)

  • Lee Chul-Jae
    • Korean Institute of Interior Design Journal
    • /
    • v.14 no.1
    • /
    • pp.160-167
    • /
    • 2005
  • The paper raises a question in argument about the method of creating space depending on accidental creation by computer as the method of describing movement pattern, and emphasizes the role of the mathematics which may change the shape into the image or reflection, that is, data which human may understand and expect. If the mathematics could be the method of describing movement pattern, it may play a important role on the analysis of architectural space based on the idea of post-constructionism, which is likely to consider the modern architectural space recognized as the sequential frames containing movement, as the suspended state of the moving object. And then, this infinite series, 'the sum' of the suspended state, is not studied mathematically and scientifically, but is able to be shaped by reviewing the validity in mathematics about the nonlinear space. This is, therefore, the fundamental research in order to define the role of the mathematics in formation of space of contemporary architecture.

위성탑재장비 장착패턴을 고려한 제작 오차 분석

  • Kim, Kyung-Won;Kim, Jin-Hee;Kim, Sung-Hoon;Lee, Ju-Hun;Hwang, Do-Soon
    • Aerospace Engineering and Technology
    • /
    • v.3 no.2
    • /
    • pp.20-24
    • /
    • 2004
  • In this paper, a pattern/position tolerance analysis is visited on the insert to mount spacecraft electronic equipment. SQP(Sequential Quadratic Programming) is used to obtain the position tolerance. For examples, the cases of RDU(Remote Drive Unit) and OBC(On Board Computer) in the KOMPSAT-2 STM(Structure and Thermal Model) are analyzed.

  • PDF

SPATIOTEMPORAL MARKER SEARCHING METHOD IN VIDEO STREAM

  • Shimizu, Noriyuki;Miyao, Jun'ichi
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.812-815
    • /
    • 2009
  • This paper discusses a searching method for special markers attached with persons in a surveillance video stream. The marker is a small plate with infrared LEDs, which is called a spatiotemporal marker because it shows a 2-D sequential pattern synchronized with video frames. The search is based on the motion vectors which is the same as one in video compression. The experiments using prototype markers show that the proposed method is practical. Though the method is applicable to a video stream independently, it can decrease total computation cost if motion vector analyses of a video compression and the proposed method is unified.

  • PDF