• Title/Summary/Keyword: Context Matching

Search Result 108, Processing Time 0.029 seconds

Context Prediction based on Sequence Matching for Contexts with Discrete Attribute (이산 속성 컨텍스트를 위한 시퀀스 매칭 기반 컨텍스트 예측)

  • Choi, Young-Hwan;Lee, Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.4
    • /
    • pp.463-468
    • /
    • 2011
  • Context prediction methods have been developed in two ways - one is a prediction for discrete context and the other is for continuous context. As most of the prediction methods have been used with prediction algorithms in specific domains suitable to the environment and characteristics of contexts, it is difficult to conduct a prediction for a user's context which is based on various environments and characteristics. This study suggests a context prediction method available for both discrete and continuous contexts without being limited to the characteristics of a specific domain or context. For this, we conducted a context prediction based on sequence matching by generating sequences from contexts in consideration of association rules between context attributes and by applying variable weights according to each context attribute. Simulations for discrete and continuous contexts were conducted to evaluate proposed methods and the results showed that the methods produced a similar performance to existing prediction methods with a prediction accuracy of 80.12% in discrete context and 81.43% in continuous context.

Context-Weighted Metrics for Example Matching (문맥가중치가 반영된 문장 유사 척도)

  • Kim, Dong-Joo;Kim, Han-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.6 s.312
    • /
    • pp.43-51
    • /
    • 2006
  • This paper proposes a metrics for example matching under the example-based machine translation for English-Korean machine translation. Our metrics served as similarity measure is based on edit-distance algorithm, and it is employed to retrieve the most similar example sentences to a given query. Basically it makes use of simple information such as lemma and part-of-speech information of typographically mismatched words. Edit-distance algorithm cannot fully reflect the context of matched word units. In other words, only if matched word units are ordered, it is considered that the contribution of full matching context to similarity is identical to that of partial matching context for the sequence of words in which mismatching word units are intervened. To overcome this drawback, we propose the context-weighting scheme that uses the contiguity information of matched word units to catch the full context. To change the edit-distance metrics representing dissimilarity to similarity metrics, to apply this context-weighted metrics to the example matching problem and also to rank by similarity, we normalize it. In addition, we generalize previous methods using some linguistic information to one representative system. In order to verify the correctness of the proposed context-weighted metrics, we carry out the experiment to compare it with generalized previous methods.

S2-Net: Machine reading comprehension with SRU-based self-matching networks

  • Park, Cheoneum;Lee, Changki;Hong, Lynn;Hwang, Yigyu;Yoo, Taejoon;Jang, Jaeyong;Hong, Yunki;Bae, Kyung-Hoon;Kim, Hyun-Ki
    • ETRI Journal
    • /
    • v.41 no.3
    • /
    • pp.371-382
    • /
    • 2019
  • Machine reading comprehension is the task of understanding a given context and finding the correct response in that context. A simple recurrent unit (SRU) is a model that solves the vanishing gradient problem in a recurrent neural network (RNN) using a neural gate, such as a gated recurrent unit (GRU) and long short-term memory (LSTM); moreover, it removes the previous hidden state from the input gate to improve the speed compared to GRU and LSTM. A self-matching network, used in R-Net, can have a similar effect to coreference resolution because the self-matching network can obtain context information of a similar meaning by calculating the attention weight for its own RNN sequence. In this paper, we construct a dataset for Korean machine reading comprehension and propose an $S^2-Net$ model that adds a self-matching layer to an encoder RNN using multilayer SRU. The experimental results show that the proposed $S^2-Net$ model has performance of single 68.82% EM and 81.25% F1, and ensemble 70.81% EM, 82.48% F1 in the Korean machine reading comprehension test dataset, and has single 71.30% EM and 80.37% F1 and ensemble 73.29% EM and 81.54% F1 performance in the SQuAD dev dataset.

Bayesian Inferrence and Context-Tree Matching Method for Intelligent Services in a Mobile Environment (모바일 환경에서의 지능형 서비스를 위한 베이지안 추론과 컨텍스트 트리 매칭방법)

  • Kim, Hee-Taek;Min, Jun-Ki;Cho, Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.2
    • /
    • pp.144-152
    • /
    • 2009
  • To provide intelligent service in mobile environment, it needs to estimate user's intention or requirement, through analyzing context information of end-users such as preference or behavior patterns. In this paper, we infer context information from uncertain log stored in mobile device. And we propose the inference method of end-user's behavior to match context information with service, and the proposed method is based on context-tree. We adopt bayesian probabilistic method to infer uncertain context information effectively, and the context-tree is constructed to utilize non-numerical context which is hard to handled with mathematical method. And we verify utility of proposed method by appling the method to intelligent phone book service.

Conceptual Pattern Matching of Time Series Data using Hidden Markov Model (은닉 마코프 모델을 이용한 시계열 데이터의 의미기반 패턴 매칭)

  • Cho, Young-Hee;Jeon, Jin-Ho;Lee, Gye-Sung
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.5
    • /
    • pp.44-51
    • /
    • 2008
  • Pattern matching and pattern searching in time series data have been active issues in a number of disciplines. This paper suggests a novel pattern matching technology which can be used in the field of stock market analysis as well as in forecasting stock market trend. First, we define conceptual patterns, and extract data forming each pattern from given time series, and then generate learning model using Hidden Markov Model. The results show that the context-based pattern matching makes the matching more accountable and the method would be effectively used in real world applications. This is because the pattern for new data sequence carries not only the matching itself but also a given context in which the data implies.

Personalized Service Based on Context Awareness through User Emotional Perception in Mobile Environment (모바일 환경에서의 상황인식 기반 사용자 감성인지를 통한 개인화 서비스)

  • Kwon, Il-Kyoung;Lee, Sang-Yong
    • Journal of Digital Convergence
    • /
    • v.10 no.2
    • /
    • pp.287-292
    • /
    • 2012
  • In this paper, user personalized services through the emotion perception required to support location-based sensing data preprocessing techniques and emotion data preprocessing techniques is studied for user's emotion data building and preprocessing in V-A emotion model. For this purpose the granular context tree and string matching based emotion pattern matching techniques are used. In addition, context-aware and personalized recommendation services technique using probabilistic reasoning is studied for personalized services based on context awareness.

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 Model to Infer Users' Behavior Patterns for Personalized Recommendation Service based Context-Awareness (컨텍스트 인식 기반 개인화 추천 서비스를 위한 사용자 행동패턴 추론 모델)

  • Seo, Hyo-Seok;Lee, Sang-Yong
    • Journal of Digital Convergence
    • /
    • v.10 no.2
    • /
    • pp.293-297
    • /
    • 2012
  • In order to provide with personalized recommendation service in context-awareness environment, the collected context data should be analyzed fast and the objective of user should be able to inferred effectively. But, the context collected from the mobile devices is not suitable for applying the existing inference algorithms as they are due to the omission or uncertainty of information and the efficient algorithms are required for mobile environment. In this paper, the behavior pattern was classified using naive bayes classification for minimize the loss caused by the omission or error of information. And pattern matching was used to effectively learn of the users inclination and infer the behavior purpose. The accuracy of the suggested inference model was evaluated by applying to the application recommendation service in the smart phones.

Design of Service Management System based on Context Information (상황정보를 기반으로 한 서비스 관리 시스템 설계)

  • Lee, Seung-Keun;Rim, Ki-Wook;Lee, Jung-Hyun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.5
    • /
    • pp.49-58
    • /
    • 2005
  • There has been an increase in the interest of applications that use a combination of both pervasive computing technology and context-aware technology. This application based on the development environment along with the support of developing context-aware applications is now being researched thoroughly and by many. The service management system provides services that are needed for context-aware applications. This system is an integral part of the developmental environment of context-aware applications. But there is a restrictive matching based on ontology that uses simple syntactic matching or a plain type of service used in previous researches. And there is also no consideration for context-aware information. Also, if the user is unable to find a service that is satisfactory, or is a service which a user does not desire, they may use a service which is composed of other existing services. This paper proposes a service management system based on context-aware information. The proposed system enables the accurate finding of services by considering semantic matching methods based on ontology and context-aware information. If the user does not find a service that is helpful in the service registry, it can provide the service list to enable other existing service compositions, by providing the functionality of these service compositions. As a result, the experiment of the system proposed has shown that the system properly supported the service discovery based on context-aware information and service composition.

Context-Awareness Modeling Method using Timed Petri-nets (시간 페트리 넷을 이용한 상황인지 모델링 기법)

  • Park, Byung-Sung;Kim, Hag-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4B
    • /
    • pp.354-361
    • /
    • 2011
  • Increasing interest and technological advances in smart home has led to active research on context-awareness service and prediction algorithms such as Bayesian Networks, Tree-Dimensional Structures and Genetic prediction algorithms. Context-awareness service presents that providing automatic customized service regarding individual user's pattern surely helps users improve the quality of life. However, it is difficult to implement context-awareness service because the problems are that handling coincidence with context information and exceptional cases have to consider. To overcome this problem, we proposes an Intelligent Sequential Matching Algorithm(ISMA), models context-awareness service using Timed Petri-net(TPN) which is petri-net to have time factor. The example scenario illustrates the effectiveness of the Timed Petri-net model and our proposed algorithm improves average 4~6% than traditional in the accuracy and reliability of prediction.