• 제목/요약/키워드: System Query

검색결과 1,366건 처리시간 0.026초

시맨틱 콘텐츠 검색을 위한 질의 확장 시스템 (Query Expansion System for Semantic Contents Retrieval)

  • 이무훈;최의인
    • 디지털융복합연구
    • /
    • 제10권10호
    • /
    • pp.307-312
    • /
    • 2012
  • 최근 논리적으로 표현된 지식 베이스를 사용하는 키워드 기반 검색에서 보다 더 정확한 결과를 제공하기 위해 시맨틱 검색 방법에 대한 연구가 진행되고 있다. 대부분의 사용자는 정형화된 질의어와 스키마를 사용하는 것 보다 사용자 키워드의 의미를 해석해서 사용한다. 본 논문에서는 시맨틱 검색을 위한 사용자 질의 확장을 제안한다. 제안 시스템에서는 지식 베이스와 연관 검색어를 활용한 사용자 질의 확장 콤포넌트와 사용자 질의 해석 결과를 조정하기 위한 콤포넌트를 제공한다. 마지막으로 논문에서 제안한 사용자 질의 의미 해석 기법의 검증을 위해 프로토타입 시스템의 실험 결과를 설명한다.

실내환경 모니터링시스템을 위한 무선 센서네트워크에서의 플러딩 방식의 질의모델 설계 및 구현 (Design and implementation of flooding-based query model in wireless sensor networks for indoor environmental monitoring system)

  • 이승철;정상중;이영동;정완영
    • 센서학회지
    • /
    • 제17권3호
    • /
    • pp.168-177
    • /
    • 2008
  • An indoor environmental monitoring system using IEEE 802.15.4 based wireless sensor network is proposed to monitor the amount of pollutant entering to the room from outside and also the amount of pollutant that is generated in indoor by the building materials itself or human activities. Small-size, low-power wireless sensor node and low power electrochemical sensor board is designed to measure the condition of indoor environment in buildings such as home, offices, commercial premises and schools. In this paper, two query models, the broadcasting query protocol and flooding query protocol, were designed and programmed as a query-based routing protocol in wireless sensor network for an environment monitoring system. The flooding query routing protocol in environment monitoring is very effective as a power saving routing protocol and reliable data transmission between sensor nodes.

용어적합성피드백기반-OPAC시스템에 대한 직접조작의 인터페이스 구축 (Developing a direct manipulation-based interface to OPAC system using term relevance feedback technique)

  • 이영자
    • 한국도서관정보학회지
    • /
    • 제26권
    • /
    • pp.365-400
    • /
    • 1997
  • The interface design for most present query-base model of OPAC systems does not include the function to implement an iterative feedback process till the user arrives at satisfied search results through the interaction with the system. Also, the interface doesn't provide the help function for a user to select pertinent search terms. To formulate a query at the present OPAC system, a user should learn a set of syntax different from system to system. All of above mentioned things make an end-user feel difficult to utilize an OPAC system effectively. This experimental system is attempted to alleviate a few limitations of the present OPAC system by a n.0, pplying the direct-manipulation technique as well as the feedback principle. First, this system makes it unnecessary for a user to learn some syntax for query formulation by providing option buttons for access points. Second, this system makes it possible for a user to decide whether each displayed record is relevant or not, and for keywords included in the relevant records to be automatically stored in order to be used for later feedback. Third, in this system, the keywords stored in [sayongja yongeu bogyanham] can be deleted if unnecessary or can selected as search terms for a query expansion as well as a query modification. Fourth, in this system, after inputting the original query, the feedback process can be proceed without coming back to the previous search step until a user becomes satisfied with the search results. In conclusion, the searching behaviors of heterogeneous users should be continuously observed, analysed, and studied, the findings of which should be integrated into the design for the interface of the OPAC system.

  • PDF

이동객체의 궤적에 대한 연속 최근접 질의에 관한 연구 (Study on Continuous Nearest Neighbor Query on Trajectory of Moving Objects)

  • 정지문
    • 한국디지털정책학회:학술대회논문집
    • /
    • 한국디지털정책학회 2005년도 춘계학술대회
    • /
    • pp.517-530
    • /
    • 2005
  • Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However, Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets showed that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also showed that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

  • PDF

Intelligent Query Processing Using a Meta-Database KaDB

  • Huh, Soon-Young;Hyun, Moon-Kae
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 1999년도 춘계공동학술대회-지식경영과 지식공학
    • /
    • pp.161-171
    • /
    • 1999
  • Query language has been widely used as a convenient tool to obtain information from a database. However, users demand more intelligent query processing systems that can understand the intent of an imprecise query and provide additional useful information as well as exact answers. This paper introduces a meta-database and presents a query processing mechanism that supports a variety of intelligent queries in a consistent and integrated way. The meta-database extracts data abstraction knowledge form an underlying database on the basis of a multilevel knowledge representation framework KAH. In cooperation with the underlying database, the meta-database supports four types of intelligent queries that provide approximately or conceptually equal answers as well as exact ones.

  • PDF

멀티미디어 데이터베이스에서 SMIL을 이용한 질의어 확장 및 프리젠테이션 시스템의 구현 (Query Language Extension and Implementation of MM Presentation System using SMIL in MMDB)

  • 이중화;이종환;유영호;김경석
    • 정보처리학회논문지D
    • /
    • 제8D권1호
    • /
    • pp.44-53
    • /
    • 2001
  • 멀티미디어 데이터베이스 시스템에서 멀티미디어 데이터를 질의하고 결과를 어떻게 프리젠테이션 할 것인가 하는 것은 매우 중요하다. 또한 질의 결과를 다양한 응용에서 사용하기 위해서는 보다 일반화된 형태로 질의결과를 제공해야 한다. 본 논문에서는 W3C의 권고안인 SMIL에서 제공하는 멀티미디어 프리젠테이션의 기능적 요소들을 질의어에서 지원하도록 함으로써 보다 일반화된 형태로 질의어를 확장하고, 또한 다양한 응용에서 사용하도록 하기 위해서 질의 결과를 SMIL 형태로 제공하도록 한다.

  • PDF

자동 질의수정을 통한 통합의학언어 시스템 검색 (The Method of Searching Unified Medical Language System Using Automatic Modified a Query)

  • 김종광;하원식;이정현
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 컴퓨터소사이어티 추계학술대회논문집
    • /
    • pp.129-132
    • /
    • 2003
  • The metathesaurus(UMLS, 2003AA edition) supports multi language and includes 875, 233 concepts, 2, 146, 897 concept names. It is impossible for PubMed or NLM serve searching of the metatheaurus to retrieval using a query that is not to be text, a fault sentence structure or a part of concept name. That means the user notice correctly suitable medical words in order to get correct answer, otherwise she or he can't find information that they want to find I propose that the method of searching unified medical language system using automatic modified a query for problem that I mentioned. This method use dictionary that is standard for automation of modified query gauge similarity between query and dictionary using string comparison algorithm. And then, the tested term converse the form of metathesaurus for optimized result. For the evaluation of method, I select some query and I contrast NLM method that renewed Aug. 2003.

  • PDF

이동객체의 궤적에 대한 연속 최근접 질의에 관한 연구 (Study on Continuous Nearest Neighbor Query on Trajectory of Moving Objects)

  • 정지문
    • 디지털융복합연구
    • /
    • 제3권1호
    • /
    • pp.149-163
    • /
    • 2005
  • Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However. Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets shows that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also shows that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

  • PDF

불리언 질의 재구성에서 의사결정나무의 학습 성능 감도 분석 (Sensitivity Analysis of Decision Tree's Learning Effectiveness in Boolean Query Reformulation)

  • 윤정미;김남호;권영식
    • 한국경영과학회지
    • /
    • 제23권4호
    • /
    • pp.141-149
    • /
    • 1998
  • One of the difficulties in using the current Boolean-based information retrieval systems is that it is hard for a user, especially a novice, to formulate an effective Boolean query. One solution to this problem is to let the system formulate a query for a user from his relevance feedback documents in this research, an intelligent query reformulation mechanism based on ID3 is proposed and the sensitivity of its retrieval effectiveness, i.e., recall, precision, and E-measure, to various input settings is analyzed. The parameters in the input settings is the number of relevant documents. Experiments conducted on the test set of Medlars revealed that the effectiveness of the proposed system is in fact sensitive to the number of the initial relevant documents. The case with two or more initial relevant documents outperformed the case with one initial relevant document with statistical significances. It is our conclusion that formulation of an effective query in the proposed system requires at least two relevant documents in its initial input set.

  • PDF

Applying Metricized Knowledge Abstraction Hierarchy for Securely Personalized Context-Aware Cooperative Query

  • Kwon Oh-Byung;Shin Myung-Geun;Kim In-Jun
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2006년도 춘계학술대회
    • /
    • pp.354-360
    • /
    • 2006
  • The purpose of this paper is to propose a securely personalized context-aware cooperative query that supports a multi-level data abstraction hierarchy and conceptual distance metric among data values, while considering privacy concerns around user context awareness. The conceptual distance expresses a semantic similarity among data values with a quantitative measure, and thus the conceptual distance enables query results to be ranked. To show the feasibility of the methodology proposed in this paper we have implemented a prototype system in the area of site search in a large-scale shopping mall.

  • PDF