The search functionality is under construction.

The search functionality is under construction.

We present a new method for discovering knowledge from structured data which are represented by graphs in the framework of Inductive Logic Programming. A graph, or network, is widely used for representing relations between various data and expressing a small and easily understandable hypothesis. The analyzing system directly manipulating graphs is useful for knowledge discovery. Our method uses Formal Graph System (FGS) as a knowledge representation language for graph structured data. FGS is a kind of logic programming system which directly deals with graphs just like first order terms. And our method employs a refutably inductive inference algorithm as a learning algorithm. A refutably inductive inference algorithm is a special type of inductive inference algorithm with refutability of hypothesis spaces, and is suitable for knowledge discovery. We give a sufficiently large hypothesis space, the set of weakly reducing FGS programs. And we show that this hypothesis space is refutably inferable from complete data. We have designed and implemented a prototype of a knowledge discovery system KD-FGS, which is based on our method and acquires knowledge directly from graph structured data. Finally we discuss the applicability of our method for graph structured data with experimental results on some graph theoretical notions.

- Publication
- IEICE TRANSACTIONS on Information Vol.E84-D No.1 pp.48-56

- Publication Date
- 2001/01/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- Special Section PAPER (Special Issue on Selected Papers from LA Symposium)

- Category

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Tetsuhiro MIYAHARA, Tomoyuki UCHIDA, Takayoshi SHOUDAI, Tetsuji KUBOYAMA, Kenichi TAKAHASHI, Hiroaki UEDA, "Discovering Knowledge from Graph Structured Data by Using Refutably Inductive Inference of Formal Graph Systems" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 1, pp. 48-56, January 2001, doi: .

Abstract: We present a new method for discovering knowledge from structured data which are represented by graphs in the framework of Inductive Logic Programming. A graph, or network, is widely used for representing relations between various data and expressing a small and easily understandable hypothesis. The analyzing system directly manipulating graphs is useful for knowledge discovery. Our method uses Formal Graph System (FGS) as a knowledge representation language for graph structured data. FGS is a kind of logic programming system which directly deals with graphs just like first order terms. And our method employs a refutably inductive inference algorithm as a learning algorithm. A refutably inductive inference algorithm is a special type of inductive inference algorithm with refutability of hypothesis spaces, and is suitable for knowledge discovery. We give a sufficiently large hypothesis space, the set of weakly reducing FGS programs. And we show that this hypothesis space is refutably inferable from complete data. We have designed and implemented a prototype of a knowledge discovery system KD-FGS, which is based on our method and acquires knowledge directly from graph structured data. Finally we discuss the applicability of our method for graph structured data with experimental results on some graph theoretical notions.

URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_1_48/_p

Copy

@ARTICLE{e84-d_1_48,

author={Tetsuhiro MIYAHARA, Tomoyuki UCHIDA, Takayoshi SHOUDAI, Tetsuji KUBOYAMA, Kenichi TAKAHASHI, Hiroaki UEDA, },

journal={IEICE TRANSACTIONS on Information},

title={Discovering Knowledge from Graph Structured Data by Using Refutably Inductive Inference of Formal Graph Systems},

year={2001},

volume={E84-D},

number={1},

pages={48-56},

abstract={We present a new method for discovering knowledge from structured data which are represented by graphs in the framework of Inductive Logic Programming. A graph, or network, is widely used for representing relations between various data and expressing a small and easily understandable hypothesis. The analyzing system directly manipulating graphs is useful for knowledge discovery. Our method uses Formal Graph System (FGS) as a knowledge representation language for graph structured data. FGS is a kind of logic programming system which directly deals with graphs just like first order terms. And our method employs a refutably inductive inference algorithm as a learning algorithm. A refutably inductive inference algorithm is a special type of inductive inference algorithm with refutability of hypothesis spaces, and is suitable for knowledge discovery. We give a sufficiently large hypothesis space, the set of weakly reducing FGS programs. And we show that this hypothesis space is refutably inferable from complete data. We have designed and implemented a prototype of a knowledge discovery system KD-FGS, which is based on our method and acquires knowledge directly from graph structured data. Finally we discuss the applicability of our method for graph structured data with experimental results on some graph theoretical notions.},

keywords={},

doi={},

ISSN={},

month={January},}

Copy

TY - JOUR

TI - Discovering Knowledge from Graph Structured Data by Using Refutably Inductive Inference of Formal Graph Systems

T2 - IEICE TRANSACTIONS on Information

SP - 48

EP - 56

AU - Tetsuhiro MIYAHARA

AU - Tomoyuki UCHIDA

AU - Takayoshi SHOUDAI

AU - Tetsuji KUBOYAMA

AU - Kenichi TAKAHASHI

AU - Hiroaki UEDA

PY - 2001

DO -

JO - IEICE TRANSACTIONS on Information

SN -

VL - E84-D

IS - 1

JA - IEICE TRANSACTIONS on Information

Y1 - January 2001

AB - We present a new method for discovering knowledge from structured data which are represented by graphs in the framework of Inductive Logic Programming. A graph, or network, is widely used for representing relations between various data and expressing a small and easily understandable hypothesis. The analyzing system directly manipulating graphs is useful for knowledge discovery. Our method uses Formal Graph System (FGS) as a knowledge representation language for graph structured data. FGS is a kind of logic programming system which directly deals with graphs just like first order terms. And our method employs a refutably inductive inference algorithm as a learning algorithm. A refutably inductive inference algorithm is a special type of inductive inference algorithm with refutability of hypothesis spaces, and is suitable for knowledge discovery. We give a sufficiently large hypothesis space, the set of weakly reducing FGS programs. And we show that this hypothesis space is refutably inferable from complete data. We have designed and implemented a prototype of a knowledge discovery system KD-FGS, which is based on our method and acquires knowledge directly from graph structured data. Finally we discuss the applicability of our method for graph structured data with experimental results on some graph theoretical notions.

ER -