• Title/Summary/Keyword: Context prediction

Search Result 263, Processing Time 0.021 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.

User Modeling based Time-Series Analysis for Context Prediction in Ubiquitous Computing Environment (유비쿼터스 컴퓨팅 환경에서 컨텍스트 예측을 위한 시계열 분석 기반 사용자 모델링)

  • Choi, Young-Hwan;Lee, Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.5
    • /
    • pp.655-660
    • /
    • 2009
  • The context prediction algorithms are not suitable to provide real-time personalized service for users in context-awareness environment. The algorithms have problems like time delay in training data processing and the difficulties of implementation in real-time environment. In this paper, we propose a prediction algorithm with user modeling to shorten of processing time and to improve the prediction accuracy in the context prediction algorithm. The algorithm uses moving path of user contexts for context prediction and generates user model by time-series analysis of user's moving path. And that predicts the user context with the user model by sequence matching method. We compared our algorithms with the prediction algorithms by processing time and prediction accuracy. As the result, the prediction accuracy of our algorithm is similar to the prediction algorithms, and processing time is reduced by 40% in real time service environment.

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.

Context-Based Minimum MSE Prediction and Entropy Coding for Lossless Image Coding

  • Musik-Kwon;Kim, Hyo-Joon;Kim, Jeong-Kwon;Kim, Jong-Hyo;Lee, Choong-Woong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.06a
    • /
    • pp.83-88
    • /
    • 1999
  • In this paper, a novel gray-scale lossless image coder combining context-based minimum mean squared error (MMSE) prediction and entropy coding is proposed. To obtain context of prediction, this paper first defines directional difference according to sharpness of edge and gradients of localities of image data. Classification of 4 directional differences forms“geometry context”model which characterizes two-dimensional general image behaviors such as directional edge region, smooth region or texture. Based on this context model, adaptive DPCM prediction coefficients are calculated in MMSE sense and the prediction is performed. The MMSE method on context-by-context basis is more in accord with minimum entropy condition, which is one of the major objectives of the predictive coding. In entropy coding stage, context modeling method also gives useful performance. To reduce the statistical redundancy of the residual image, many contexts are preset to take full advantage of conditional probability in entropy coding and merged into small number of context in efficient way for complexity reduction. The proposed lossless coding scheme slightly outperforms the CALIC, which is the state-of-the-art, in compression ratio.

Design of a User Location Prediction Algorithm Using the Flexible Window Scheme (Flexible Window 기법을 이용한 위치 예측 알고리즘 설계)

  • Son, Byoung-Hee;Kim, Yong-Hoon;Nahm, Eui-Seok;Kim, Hag-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.550-557
    • /
    • 2007
  • We predict a context of various structures by using Bayesian Networks Algorithms, Three-Dimensional Structures Algorithms and Genetic Algorithms. However, these algorithms have unavoidable problems when providing a context-aware service in reality due to a lack of practicality and the delay of process time in real-time environment. As far as context-aware system for specific purpose is concerned, it is very hard to be sure about the accuracy and reliability of prediction. This paper focuses on reasoning and prediction technology which provides a stochastic mechanism for context information by incorporating various context information data. The objective of this paper is to provide optimum services to users by suggesting an intellectual reasoning and prediction based on hierarchical context information. Thus, we propose a design of user location prediction algorithm using sequential matching with n-size flexible window scheme by taking user's habit or behavior into consideration. This algorithm improves average 5.10% than traditional algorithms in the accuracy and reliability of prediction using the Flexible Window Scheme.

Context-aware Connectivity Analysis Method using Context Data Prediction Model in Delay Tolerant Networks (Delay Tolerant Networks에서 속성정보 예측 모델을 이용한 상황인식 연결성 분석 기법)

  • Jeong, Rae-Jin;Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.4
    • /
    • pp.1009-1016
    • /
    • 2015
  • In this paper, we propose EPCM(Efficient Prediction-based Context-awareness Matrix) algorithm analyzing connectivity by predicting cluster's context data such as velocity and direction. In the existing DTN, unrestricted relay node selection causes an increase of delay and packet loss. The overhead is occurred by limited storage and capability. Therefore, we propose the EPCM algorithm analyzing predicted context data using context matrix and adaptive revision weight, and selecting relay node by considering connectivity between cluster and base station. The proposed algorithm saves context data to the context matrix and analyzes context according to variation and predicts context data after revision from adaptive revision weight. From the simulation results, the EPCM algorithm provides the high packet delivery ratio by selecting relay node according to predicted context data matrix.

A Study on the Lossless Image Compression using Context based Predictive Technique of Error Feedback (에러 피드백의 컨텍스트 기반 예측기법을 이용한 무손실 영상 압축에 관한 연구)

  • Chu, Hyung-Suk;Park, Byung-Su;An, Chong-Koo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.12
    • /
    • pp.2251-2256
    • /
    • 2007
  • In this paper, the wavelet transform based lossless image compression algorithm is proposed. The proposed algorithm transforms the input image using 9/7 ICFB and S+P filter, and eliminates the spacious correlation of the subband coefficients, applying the context modeling predictive technique based on the multi-resolution structure and the feedback of the prediction error. The prediction context exploits the subordination and direction property of the different level subband in the vertical, horizontal, and diagonal subband coefficients. The simulation result of the high frequency images such as PEPPERS, BOAT, and AIRPLANE shows that the proposed algorithm efficiently predicts the edge area of each multi-resolution subband.

Context-based Predictive Coding Scheme for Lossless Image Compression (무손실 영상 압축을 위한 컨텍스트 기반 적응적 예측 부호화 방법)

  • Kim, Jongho;Yoo, Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.183-189
    • /
    • 2013
  • This paper proposes a novel lossless image compression scheme composed of direction-adaptive prediction and context-based entropy coding. In the prediction stage, we analyze the directional property with respect to the current coding pixel and select an appropriate prediction pixel. In order to further reduce the prediction error, we propose a prediction error compensation technique based on the context model defined by the activities and directional properties of neighboring pixels. The proposed scheme applies a context-based Golomb-Rice coding as the entropy coding since the coding efficiency can be improved by using the conditional entropy from the viewpoint of the information theory. Experimental results indicate that the proposed lossless image compression scheme outperforms the low complexity and high efficient JPEG-LS in terms of the coding efficiency by 1.3% on average for various test images, specifically for the images with a remarkable direction the proposed scheme shows better results.

Lossless Compression Algorithm using Spatial and Temporal Information (시간과 공간정보를 이용한 무손실 압축 알고리즘)

  • Kim, Young Ro;Chung, Ji Yung
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.3
    • /
    • pp.141-145
    • /
    • 2009
  • In this paper, we propose an efficient lossless compression algorithm using spatial and temporal information. The proposed method obtains higher lossless compression of images than other lossless compression techniques. It is divided into two parts, a motion adaptation based predictor part and a residual error coding part. The proposed nonlinear predictor can reduce prediction error by learning from its past prediction errors. The predictor decides the proper selection of the spatial and temporal prediction values according to each past prediction error. The reduced error is coded by existing context coding method. Experimental results show that the proposed algorithm has better performance than those of existing context modeling methods.

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.