• Title/Summary/Keyword: 문법적 진화기법

Search Result 3, Processing Time 0.016 seconds

Designing the Moving Pattern of Cleaning Robot based on Grammatical Evolution with Conditional Probability Table (문법적 진화기법과 조건부 확률을 이용한 청소 로봇의 이동 패턴 계획)

  • Gwon, Soon-Joe;Kim, Hyun-Tae;Ahn, Chang Wook
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.4
    • /
    • pp.184-188
    • /
    • 2016
  • The cleaning robot is popularly used as a home appliance. The state-of-the-art cleaning robot can clean more efficiently by using information gathered from its sensor, which is difficult for low-price cleaning robots due to limitation in this aspect. In this paper, we suggested a method for the moving pattern of cleaning robot based on grammatical evolution. Optimized program is generated by using moving pattern grammar, which is defined by Backus-Naur form. In addition, conditional probability is used between each of the grammar elements during the program creation process. The proposed method is evaluated by robot simulation in order to verify its performance and further compare it with existing algorithms. The experiment results showed that the proposed method is better than the compared algorithms.

Natural Language Parsing through Evolutionary Computation (진화연산을 이용한 자연어 파싱)

  • 김동민;박성배;장병탁
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04c
    • /
    • pp.419-421
    • /
    • 2003
  • 본 논문에서는 진화 연산 기법을 이용한 자연어 구운 분석 기법을 제시한다 기존의 확률 문맥 무관문법(PCFG)에 관한 연구는 차트 파싱 방법을 구문 분석을 위한 기법으로 가정하고 있다. 하지만, 차트 파싱은 문장의 길이가 늘어날수록 복잡도가 크게 증가하는 문제를 안고 있다. 따라서, 차트 파서의 대안으로서 진화 연산 기법을 사용하여 이 문제를 해결하였다. 진화 연산의 적합도 함수로는 생성된 파스트리의 확률을 사용하였다. 작은 규모의 자연어 문제에 적용한 결과, 진화 연산이 파싱 문제를 성공적으로 해결할 수 있음을 확인할 수 있었다.

  • PDF

A Trustworthiness Improving Link Evaluation Technique for LOD considering the Syntactic Properties of RDFS, OWL, and OWL2 (RDFS, OWL, OWL2의 문법특성을 고려한 신뢰향상적 LOD 연결성 평가 기법)

  • Park, Jaeyeong;Sohn, Yonglak
    • Journal of KIISE:Databases
    • /
    • v.41 no.4
    • /
    • pp.226-241
    • /
    • 2014
  • LOD(Linked Open Data) is composed of RDF triples which are based on ontologies. They are identified, linked, and accessed under the principles of linked data. Publications of LOD data sets lead to the extension of LOD cloud and ultimately progress to the web of data. However, if ontologically the same things in different LOD data sets are identified by different URIs, it is difficult to figure out their sameness and to provide trustworthy links among them. To solve this problem, we suggest a Trustworthiness Improving Link Evaluation, TILE for short, technique. TILE evaluates links in 4 steps. Step 1 is to consider the inference property of syntactic elements in LOD data set and then generate RDF triples which have existed implicitly. In Step 2, TILE appoints predicates, compares their objects in triples, and then evaluates links between the subjects in the triples. In Step 3, TILE evaluates the predicates' syntactic property at the standpoints of subject description and vocabulary definition and compensates the evaluation results of Step 2. The syntactic elements considered by TILE contain RDFS, OWL, OWL2 which are recommended by W3C. Finally, TILE makes the publisher of LOD data set review the evaluation results and then decide whether to re-evaluate or finalize the links. This leads the publishers' responsibility to be reflected in the trustworthiness of links among the data published.