• Title/Summary/Keyword: 컨텍스트 트리

Search Result 11, Processing Time 0.025 seconds

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.

Decision Tree Based Application Recommendation System (의사결정트리 기반 애플리케이션 추천 시스템)

  • Kim, Doo-Hyeong;Shin, Jae-Myong;Park, Sang-Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06d
    • /
    • pp.140-142
    • /
    • 2012
  • 최근 상황인지에 관한 연구가 활발히 진행되고 있으며 스마트폰의 각종 센서를 통해 사용자의 컨텍스트 파악이 가능해졌다. 이에 따라서 스마트폰의 컨텍스트 파악을 통해서 사용자에게 각종 친화적 서비스 모델이 많이 생겨 나고 있다. 사용자의 경로 추론, 실내에서의 사용자의 위치파악, 사용자 위치기반 편의시설 추천 등이 그 예이며, 그 중 애플리케이션 추천은 대표적인 서비스라 할 수 있다. 애플리케이션 추천은 사용자의 컨텍스트에 따라서 애플리케이션 사용내역을 로그 데이터로 만들고, 로그 데이터를 기반으로 컨텍스트에 따라서 사용자의 애플리케이션 추천을 해주는 시스템이다. 여기서 로그 데이터를 가공하지 않고 통계를 통해 추천이 가능하지만, 로그 데이터를 사용하여 의사 결정 트리를 만들게 되면 보다 정확하고, 빠르게 추천이 가능하며 적은 로그 데이터로 더 많은 컨텍스트에 적용하여 추천 할 수 있다는 이점이 있다. 본 논문에서는 사용자의 컨텍스트 추출하고 이 데이터를 기반으로 의사결정트리를 만들어 앱을 추천하는 시스템을 제안한다. 이러한 컨텍스트 수집 방법과 추론모델을 이용한 애플리케이션 추천 시스템은 추후 사용자 친화적 서비스 연구에 많은 도움이 될 것이다.

Context Visualizing SMS Based on Decision Tree (의사결정트리 기반의 컨텍스트 시각화 SMS)

  • Gahng, Shinwook;Oh, Jehwan;Lee, Eunseok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.515-518
    • /
    • 2009
  • 이동단말기가 보급이 확산됨에 따라 많은 사용자들이 이동단말기를 사용하고 필연적으로 많은 통신행동을 하고 있다. 특히 SMS 는 시간과 장소의 제한이 적어 사용자들의 통신행동 중 큰 비중을 차지하고 있다. SMS 통신행동에서 이모티콘의 사용이 많이 나타나고 있으며 이는 텍스트 기반의 의사소통의 한계를 극복하기 위한 방안으로 볼 수 있다. SMS 로부터 사용자의 감정을 추론하려는 기존의 연구가 있었지만 SMS 텍스트에 국한된다는 문제점이 있다. 본 논문에서는 최근 휴대폰, PDA, 스마트폰 등 이동단말기의 발전에 따라 통신행동 기록, 위치 정보와 같은 컨텍스트 정보를 수집하고 이용할 수 있음에 착안하여 SMS 텍스트와 함께 이동단말기의 컨텍스트 정보를 추론에 사용하였다. 의사결정트리를 이용하여 가용한 컨텍스트 정보로부터 추론한 정황 정보를 SMS 통신에서 사용하여 기존의 텍스트 기반의 의사소통의 한계를 극복할 수 있는 Visual SMS 를 제안한다. 사전에 정의한 훈련 데이터 집합을 통하여 의사결정트리를 생성하고 이를 기반으로 Visual SMS 를 구현, 시뮬레이션하여 추론 결과를 통해 그 기대효과를 확인한다.

Scheduling Management Agent using Bayesian Network based on Location Awareness (베이지안 네트워크를 이용한 위치인식 기반 일정관리 에이전트)

  • Yeon, Sun-Jung;Hwang, Hye-Jeong;Lee, Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.6
    • /
    • pp.712-717
    • /
    • 2011
  • Recently, diverse schedule management agents are being researched for the efficient schedule management of smart devices users, but they remain at a confirmatory level. In order to efficiently manage user's schedules, execution of planned schedules should be monitored to help users properly execute their schedules, or feedback must be given so that when setting up new schedules, users can plan their schedule according to their schedule establishment patterns. This research proposes a schedule management agent that infers the user's behaviors by using acquired user context, and provides schedule related feedback depending on the user's behavior patterns, when users are executing their schedules or planning new schedules. For this, collected user context information is preprocessed and user's behavior is inferred by Bayesian network. Also, in order to provide feedbacks necessary for confirming the user's schedule execution and new schedule establishment, a context tree pattern matching method for the user's schedule, location and time contexts was applied, then verified with 6 weeks of user simulation in a mobile environment.

Context-based Incremental Preference Analysis Method in Ubiquitous Commerce (유비쿼터스 상거래 환경의 컨텍스트 기반 점진적 선호 분석 기법)

  • Ku Mi Sug;Hwang Jeong Hee;Choi Nam Kyu;Jung Doo Young;Ryu Keun Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.7 s.96
    • /
    • pp.1417-1426
    • /
    • 2004
  • As Ubiquitous commerce is coming personalization service is getting interested. And also the recommendation method which offers useful information to customer becomes more important. However, most of them depend on specific method and are restricted to the E-commerce. For applying these recommendation methods into U-commerce, first it is necessary that the extended context modeling and systematic connection of the methods to complement strength and weakness of recommendation methods in each commercial transaction. Therefore, we propose a mod-eling technique of context information related to personal activation in commercial transaction and show incremental preference analysis method, using preference tree which is closely connected to recommendation method in each step. And also, we use an XML indexing technique to effi-ciently extract the recommendation information from a preference tree.

A Network-adaptive Context Extraction Method for JPEG2000 Using Tree-Structure of Coefficients from DWT (DWT 계수의 트리구조를 이용한 네트워크-적응적 JPEG2000 컨텍스트 추출방법)

  • Choi Hyun-Jun;Seo Young-Ho;Kim Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9C
    • /
    • pp.939-948
    • /
    • 2005
  • In EBCOT, the context extraction process takes excessive calculation time and this paper proposed a method to reduce this calculation time. That is, if a coefficient is less than a pre-defined threshold value the coefficient and its descendents skip the context extraction process. There is a trade-off relationship between the calculation time and the image quality or the amount of output data such that as this threshold value increases, the calculation time and the amount of output data decreases, but the image degradation increases. Therefore, by deciding this threshold value according to the network environments or conditions, it is possible to establish a network-adaptive context extraction method. The experimental results showed that the range of the threshold values for acceptable image quality(better than 30dB) is from 0 to 4. The experimental results showed that in this range the Resulting reduction rate in calculation time was from $3\%\;to\;64\%$ in average, the reduction rate in output data was from $32\%$ to $73\%$ in average, which means that large reduction in calculation time and output data can be obtained with a cost of an acceptable image quality degradation. Therefore, the proposed method is expected to be used efficiently in the application area such as the real-time image/video data communication in wireless environments, etc.

Life Story Generation in Mobile Environments Using User Contexts and Petri Net (사용자 컨텍스트와 페트리넷을 이용한 모바일 상의 라이프 스토리 생성)

  • Lee, Young-Seol;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.2
    • /
    • pp.236-240
    • /
    • 2008
  • People use diary or photograph for recall-ing their memory in order to satisfy their desires for recording their lives. If the experienced events are organized to a story, S/he can share her/his experience with others, and recall her/his significant events easily. In this paper, we propose a method that generates a story with Petri net and user contexts collected from mobile device. Here, we use Petri-net as a representation method that links human activities or experience causally. It is appropriate solution for modeling parallel events in real world, and for representing non-linear story line. In order to show the usefulness of the proposed method, we show an example of generating a story of user's experience with user contexts from mobile device and evaluate them.

Kernelized Structure Feature for Discriminating Meaningful Table from Decorative Table (장식 테이블과 의미 있는 테이블 식별을 위한 커널 기반의 구조 자질)

  • Son, Jeong-Woo;Go, Jun-Ho;Park, Seong-Bae;Kim, Kweon-Yang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.5
    • /
    • pp.618-623
    • /
    • 2011
  • This paper proposes a novel method to discriminate meaningful tables from decorative one using a composite kernel for handling structural information of tables. In this paper, structural information of a table is extracted with two types of parse trees: context tree and table tree. A context tree contains structural information around a table, while a table tree presents structural information within a table. A composite kernel is proposed to efficiently handle these two types of trees based on a parse tree kernel. The support vector machines with the proposed kernel dised kuish meaningful tables from the decorative ones with rich structural information.

Annotation Repositioning Methods in XML Documents (XML문서에서 어노테이션의 위치재생성 기법)

  • Sohn Won-Sung;Kim Jae-Kyung;Ko Myeong-Cheol;Lim Soon-Bum;Choy Yoon-Chul
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.7
    • /
    • pp.650-662
    • /
    • 2005
  • A robust repositioning method is required for annotations to always maintain proper positions when original documents were modified. Robust anchoring in the XML document provides better anchoring results when it includes features of structured documents as well as annotated texts. This paper proposes robust annotation anchoring method in XML document. To do this, this work presents annotation information as logical structure trees, and creates candidate anchors by analyzing matching relations between the annotation and document trees. To select the appropriate candidate anchor among many candidate anchors, this work presents several anchoring criteria based on the textual and label context of anchor nodes in the logical structure trees. As a result, robust anchoring is realized even after various modifications of contexts in the structured document.