KD-FGS: A Knowledge Discovery System from Graph Data Using Formal Graph System

Authors:
Tetsuhiro Miyahara;Tomoyuki Uchida;Tetsuji Kuboyama;Tasuya Yamamoto;Kenichi Takayashi;Hiroaki Ueda
Affiliations:
-;-;-;-;-;-
Venue:
PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
Year:
1999

Citing 3
Cited 4

Rich classes inferable from positive data

Information and Computation
Towards a mathematical theory of machine discovery from facts

Theoretical Computer Science - Special issue on algorithmic learning theory
Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp

Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp

Polynomial Time Matching Algorithms for Tree-Like Structured Patterns in Knowledge Discovery

PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
Discovery of Frequent Tree Structured Patterns in Semistructured Web Documents

PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
A New Framework for Discovering Knowledge from Two-Dimensional Structured Data Using Layout Formal Graph System

ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Discovering New Knowledge from Graph Data Using Inductive Logic Programming

ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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.