• Title/Summary/Keyword: dynamic bayesian network

Search Result 66, Processing Time 0.027 seconds

Rule-based and Probabilistic Event Recognition of Independent Objects for Interpretation of Emergency Scenarios (긴급 상황 시나리오 해석을 위한 독립 객체의 규칙 기반 및 확률적 이벤트 인식)

  • Lee, Jun-Cheol;Choi, Chang-Gyu
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.3
    • /
    • pp.301-314
    • /
    • 2008
  • The existing event recognition is accomplished with the limited systematic foundation, and thus much longer learning time is needed for emergency scenario interpretation due to large scale of probability data. In this paper, we propose a method for nile-based event recognition of an independent object(human) which extract a feature vectors from the object and analyze the behavior pattern of each object and interpretation of emergency scenarios using a probability and object's events. The event rule of an independent object is composed of the Primary-event, Move-event, Interaction-event, and 'FALL DOWN' event and is defined through feature vectors of the object and the segmented motion orientated vector (SMOV) in which the dynamic Bayesian network is applied. The emergency scenario is analyzed using current state of an event and its post probability. In this paper, we define diversified events compared to that of pre-existing method and thus make it easy to expand by increasing independence of each events. Accordingly, semantics information, which is impossible to be gained through an.

  • PDF

MOnCa2: High-Level Context Reasoning Framework based on User Travel Behavior Recognition and Route Prediction for Intelligent Smartphone Applications (MOnCa2: 지능형 스마트폰 어플리케이션을 위한 사용자 이동 행위 인지와 경로 예측 기반의 고수준 콘텍스트 추론 프레임워크)

  • Kim, Je-Min;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.295-306
    • /
    • 2015
  • MOnCa2 is a framework for building intelligent smartphone applications based on smartphone sensors and ontology reasoning. In previous studies, MOnCa determined and inferred user situations based on sensor values represented by ontology instances. When this approach is applied, recognizing user space information or objects in user surroundings is possible, whereas determining the user's physical context (travel behavior, travel destination) is impossible. In this paper, MOnCa2 is used to build recognition models for travel behavior and routes using smartphone sensors to analyze the user's physical context, infer basic context regarding the user's travel behavior and routes by adapting these models, and generate high-level context by applying ontology reasoning to the basic context for creating intelligent applications. This paper is focused on approaches that are able to recognize the user's travel behavior using smartphone accelerometers, predict personal routes and destinations using GPS signals, and infer high-level context by applying realization.

Robust Particle Filter Based Route Inference for Intelligent Personal Assistants on Smartphones (스마트폰상의 지능형 개인화 서비스를 위한 강인한 파티클 필터 기반의 사용자 경로 예측)

  • Baek, Haejung;Park, Young Tack
    • Journal of KIISE
    • /
    • v.42 no.2
    • /
    • pp.190-202
    • /
    • 2015
  • Much research has been conducted on location-based intelligent personal assistants that can understand a user's intention by learning the user's route model and then inferring the user's destinations and routes using data of GPS and other sensors in a smartphone. The intelligence of the location-based personal assistant is contingent on the accuracy and efficiency of the real-time predictions of the user's intended destinations and routes by processing movement information based on uncertain sensor data. We propose a robust particle filter based on Dynamic Bayesian Network model to infer the user's routes. The proposed robust particle filter includes a particle generator to supplement the incorrect and incomplete sensor information, an efficient switching function and an weight function to reduce the computation complexity as well as a resampler to enhance the accuracy of the particles. The proposed method improves the accuracy and efficiency of determining a user's routes and destinations.

Ontology-based User Intention Recognition for Proactive Planning of Intelligent Robot Behavior (지능형로봇 행동의 능동적 계획수립을 위한 온톨로지 기반 사용자 의도인식)

  • Jeon, Ho-Cheol;Choi, Joong-Min
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.1
    • /
    • pp.86-99
    • /
    • 2011
  • Due to the uncertainty of intention recognition for behaviors of users, the intention is differently recognized according to the situation for the same behavior by the same user, the accuracy of user intention recognition by minimizing the uncertainty is able to be improved. This paper suggests a novel ontology-based method to recognize user intentions, and able to minimize the uncertainties that are the obstacles against the precise recognition of user intention. This approach creates ontology for user intention, makes a hierarchy and relationship among user intentions by using RuleML as well as Dynamic Bayesian Network, and improves the accuracy of user intention recognition by using the defined RuleML as well as the gathered sensor data such as temperature, humidity, vision, and auditory. To evaluate the performance of robot proactive planning mechanism, we developed a simulator, carried out some experiments to measure the accuracy of user intention recognition for all possible situations, and analyzed and detailed described the results. The result of our experiments represented relatively high level the accuracy of user intention recognition. On the other hand, the result of experiments tells us the fact that the actions including the uncertainty get in the way the precise user intention recognition.

A Study on Detection of Small Size Malicious Code using Data Mining Method (데이터 마이닝 기법을 이용한 소규모 악성코드 탐지에 관한 연구)

  • Lee, Taek-Hyun;Kook, Kwang-Ho
    • Convergence Security Journal
    • /
    • v.19 no.1
    • /
    • pp.11-17
    • /
    • 2019
  • Recently, the abuse of Internet technology has caused economic and mental harm to society as a whole. Especially, malicious code that is newly created or modified is used as a basic means of various application hacking and cyber security threats by bypassing the existing information protection system. However, research on small-capacity executable files that occupy a large portion of actual malicious code is rather limited. In this paper, we propose a model that can analyze the characteristics of known small capacity executable files by using data mining techniques and to use them for detecting unknown malicious codes. Data mining analysis techniques were performed in various ways such as Naive Bayesian, SVM, decision tree, random forest, artificial neural network, and the accuracy was compared according to the detection level of virustotal. As a result, more than 80% classification accuracy was verified for 34,646 analysis files.

Predictive Clustering-based Collaborative Filtering Technique for Performance-Stability of Recommendation System (추천 시스템의 성능 안정성을 위한 예측적 군집화 기반 협업 필터링 기법)

  • Lee, O-Joun;You, Eun-Soon
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.1
    • /
    • pp.119-142
    • /
    • 2015
  • With the explosive growth in the volume of information, Internet users are experiencing considerable difficulties in obtaining necessary information online. Against this backdrop, ever-greater importance is being placed on a recommender system that provides information catered to user preferences and tastes in an attempt to address issues associated with information overload. To this end, a number of techniques have been proposed, including content-based filtering (CBF), demographic filtering (DF) and collaborative filtering (CF). Among them, CBF and DF require external information and thus cannot be applied to a variety of domains. CF, on the other hand, is widely used since it is relatively free from the domain constraint. The CF technique is broadly classified into memory-based CF, model-based CF and hybrid CF. Model-based CF addresses the drawbacks of CF by considering the Bayesian model, clustering model or dependency network model. This filtering technique not only improves the sparsity and scalability issues but also boosts predictive performance. However, it involves expensive model-building and results in a tradeoff between performance and scalability. Such tradeoff is attributed to reduced coverage, which is a type of sparsity issues. In addition, expensive model-building may lead to performance instability since changes in the domain environment cannot be immediately incorporated into the model due to high costs involved. Cumulative changes in the domain environment that have failed to be reflected eventually undermine system performance. This study incorporates the Markov model of transition probabilities and the concept of fuzzy clustering with CBCF to propose predictive clustering-based CF (PCCF) that solves the issues of reduced coverage and of unstable performance. The method improves performance instability by tracking the changes in user preferences and bridging the gap between the static model and dynamic users. Furthermore, the issue of reduced coverage also improves by expanding the coverage based on transition probabilities and clustering probabilities. The proposed method consists of four processes. First, user preferences are normalized in preference clustering. Second, changes in user preferences are detected from review score entries during preference transition detection. Third, user propensities are normalized using patterns of changes (propensities) in user preferences in propensity clustering. Lastly, the preference prediction model is developed to predict user preferences for items during preference prediction. The proposed method has been validated by testing the robustness of performance instability and scalability-performance tradeoff. The initial test compared and analyzed the performance of individual recommender systems each enabled by IBCF, CBCF, ICFEC and PCCF under an environment where data sparsity had been minimized. The following test adjusted the optimal number of clusters in CBCF, ICFEC and PCCF for a comparative analysis of subsequent changes in the system performance. The test results revealed that the suggested method produced insignificant improvement in performance in comparison with the existing techniques. In addition, it failed to achieve significant improvement in the standard deviation that indicates the degree of data fluctuation. Notwithstanding, it resulted in marked improvement over the existing techniques in terms of range that indicates the level of performance fluctuation. The level of performance fluctuation before and after the model generation improved by 51.31% in the initial test. Then in the following test, there has been 36.05% improvement in the level of performance fluctuation driven by the changes in the number of clusters. This signifies that the proposed method, despite the slight performance improvement, clearly offers better performance stability compared to the existing techniques. Further research on this study will be directed toward enhancing the recommendation performance that failed to demonstrate significant improvement over the existing techniques. The future research will consider the introduction of a high-dimensional parameter-free clustering algorithm or deep learning-based model in order to improve performance in recommendations.