• 検索結果がありません。

JAIST Repository: データマイニング技術を用いたゲノムデータベースの要約手法に関する研究

N/A
N/A
Protected

Academic year: 2021

シェア "JAIST Repository: データマイニング技術を用いたゲノムデータベースの要約手法に関する研究"

Copied!
4
0
0

読み込み中.... (全文を見る)

全文

(1)

Japan Advanced Institute of Science and Technology

JAIST Repository

https://dspace.jaist.ac.jp/ Title データマイニング技術を用いたゲノムデータベースの 要約手法に関する研究 Author(s) 土橋, 潤也 Citation Issue Date 2002-03

Type Thesis or Dissertation

Text version author

URL http://hdl.handle.net/10119/353 Rights

(2)

Research on the Summarization of Entries in

Genome Database using Data Mining Technology

Junya Dobashi

School of Knowledge Science,

Japan Advanced Institute of Science and Technology

March 2002

Keywords: summarization, data mining, association rule discovery, grouping.

Research background and purpose

The University of Kyoto Chemistry Research Institute and The University of Tokyo Medical Science Institute Human Genome Center had been developing an information infrastructure named GenomeNet in order to answer for explosive increasing of data about life. The database services of GenomeNet are aiming at unifying the various knowledge, information and data of biology and medical science on the desktop of each researcher. [1]

There are many kinds of database services in GenomeNet. For example, keyword search, homology search, motif search, and pathway search are representative ones. Though they perform different processing, they are united in returning a set of documents (in genome databases, they are called entries) as a result. So, in case that a user obtained a long list of entries, it is not so easy to understand the meaning of it. Abstractly speaking, it is needed to know ``how a set of entries can be summarized’’.

The Approach

Techniques for summarization have been studied in the research field of natural language processing. However, they could not be directly apply to entries in genome databases since they include various kinds of information besides texts written in natural language (e.g. numerical data, sequence data, structure data, and so on). In this study, we focused on a huge collection of technical terms extracted from genome databases in GenomeNet[2]. Since this collection includes millions of technical terms with their occurrences in databases, it can be Copyright Ⓒ 2002 by Junya Dobashi

(3)

used for characterizing each entry. Then, it is needed to establish the way to know which terms are enough significant to remain as a part of summary of entries. For this purpose, association discovery, which is one of the most popular techniques in data mining, could be available. Using the technique, we can obtain only the technical terms (items) common and specific to the entries in which a user is interested.

Construction of a

prototype

system

A prototype system for summarizing a given set of entries was developed based on the approach above. In addition to a set of entries, the system receives some optional parameters for specifying database name, field name, maximum item combination in associarion rule, and order of priority of significance measures for sorting items. After the summarization, the system returns the following two kinds of information as summaries of specified entries.

A list of significant items sorted by the order of specified measures A table of binary relation between items and entries (truth table) By checking these summaries, a user can grasp the meaning of a set of entries.

Evaluation

Evaluation of the effectiveness of summarization were performed by the experiments using three kinds of sets of entries, that is, result of full-text search, result of homology search, and artificially collected subset of ENZYME database. Through these experiments, the following things were found.

In most cases, the system tends to pick up significant items common and specific to a given set of entries.

If a given set of entries contains many noises, e.g. unwished entries in the result of full-text search, the truth table might not so informative. In other words, it might not include meaningful groups in the set of entries. On the other hand, in case of homology search result and subset of ENZYME, clear groups or subgroups were appeared in truth table. It suggests that the system is useful for summarization and knowledge discovery from a set of entries in which a user is interested.

(4)

References

[1] Database directions of a genome network [the 2nd edition]:Toshihisa Takagi, Minoru Kanehisa,Kyoritsu publisher.

[2] Takuya Yagyuu and Kenji Satou: Toward Automatic Construction of Extensional

Ontology from Genome Databases, Genome Informatics 2000, pp.442-443 (2000).

参照

関連したドキュメント

Answering a question of de la Harpe and Bridson in the Kourovka Notebook, we build the explicit embeddings of the additive group of rational numbers Q in a finitely generated group

In our previous paper [Ban1], we explicitly calculated the p-adic polylogarithm sheaf on the projective line minus three points, and calculated its specializa- tions to the d-th

Applications of msets in Logic Programming languages is found to over- come “computational inefficiency” inherent in otherwise situation, especially in solving a sweep of

Classical definitions of locally complete intersection (l.c.i.) homomor- phisms of commutative rings are limited to maps that are essentially of finite type, or flat.. The

Shi, “The essential norm of a composition operator on the Bloch space in polydiscs,” Chinese Journal of Contemporary Mathematics, vol. Chen, “Weighted composition operators from Fp,

Yin, “Global existence and blow-up phenomena for an integrable two-component Camassa-Holm shallow water system,” Journal of Differential Equations, vol.. Yin, “Global weak

To be specic, let us henceforth suppose that the quasifuchsian surface S con- tains two boundary components, the case of a single boundary component hav- ing been dealt with in [5]

These include the relation between the structure of the mapping class group and invariants of 3–manifolds, the unstable cohomology of the moduli space of curves and Faber’s