• Title/Summary/Keyword: conceptual graphs

Search Result 21, Processing Time 0.021 seconds

An Efficient Conceptual Clustering Scheme (효율적인 개념 클러스터링 기법)

  • Yang, Gi-Chul
    • Journal of Korea Entertainment Industry Association
    • /
    • v.14 no.4
    • /
    • pp.349-354
    • /
    • 2020
  • This paper, firstly, propose a new Clustering scheme Based on Conceptual graphs (CBC) that can describe objects freely and can perform clustering efficiently. The conceptual clustering is one of machine learning technique. The similarity among the objects in conceptual clustering are decided on the bases of concept membership, unlike the general clustering scheme which decide the similarity without considering the context or environment of the objects. A new conceptual clustering scheme, CBC, which can perform efficient conceptual clustering by describing various objects freely with conceptual graphs is introduced in this paper.

A description of English nominal relatives by conceptual graphs (영어 명사적 관계절의 개념도식에 의한 의미 기술)

  • Cho, Kil-Ho
    • English Language & Literature Teaching
    • /
    • v.9 no.1
    • /
    • pp.173-187
    • /
    • 2003
  • This paper proposes a semantic description of the English nominal relatives with a knowledge representation framework of Conceptual Graphs(CGs), which is a computer-oriented form of interlanguage from the Conceptual Structures Theory. This paper focuses on the difference between definite and universally quantified meaning of nominal relatives, on the compound relative clauses, and also on the difference between nominal relative clauses and interrogative clauses.

  • PDF

A Survey on Functions and Characteristics of Conceptual Graph Tools (개념그래프 도구의 기능 및 특성 조사)

  • Yang, Gi-Chul
    • Journal of Digital Convergence
    • /
    • v.12 no.12
    • /
    • pp.285-292
    • /
    • 2014
  • Intelligent systems are systems that mainly use knowledge rather than data or information. Therefore, knowledge representation is an important factor for intelligent system construction. Conceptual graph is a logical knowledge representation language which has graphical form and it can represent knowledge efficiently. It is, however, cumbersome to use conceptual graphs directly for programming. Various tools were developed to overcome this difficulties. In this paper, we survey on functions and characteristics of conceptual graph tools that can be utilized for constructing intelligent systems by using conceptual graphs. The result of this survey will be very helpful to use conceptual graphs for development of intelligent systems.

Conceptual Graph Matching Method for Reading Comprehension Tests

  • Zhang, Zhi-Chang;Zhang, Yu;Liu, Ting;Li, Sheng
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.4
    • /
    • pp.419-430
    • /
    • 2009
  • Reading comprehension (RC) systems are to understand a given text and return answers in response to questions about the text. Many previous studies extract sentences that are the most similar to questions as answers. However, texts for RC tests are generally short and facts about an event or entity are often expressed in multiple sentences. The answers for some questions might be indirectly presented in the sentences having few overlapping words with the questions. This paper proposes a conceptual graph matching method towards RC tests to extract answer strings. The method first represents the text and questions as conceptual graphs, and then extracts subgraphs for every candidate answer concept from the text graph. All candidate answer concepts will be scored and ranked according to the matching similarity between their sub-graphs and question graph. The top one will be returned as answer seed to form a concise answer string. Since the sub-graphs for candidate answer concepts are not restricted to only covering a single sentence, our approach improved the performance of answer extraction on the Remedia test data.

A Method for Efficient Malicious Code Detection based on the Conceptual Graphs (개념 그래프 기반의 효율적인 악성 코드 탐지 기법)

  • Kim Sung-Suk;Choi Jun-Ho;Bae Young-Geon;Kim Pan-Koo
    • The KIPS Transactions:PartC
    • /
    • v.13C no.1 s.104
    • /
    • pp.45-54
    • /
    • 2006
  • Nowadays, a lot of techniques have been applied for the detection of malicious behavior. However, the current techniques taken into practice are facing with the challenge of much variations of the original malicious behavior, and it is impossible to respond the new forms of behavior appropriately and timely. There are also some limitations can not be solved, such as the error affirmation (positive false) and mistaken obliquity (negative false). With the questions above, we suggest a new method here to improve the current situation. To detect the malicious code, we put forward dealing with the basic source code units through the conceptual graph. Basically, we use conceptual graph to define malicious behavior, and then we are able to compare the similarity relations of the malicious behavior by testing the formalized values which generated by the predefined graphs in the code. In this paper, we show how to make a conceptual graph and propose an efficient method for similarity measure to discern the malicious behavior. As a result of our experiment, we can get more efficient detection rate.

The Effect of Using Graphing Calculators on Students' Understanding Functions and Attitudes Towards Mathematics and Graphing Calculators

  • Kwon, Oh-Nam;Kim, Min-Kyeong
    • Research in Mathematical Education
    • /
    • v.4 no.1
    • /
    • pp.1-22
    • /
    • 2000
  • The purpose of this study was to investigate the effects of using graphing calculators on students' understanding of the linear and quadratic function concepts. The populators of this study are tenth graders at high school in Seoul, one class for the treatment group and another class for the comparison group, and experiment period is 14 weeks including two weeks for school regular exams.Function tests used in the study was proposed which described a conceptual knowledge of functions in terms of the following components: a) Conceptual understanding, b) Interpreting a function in terms of a verbal experission, c) Translating between different representations of functions, and d) Mathematical modeling a real-world situation using functions. Even though the group test means of the individual components of conceptual understanding, interpreting, translating, mathematical modeling did not differ significantly, there is evidence that the two groups differed in their performance on conceptual understanding. It was shown that students learned algebra using graphing calculators view graphs more globally. The attitude survey assessed students' attitudes and perceptions about the value of mathematics, the usefulness of graphs in mathematics, mathematical confidence, mathematics anxiety, and their feelings about calculators. The overall t-test was not statistically significant, but the students in the treatment group showed significantly different levels of anxiety toward mathematics.

  • PDF

Pedagogical Analysis and Discussion about Finding Trigonometric Function Values of General Angles in High School Mathematics (고등학교 일반각의 삼각 함수값 구하기에 대한 교수법적 분석과 논의)

  • Cho, Cheong-Soo
    • Communications of Mathematical Education
    • /
    • v.22 no.3
    • /
    • pp.289-310
    • /
    • 2008
  • The purpose of study is to propose the possibilities of finding trigonometric function values using trigonometric function graphs instead of the unit circle method. And it is to discuss how to enhance relating trigonometric function value finding to graphs construction, and students conceptual understanding of the properties of trigonometric functions. The conclusions of this study are the effectiveness of function value finding using trigonometric function graphs, the use of a precise term of function value finding given general angles, consideration of a link between function value finding and graphs, and the possibility of teaching trigonometric function graphs in advance of function value finding.

  • PDF

A Description of English Relative Clauses With conceptual Structure Theory (개념구조론에 의한 영어 관계절의 기술)

  • KihoCho
    • Korean Journal of Cognitive Science
    • /
    • v.4 no.2
    • /
    • pp.29-51
    • /
    • 1994
  • This paper presents a new approach to describing the meanings of English relative clauses with the theoretical framework of Conceptual Structure Theory (henceforth CST)which builds on the pionerring work of Sowa.And this paper aims at proposing some extensions to his work. CST describes the conceptual structrures of sentences with conceptual graphs(henceforth CG). which have begun to be used as an intermediate language in natural language processing and machine translation of computer.CGs are composed of concept types and conceptual relation types. They are a system of logic for semantic representation of sentences. This paper focuses on showing the differences of the CGs according to the functions of English relative clauses. English relative clauses are divided into restrictive and nonrestrictive uses.And this paper describes a restrictive clause with a CG including a expression.which derives from the viewpoint of Montague-semantics and Nom-S Analysis.This paper deals mainly with the relative clauses of double restroction as an example of restrictive relative clauses.The description of a nonrestrictive relative clause does not need any-expression, for it doesn's involve the meaning of set.And this paper links the CG of an appositive relative clause,which is a kind of nonrestrictive clauses,to the concept of the antecedent in the main clause.The description of a nonrestrictive relative clause with adverbial meaning is strated with two CGs for the main clause and the relative clause.They are linked with an appropriate intersentential conceptual relation type according to the contextual realtions between them.This paper also presents a CG of a sentential relative clause,which gives a comment on the main clause.

Analysis of Prognosis Graphs in Korean Medicine (그래프 기반 한의 예후 분석 - 팔강육음, 기혈진액, 장부 변증을 중심으로 -)

  • Kim, Sang-Kyun;Kim, An Na
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.26 no.6
    • /
    • pp.818-822
    • /
    • 2012
  • We in this paper propose a prognosis graph, analyzing prognoses of each pattern described in the Korean medicine literatures. This graph is represented as the integrated graphs about knowledge of patterns and their transitions in the prognoses, where a node becomes a pattern name and a edge becomes a transition between patterns, along with a condition with respect to cause or mechanism of the pattern. The knowledge of prognoses which a pattern is transit into another pattern can be identified at a glance by using this model. We also construct a upper-level prognosis graph, excluding five viscera and six entrails from the model. This upper-level prognosis graph contains the conceptual knowledge than clinical one so that it may be helpful to students and researchers in the Korean medicine fields.

Modeling Dynamic Business Rules using A Dynamic Knowledge Approach

  • Karami, Nasser;Iijima, Junichi
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.1
    • /
    • pp.72-82
    • /
    • 2007
  • Business Rules are formal statements about the data and processes of an enterprise. They present projections of the organization's constraints and ways of working on their supporting information systems. Therefore, their collection, structuring and organization should be central activities within information systems. In an enterprise, business rules are used to represent certain aspects of a business domain (static rules) or business policy (dynamic rules). Hence, regarding problem domains in the organization, business rules are classified into two groups: static and dynamic business rules. The paper introduces a new concept of business rules, Extended Dynamic Business Rule (EDBR) which contains the results of the occurrence of business rule's action. The focus of this paper is in the organizing, defining and modeling of such business rules using Mineau's approach. Mineau's approach is an extension of Sowa's Conceptual Graph theory.