• Title/Summary/Keyword: Semantic Graph

Search Result 130, Processing Time 0.023 seconds

Knowledge Conversion between Conceptual Graph Model and Resource Description Framework

  • Kim, Jin-Sung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.1
    • /
    • pp.123-129
    • /
    • 2007
  • On the Semantic Web, the content of the documents must be explicitly represented through metadata in order to enable contents-based inference. In this study, we propose a mechanism to convert the Conceptual Graph (CG) into Resource Description Framework (RDF). Quite a large number or representation languages for representing knowledge on the Web have been established over the last decade. Most of these researches are focused on design of independent knowledge description. On the Semantic Web, however, a knowledge conversion mechanism will be needed to exchange the knowledge used in independent devices. In this study, the CG could give an entire conceptual view of knowledge and RDF can represent that knowledge on the Semantic Web. Then the CG-based object oriented PROLOG could support the natural inference based on that knowledge. Therefore, our proposed knowledge conversion mechanism will be used in the designing of Semantic Web-based knowledge representation and inference systems.

A Natural Language Query Framework for the Semantic Web

  • Kim, Jin-Sung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.1
    • /
    • pp.127-132
    • /
    • 2008
  • This study proposes a Natural Language Query Framework (NLQF) for the semantic web. It supports an intelligent inference at a semantic level. Most of previous researches focused on the knowledge representation on the semantic web. However, to revitalize the intelligent e-business on the semantic web, there is a need for semantic level inference to the web information. To satisfy the need, we will review the knowledge/resource representation on the semantic web such as RDF, Ontology and Conceptual Graph (CG), and then discuss about the natural language (NL) inference. The result of this research could support a natural interface for the semantic web. Furthermore, we expect that the NLQF can be used in the semantic web-based business communications.

Hierarchical Structure in Semantic Networks of Japanese Word Associations

  • Miyake, Maki;Joyce, Terry;Jung, Jae-Young;Akama, Hiroyuki
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 2007.11a
    • /
    • pp.321-329
    • /
    • 2007
  • This paper reports on the application of network analysis approaches to investigate the characteristics of graph representations of Japanese word associations. Two semantic networks are constructed from two separate Japanese word association databases. The basic statistical features of the networks indicate that they have scale-free and small-world properties and that they exhibit hierarchical organization. A graph clustering method is also applied to the networks with the objective of generating hierarchical structures within the semantic networks. The method is shown to be an efficient tool for analyzing large-scale structures within corpora. As a utilization of the network clustering results, we briefly introduce two web-based applications: the first is a search system that highlights various possible relations between words according to association type, while the second is to present the hierarchical architecture of a semantic network. The systems realize dynamic representations of network structures based on the relationships between words and concepts.

  • PDF

Graph-Based Word Sense Disambiguation Using Iterative Approach (반복적 기법을 사용한 그래프 기반 단어 모호성 해소)

  • Kang, Sangwoo
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.13 no.2
    • /
    • pp.102-110
    • /
    • 2017
  • Current word sense disambiguation techniques employ various machine learning-based methods. Various approaches have been proposed to address this problem, including the knowledge base approach. This approach defines the sense of an ambiguous word in accordance with knowledge base information with no training corpus. In unsupervised learning techniques that use a knowledge base approach, graph-based and similarity-based methods have been the main research areas. The graph-based method has the advantage of constructing a semantic graph that delineates all paths between different senses that an ambiguous word may have. However, unnecessary semantic paths may be introduced, thereby increasing the risk of errors. To solve this problem and construct a fine-grained graph, in this paper, we propose a model that iteratively constructs the graph while eliminating unnecessary nodes and edges, i.e., senses and semantic paths. The hybrid similarity estimation model was applied to estimate a more accurate sense in the constructed semantic graph. Because the proposed model uses BabelNet, a multilingual lexical knowledge base, the model is not limited to a specific language.

A Study Nuenal Model of Concept Retrieval (개념 검색의 신경회로망 모델에 관한 연구)

  • Kauh, Yong-Hoon;Park, Sang-Hui
    • Proceedings of the KIEE Conference
    • /
    • 1990.11a
    • /
    • pp.450-456
    • /
    • 1990
  • In this paper, production system is implemented with the inferential neural network model using semantic network and directed graph. Production system can be implemented with the transform of knowledge representation in production system into semantic network and of semantic network into directed graph, because directed graphs can be expressed by neural matrices. A concept node should be defined by the state vector to calculated the concepts expressed by matrices. The expressional ability of neunal network depends on how the state vector is defined. In this study, state vector is overlapped and each overlapping part acts as a inheritant of concept.

  • PDF

Graph-based Segmentation for Scene Understanding of an Autonomous Vehicle in Urban Environments (무인 자동차의 주변 환경 인식을 위한 도시 환경에서의 그래프 기반 물체 분할 방법)

  • Seo, Bo Gil;Choe, Yungeun;Roh, Hyun Chul;Chung, Myung Jin
    • The Journal of Korea Robotics Society
    • /
    • v.9 no.1
    • /
    • pp.1-10
    • /
    • 2014
  • In recent years, the research of 3D mapping technique in urban environments obtained by mobile robots equipped with multiple sensors for recognizing the robot's surroundings is being studied actively. However, the map generated by simple integration of multiple sensors data only gives spatial information to robots. To get a semantic knowledge to help an autonomous mobile robot from the map, the robot has to convert low-level map representations to higher-level ones containing semantic knowledge of a scene. Given a 3D point cloud of an urban scene, this research proposes a method to recognize the objects effectively using 3D graph model for autonomous mobile robots. The proposed method is decomposed into three steps: sequential range data acquisition, normal vector estimation and incremental graph-based segmentation. This method guarantees the both real-time performance and accuracy of recognizing the objects in real urban environments. Also, it can provide plentiful data for classifying the objects. To evaluate a performance of proposed method, computation time and recognition rate of objects are analyzed. Experimental results show that the proposed method has efficiently in understanding the semantic knowledge of an urban environment.

Handling Semantic Ambiguity for Metadata Generation

  • Yang, Gi-Chul;Park, Jeong-Ran
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.10 no.2
    • /
    • pp.1-6
    • /
    • 2018
  • The following research questions are examined in this paper. What hinders quality metadata generation and metadata interoperability? What kind of semantic representation technique can be utilized in order to enhance metadata quality and semantic interoperability? This paper suggests a way of handling semantic ambiguity for metadata generation. The conceptual graph is utilized to disambiguate semantic ambiguities caused by isolation of a metadata element and its corresponding definition from the relevant context. The mechanism introduced in this paper has the potential to alleviate issues dealing with inconsistent metadata application and interoperability across digital collections.

A Semantic Representation Based-on Term Co-occurrence Network and Graph Kernel

  • Noh, Tae-Gil;Park, Seong-Bae;Lee, Sang-Jo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.4
    • /
    • pp.238-246
    • /
    • 2011
  • This paper proposes a new semantic representation and its associated similarity measure. The representation expresses textual context observed in a context of a certain term as a network where nodes are terms and edges are the number of cooccurrences between connected terms. To compare terms represented in networks, a graph kernel is adopted as a similarity measure. The proposed representation has two notable merits compared with previous semantic representations. First, it can process polysemous words in a better way than a vector representation. A network of a polysemous term is regarded as a combination of sub-networks that represent senses and the appropriate sub-network is identified by context before compared by the kernel. Second, the representation permits not only words but also senses or contexts to be represented directly from corresponding set of terms. The validity of the representation and its similarity measure is evaluated with two tasks: synonym test and unsupervised word sense disambiguation. The method performed well and could compete with the state-of-the-art unsupervised methods.

Constructing Ontology based on Korean Parts of Speech and Applying to Vehicle Services (한국어 품사 기반 온톨로지 구축 방법 및 차량 서비스 적용 방안)

  • Cha, Si-Ho;Ryu, Minwoo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.17 no.4
    • /
    • pp.103-108
    • /
    • 2021
  • Knowledge graph is a technology that improves search results by using semantic information based on various resources. Therefore, due to these advantages, the knowledge graph is being defined as one of the core research technologies to provide AI-based services recently. However, in the case of the knowledge graph, since the form of knowledge collected from various service domains is defined as plain text, it is very important to be able to analyze the text and understand its meaning. Recently, various lexical dictionaries have been proposed together with the knowledge graph, but since most lexical dictionaries are defined in a language other than Korean, there is a problem in that the corresponding language dictionary cannot be used when providing a Korean knowledge service. To solve this problem, this paper proposes an ontology based on the parts of speech of Korean. The proposed ontology uses 9 parts of speech in Korean to enable the interpretation of words and their semantic meaning through a semantic connection between word class and word class. We also studied various scenarios to apply the proposed ontology to vehicle services.

Automatic space type classification of architectural BIM models using Graph Convolutional Networks

  • Yu, Youngsu;Lee, Wonbok;Kim, Sihyun;Jeon, Haein;Koo, Bonsang
    • International conference on construction engineering and project management
    • /
    • 2022.06a
    • /
    • pp.752-759
    • /
    • 2022
  • The instantiation of spaces as a discrete entity allows users to utilize BIM models in a wide range of analyses. However, in practice, their utility has been limited as spaces are erroneously entered due to human error and often omitted entirely. Recent studies attempted to automate space allocation using artificial intelligence approaches. However, there has been limited success as most studies focused solely on the use of geometric features to distinguish spaces. In this study, in addition to geometric features, semantic relations between spaces and elements were modeled and used to improve space classification in BIM models. Graph Convolutional Networks (GCN), a deep learning algorithm specifically tailored for learning in graphs, was deployed to classify spaces via a similarity graph that represents the relationships between spaces and their surrounding elements. Results confirmed that accuracy (ACC) was +0.08 higher than the baseline model in which only geometric information was used. Most notably, GCN was able to correctly distinguish spaces with no apparent difference in geometry by discriminating the specific elements that were provided by the similarity graph.

  • PDF