• Title/Summary/Keyword: Vague Query

Search Result 8, Processing Time 0.021 seconds

Fuzzy Theory based Electronic Commerce Navigation Agent that can Query by Natural Language (자연어 질의가 가능한 퍼지 기반 지능형 전자상거래 검색 에이전트)

  • 김명순;정환묵
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2001.05a
    • /
    • pp.270-273
    • /
    • 2001
  • In this paper, we proposed the intelligent navigation agent model for successive electronic commerce management. For allowing intelligence, we used fuzzy theory. Fuzzy theory is very useful method where keywords have vague conditions and system must process that conditions. So, using theory, we proposed the model that can process the vague keywords effectively. Through the this, we verified that we can get the more appropriate navigation result than any other crisp retrieval keywords condition.

  • PDF

Cooperative Query Answering Based on Abstraction Database (추상화 정보 데이터베이스 기반 협력적 질의 응답)

  • 허순영;이정환
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.1
    • /
    • pp.99-117
    • /
    • 1999
  • Since query language is used as a handy tool to obtain information from a database, a more intelligent query answering system is needed to provide user-friendly and fault-tolerant human-machine Interface. Frequently, database users prefer less rigid querying structure, one which allows for vagueness in composing queries, and want the system to understand the intent behind a query. When there is no matching data available, users would rather receive approximate answers than a null information response. This paper presents a knowledge abstraction database that facilitates the development of such a fault-tolerant and intelligent database system. The proposed knowledge abstraction database adepts a multilevel knowledge representation scheme called the knowledge abstraction hierarchy(KAH), extracts semantic data relationships from the underlying database, and provides query transformation mechanisms using query generalization and specialization steps. In cooperation with the underlying database, the knowledge abstraction database accepts vague queries and allows users to pose approximate queries as well as conceptually abstract queries. Specifically. four types of vague queries are discussed, including approximate selection, approximate join, conceptual selection, and conceptual Join. A prototype system has been implemented at KAIST and is being tested with a personnel database system to demonstrate the usefulness and practicality of the knowledge abstraction database in ordinary database application systems.

  • PDF

Fuzzy Theory based Electronic Commerce Navigation Agent that can Process Natural Language (자연어 처리가 가능한 퍼지 이론 기반 전자상거래 검색 에이전트)

  • 김명순;정환묵
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.3
    • /
    • pp.246-251
    • /
    • 2001
  • In this paper, we proposed the intelligent navigation agent model for successive electronic commerce system management. Fuzzy theory is very useful method where keywords have vague conditions and system must process that conditions. So, using fuzzy theory, we proposed the model that can process the vague keywords effectively. Through the this, we verified that we can get the more appropriate navigation result than any other crisp retrieval keywords condition.

  • PDF

Providing Approximate Answers Using a Knowledge Abstraction Hierarchy (지식 추상화 계층을 이용한 근사해 생성)

  • Huh, Soon-Young;Moon, Kae-Hyun
    • Asia pacific journal of information systems
    • /
    • v.8 no.1
    • /
    • pp.43-64
    • /
    • 1998
  • Cooperative query answering is a research effort to develop a fault-tolerant and intelligent database system using the semantic knowledge base constructed from the underlying database. Such knowledge base has two aspects of usage. One is supporting the cooperative query answering process for providing both an exact answer and neighborhood information relevant to a query. The other is supporting ongoing maintenance of the knowledge base for accommodating the changes in the knowledge content and database usage purpose. Existing studies have mostly focused on the cooperative query answering process but paid little attention to the dynamic knowledge base maintenance. This paper proposes a multi-level knowledge representation framework called Knowledge Abstraction Hierarchy(KAH) that can not only support cooperative query answering but also permit dynamic knowledge maintenance, On the basis of the KAH, a knowledge abstraction database is constructed on the relational data model and accommodates diverse knowledge maintenance needs and flexibly facilitates cooperative query answering. In terms of the knowledge maintenance, database operations are discussed for the cases where either the internal contents for a given KAH change or the structures of the KAH itself change. In terms of cooperative query answering, four types of vague queries are discussed, including approximate selection, approximate join, conceptual selection, and conceptual join. A prototype system has been implemented at KAIST and is being tested with a personnel database system to demonstrate the usefulness and practicality of the knowledge abstraction database in ordinary database application systems.

  • PDF

A Study on Electronic Commerce Navigation Agent Model Using Fuzzy-Conditional Probability (퍼지-조건부확률을 이용한 전자상거래 검색 에이전트 모델에 관한 연구)

  • 김명순
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.2
    • /
    • pp.1-6
    • /
    • 2004
  • In this paper, we proposed the intelligent navigation agent model for successive electronic commerce management. For allowing intelligence, we used fuzzy conditional probability and trapezoidal. we proposed the model that can Process the vague keywords effectively. Through the this, we verified that we can get the more appropriate navigation result than any other crisp retrieval keywords condition. Our goal of study is make an intelligent automatic navigation agent model.

  • PDF

Tuple Membership Values & Entropy for a Vague Model of the Fuzzy Databases (Vague형 퍼지 데이터베이스에서의 튜플 소속척도와 질의에 대한 엔트로피 연구)

  • 박순철
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.4 no.1
    • /
    • pp.52-57
    • /
    • 1999
  • In this paper, the methods which calculate the tuple membership values in a vague model of the fuzzy databases are analyzed A method among them is proposed to offer the effective solutions to the users. Also an information theory is studied to calculate the entropy of the results of a fuzzy query and an algorithm is proposed to control the size of the entropy.

  • PDF

Effectual Fuzzy Query Evaluation Method based on Fuzzy Linguistic Matrix in Information Retrieval (정보검색에서 퍼지 언어 매트릭스에 근거한 효율적인 퍼지 질의 평가 방법)

  • 최명복;김민구
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.3
    • /
    • pp.218-227
    • /
    • 2000
  • In this paper, we present a new fuzzy information retrieval method based on thesaurus. In the proposed method th thesaurus is represented by a fuzzy linguistic matrix, where the elements in fuzzy linguistic matrix represent a qualitative linguistic values between terms. In the fuzzy linguistic matrix, there are three kinds of fuzzy relationships between terms, i.e., similar relation, hierarchical relation, and associative relation. The implicit fuzzy relationships between terms are inferred by the transitive closure of the fuzzy linguistic matrix based on fuzzy theory. And the proposed method has the capability to deal with a qualitative linguistic weights in a query and in indexing of information items to reflect qualitative measure of human based on vague and uncertain decisions rather than a quantitiative measure. Therefore the proposed method is more flexible than the ones presented in papers[1-3]. Moreover our method is more effectual of time than the ones presented in papers[1-3] because we use a fuzzy linguistic matrix and AON (Associate Ordinary Number) values in query evaluation process. As a result, the proposed method allows the users to perform fuzzy queries in a more flexible and more intelligent manner.

  • PDF

An Extended Hypertext Data Model based on Object-Oriented Praradigm (객체지향 개념을 기반으로한 하이퍼텍스트 데이터 모델)

  • 이재무;임해철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.9
    • /
    • pp.1680-1691
    • /
    • 1994
  • We propose an extended hypertext data model based on object oriented paradigm that can easily the real world and semantics. We use the BNF notation to formalize the model. In our model, We introduce conceptional navigation by associating semantics on links and drive intelligent navigation using weights on links to alleviate user disorientation problem which is currently somewhat vague. We functionally classify the hypertext node into three types:Indexing node, Content node, Extract node and likewise classify the link into Alink type, Rlink type, Slink type. We believe that the typed node and typed link approach accommodate efficient query/search in hypertext.

  • PDF