KD-FGS: A knowledge discovery system from graph data using formal graph system

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A graph is one of the most common abstract structures and is suitable for representing relations between various objects. The analyzing system directly manipulating graphs is useful for knowledge discovery. Formal Graph System (FGS) is a kind of logic programming system which directly deals with graphs just like first order terms. We have designed and implemented a knowledge discovery system KD-FGS, which receives the graph data and produces a hypothesis by using FGS as a knowledge representation language. The system consists of an FGS interpreter and a refutably inductive inference algorithm for FGSs. We report some experiments of running KD-FGS and confirm that the system is useful for knowledge discovery from graph data.

Cite

CITATION STYLE

APA

Miyahara, T., Uchida, T., Kuboyama, T., Yamamoto, T., Takahashi, K., & Ueda, H. (1999). KD-FGS: A knowledge discovery system from graph data using formal graph system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1574, pp. 438–442). Springer Verlag. https://doi.org/10.1007/3-540-48912-6_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free