• Title/Summary/Keyword: 그래프 추론

Search Result 98, Processing Time 0.032 seconds

A Rewriting Algorithm for Inferrable SPARQL Query Processing Independent of Ontology Inference Models (온톨로지 추론 모델에 독립적인 SPARQL 추론 질의 처리를 위한 재작성 알고리즘)

  • Jeong, Dong-Won;Jing, Yixin;Baik, Doo-Kwon
    • Journal of KIISE:Databases
    • /
    • v.35 no.6
    • /
    • pp.505-517
    • /
    • 2008
  • This paper proposes a rewriting algorithm of OWL-DL ontology query in SPARQL. Currently, to obtain inference results of given SPARQL queries, Web ontology repositories construct inference ontology models and match the SPARQL queries with the models. However, an inference model requires much larger space than its original base model, and reusability of the model is not available for other inferrable SPARQL queries. Therefore, the aforementioned approach is not suitable for large scale SPARQL query processing. To resolve tills issue, this paper proposes a novel SPARQL query rewriting algorithm that can obtain results by rewriting SPARQL queries and accomplishing query operations against the base ontology model. To achieve this goal, we first define OWL-DL inference rules and apply them on rewriting graph pattern in queries. The paper categorizes the inference rules and discusses on how these rules affect the query rewriting. To show the advantages of our proposal, a prototype system based on lena is implemented. For comparative evaluation, we conduct an experiment with a set of test queries and compare of our proposal with the previous approach. The evaluation result showed the proposed algorithm supports an improved performance in efficiency of the inferrable SPARQL query processing without loss of completeness and soundness.

Static Type Inference Based on Static Single Assignment for Bytecode (바이트코드를 위한 정적 단일 배정문 기반의 정적 타입 추론)

  • Kim Ji-Min;Kim Ki-Tea;Kim Je-Min;Yoo Weon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.4 s.42
    • /
    • pp.87-96
    • /
    • 2006
  • Although bytecode has many good features, it has slow execution speed and it is not an ideal representation for program analysis or optimization. For analysises and optimizations. bytecode must be translated to a Static Single Assignment Form(SSA Form) But when bytecode is translated a SSA Form it has lost type informations of son variables. For resolving these problem in this paper, we create extended control flow graph on bytecode. Also we convert the control flow graph to SSA Form for static analysis. Calculation about many informations such as dominator, immediate dominator. dominance frontier. ${\phi}$-Function. renaming are required to convert to SSA Form. To obtain appropriate type for generated SSA Form, we proceed the followings. First. we construct call graph and derivation graph of classes. And the we collect information associated with each node. After finding equivalence nodes and constructing Strongly Connected Component based on the collected informations. we assign type to each node.

  • PDF

An Analysis of the RDF Authorization Conflict Problem by RIF Inference (RIF 추론에 의한 RDF 권한 충돌 문제 분석)

  • Kim, Jae-Hoon;Lee, Jae-Keun;Kang, Il-Yong;Lee, Yong-Woo;Park, Seog
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06c
    • /
    • pp.1-3
    • /
    • 2012
  • RIF(Rule Interchange Format)는 시맨틱 웹의 구조중 규칙 계층을 담당하며 기존에 사용되고 있는 여러 상이한 규칙 언어들 간의 호환을 위한 표준 규칙 언어라고 할 수 있다. RIF는 W3C에서 승인되었다. 시맨틱웹을 위한 표준 온톨로지 언어로는 RDF와 OWL이 있으며, 최근 RDF 데이터에 대한 접근제어 (Access Control) 메커니즘과 관련하여 일부 학술적 연구가 수행되었다. 본 논문에서는 RDF 데이터와 결합될 수 있는 RIF 추론 규칙에 대해 이미 제안한 RDF 접근제어 메커니즘을 확장하고자 한다. RDF 데이터에 대해 명세된 접근 권한은 RIF 추론에 의하여 권한 충돌이 발생할 수 있고, 그로 인해 접근 권한은 허용되지 않을 수 있다. 본 논문에서는 어떤 조건에서 이러한 RIF 추론에 의한 권한 충돌이 발생하는 지를 분석하며, 이미 제안한 그래프 레이블링을 사용하는 충돌 발견 방법이 RIF 추론과 관련하여서도 효율적임을 보인다. 실험에서는 제안된 방법이, 비록 포함관계 추론에 특화 되었지만, Chase 알고리즘에 기반한 다른 연구에서의 방법보다 발견 시간을 크게 감소시킴을 보인다.

Research on Performance of Graph Algorithm using Deep Learning Technology (딥러닝 기술을 적용한 그래프 알고리즘 성능 연구)

  • Giseop Noh
    • The Journal of the Convergence on Culture Technology
    • /
    • v.10 no.1
    • /
    • pp.471-476
    • /
    • 2024
  • With the spread of various smart devices and computing devices, big data generation is occurring widely. Machine learning is an algorithm that performs reasoning by learning data patterns. Among the various machine learning algorithms, the algorithm that attracts attention is deep learning based on neural networks. Deep learning is achieving rapid performance improvement with the release of various applications. Recently, among deep learning algorithms, attempts to analyze data using graph structures are increasing. In this study, we present a graph generation method for transferring to a deep learning network. This paper proposes a method of generalizing node properties and edge weights in the graph generation process and converting them into a structure for deep learning input by presenting a matricization We present a method of applying a linear transformation matrix that can preserve attribute and weight information in the graph generation process. Finally, we present a deep learning input structure of a general graph and present an approach for performance analysis.

A Naming Technique of the MPEG-4 Object for the Quick Search of the Scene Graph (씬 그래프의 빠른 탐색을 위한 MPEG-4 객체 Naming 기법)

  • 김남영;이숙영;김상욱
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10d
    • /
    • pp.208-210
    • /
    • 2002
  • 재생기에서 MP4 파일을 재생하기 위해서는 Drawing 정보와 Routing 정보가 필요하다. 기존의 저작도구에서의 객체 Naming은 그 객체와는 상관없이 단순히 문자열과 숫자의 조합으로 되어 있고 실제 화면상에 기술되는 객체의 ID값을 부여하는 방법이었다. 객체 Naming을 구현하는 객체 ID 설정이 이러한 방법이었기 때문에 재생기에서 객체 정보를 구하려면 Scene 그래프를 반복해서 검색하는 load가 발생한다. 본 논문에서는 이러한 load를 줄이기 위해서 비트 연산을 이용한 각 객체의 ID를 부여함으로써 각 객체에 속하는 Attribute의 ID가 자신의 실제 객체의 ID를 추론할 수 있는 방법으로 객체에 대한 Naming을 구현하였다. 이러한 객체 Naming 기법으로 설정된 객체의 ID값은 비트 연산과 시프트 연산을 이용해서 객체 정보를 구할 수 있기 때문에 Scene 그래프 탐색 load를 줄일 수 있다.

  • PDF

Korean Fake News Detection with User Graph (사용자 그래프 기반 한국어 가짜뉴스 판별 방법)

  • Kang, MyungHoon;Seo, Jaehyung;Lim, Heuiseok
    • Annual Conference on Human and Language Technology
    • /
    • 2021.10a
    • /
    • pp.97-102
    • /
    • 2021
  • 최근 급격한 정보기술의 발달로 가짜뉴스가 사회문제로 대두되고 있다. 한국어 가짜뉴스 문제를 딥러닝으로 해결하기 위해서 기존의 연구들은 본문 기반의 가짜뉴스 탐지를 진행하였으며 최근에는 기사 본문 외의 보조적 정보를 활용하는 방법으로 연구가 진행되고 있다. 그러나 기존의 방식과 개선된 방식들 모두 적절한 가짜뉴스 탐지 방법을 제시하지 못하여 모델이 산출한 가짜뉴스 표현 벡터의 품질을 보장할 수 없었다. 또한 한국어 가짜뉴스 문제를 해결함에 있어서 적절한 공개 데이터셋 또한 제공되지 않았다. 따라서 본 논문은 한국어 가짜뉴스 탐지 문제에서 독자 반응정보를 추가하여 효과적인 학습을 할 수 있는 '사용자 그래프 기반 한국어 가짜뉴스 판별 방법'과 해당 모델이 적절히 학습할 수 있는 간이 데이터셋 구축 방법을 제안한다.

  • PDF

A Study on the Automatic Synthesis of Signed Directed Graph Using Knowledge-based Approach and Loop Verification (지식 기반 접근법과 Loop 검증을 이용한 부호운향그래프 자동합성에 관한 연구)

  • Lee Sung-gun;An Dae-Myung;Hwang Kyu Suk
    • Journal of the Korean Institute of Gas
    • /
    • v.2 no.1
    • /
    • pp.53-58
    • /
    • 1998
  • By knowledge-based approach, the SDG(Signed Directed Graph) is automatically synthesized, which is commonly used to represent the causal effects between process variables. Automatic synthesis of SDG is progressed by two steps : (1)inference step uses knowledge base and (2)verification step uses Loop-Verifier. First, Topology and Knowledge Base are constructed by using the information on equipment. And then, Primary-SDG is synthesized by Character Pattern Matching between Variable-Relation-Representation generated by using Topology and Variable-Tendency-Data contained in Knowledge Base. Finally, a modified SDG is made after the Primary-SDG is verified by Loop-Verifier.

  • PDF

A Study of SIL Allocation with a Multi-Phase Fuzzy Risk Graph Model (다단계 퍼지 리스크 그래프 모델을 적용한 SIL 할당에 관한 연구)

  • Yang, Heekap;Lee, Jongwoo
    • Journal of the Korean Society for Railway
    • /
    • v.19 no.2
    • /
    • pp.170-186
    • /
    • 2016
  • This paper introduces a multi-phase fuzzy risk graph model, representing a method for determining for SIL values for railway industry systems. The purpose of this paper is to compensate for the shortcomings of qualitative determination, which are associated with input value ambiguity and the subjectivity problem of expert judgement. The multi-phase fuzzy risk graph model has two phases. The first involves the determination of the conventional risk graph input values of the consequence, exposure, avoidance and demand rates using fuzzy theory. For the first step of fuzzification this paper proposes detailed input parameters. The fuzzy inference and the defuzzification results from the first step will be utilized as input parameters for the second step of the fuzzy model. The second step is to determine the safety integrity level and tolerable hazard rate corresponding to be identified hazard in the railway industry. To validate the results of the proposed the multi-phase fuzzy risk graph, it is compared with the results of a safety analysis of a level crossing system in the CENELEC SC 9XA WG A0 report. This model will be adapted for determining safety requirements at the early concept design stages in the railway business.

Knowledge graph-based knowledge map for efficient expression and inference of associated knowledge (연관지식의 효율적인 표현 및 추론이 가능한 지식그래프 기반 지식지도)

  • Yoo, Keedong
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.4
    • /
    • pp.49-71
    • /
    • 2021
  • Users who intend to utilize knowledge to actively solve given problems proceed their jobs with cross- and sequential exploration of associated knowledge related each other in terms of certain criteria, such as content relevance. A knowledge map is the diagram or taxonomy overviewing status of currently managed knowledge in a knowledge-base, and supports users' knowledge exploration based on certain relationships between knowledge. A knowledge map, therefore, must be expressed in a networked form by linking related knowledge based on certain types of relationships, and should be implemented by deploying proper technologies or tools specialized in defining and inferring them. To meet this end, this study suggests a methodology for developing the knowledge graph-based knowledge map using the Graph DB known to exhibit proper functionality in expressing and inferring relationships between entities and their relationships stored in a knowledge-base. Procedures of the proposed methodology are modeling graph data, creating nodes, properties, relationships, and composing knowledge networks by combining identified links between knowledge. Among various Graph DBs, the Neo4j is used in this study for its high credibility and applicability through wide and various application cases. To examine the validity of the proposed methodology, a knowledge graph-based knowledge map is implemented deploying the Graph DB, and a performance comparison test is performed, by applying previous research's data to check whether this study's knowledge map can yield the same level of performance as the previous one did. Previous research's case is concerned with building a process-based knowledge map using the ontology technology, which identifies links between related knowledge based on the sequences of tasks producing or being activated by knowledge. In other words, since a task not only is activated by knowledge as an input but also produces knowledge as an output, input and output knowledge are linked as a flow by the task. Also since a business process is composed of affiliated tasks to fulfill the purpose of the process, the knowledge networks within a business process can be concluded by the sequences of the tasks composing the process. Therefore, using the Neo4j, considered process, task, and knowledge as well as the relationships among them are defined as nodes and relationships so that knowledge links can be identified based on the sequences of tasks. The resultant knowledge network by aggregating identified knowledge links is the knowledge map equipping functionality as a knowledge graph, and therefore its performance needs to be tested whether it meets the level of previous research's validation results. The performance test examines two aspects, the correctness of knowledge links and the possibility of inferring new types of knowledge: the former is examined using 7 questions, and the latter is checked by extracting two new-typed knowledge. As a result, the knowledge map constructed through the proposed methodology has showed the same level of performance as the previous one, and processed knowledge definition as well as knowledge relationship inference in a more efficient manner. Furthermore, comparing to the previous research's ontology-based approach, this study's Graph DB-based approach has also showed more beneficial functionality in intensively managing only the knowledge of interest, dynamically defining knowledge and relationships by reflecting various meanings from situations to purposes, agilely inferring knowledge and relationships through Cypher-based query, and easily creating a new relationship by aggregating existing ones, etc. This study's artifacts can be applied to implement the user-friendly function of knowledge exploration reflecting user's cognitive process toward associated knowledge, and can further underpin the development of an intelligent knowledge-base expanding autonomously through the discovery of new knowledge and their relationships by inference. This study, moreover than these, has an instant effect on implementing the networked knowledge map essential to satisfying contemporary users eagerly excavating the way to find proper knowledge to use.

Inferring Undiscovered Public Knowledge by Using Text Mining-driven Graph Model (텍스트 마이닝 기반의 그래프 모델을 이용한 미발견 공공 지식 추론)

  • Heo, Go Eun;Song, Min
    • Journal of the Korean Society for information Management
    • /
    • v.31 no.1
    • /
    • pp.231-250
    • /
    • 2014
  • Due to the recent development of Information and Communication Technologies (ICT), the amount of research publications has increased exponentially. In response to this rapid growth, the demand of automated text processing methods has risen to deal with massive amount of text data. Biomedical text mining discovering hidden biological meanings and treatments from biomedical literatures becomes a pivotal methodology and it helps medical disciplines reduce the time and cost. Many researchers have conducted literature-based discovery studies to generate new hypotheses. However, existing approaches either require intensive manual process of during the procedures or a semi-automatic procedure to find and select biomedical entities. In addition, they had limitations of showing one dimension that is, the cause-and-effect relationship between two concepts. Thus;this study proposed a novel approach to discover various relationships among source and target concepts and their intermediate concepts by expanding intermediate concepts to multi-levels. This study provided distinct perspectives for literature-based discovery by not only discovering the meaningful relationship among concepts in biomedical literature through graph-based path interference but also being able to generate feasible new hypotheses.