Discovery of tree structured patterns using Markov chain Monte Carlo method

Yasuhiro Okamoto, Kensuke Koyanagi, Takayoshi Shoudai, Osamu Maruyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A tree contraction pattern (TC-pattern) is an unordered tree-structured pattern which can express a tree-structure common to given unordered trees. A TC-pattern has some special vertices, called contractible vertex, into which every uncommon connected substructure is merged by edge contractions. In this paper, we propose a probabilistic method for computing a binary classification problem on tree-structured data. Given a positive set P and a negative set N of unordered trees with vertex labels on a finite alphabet, the problem is to find meaningful and optimal TC-patterns that classify P and N with high statistical measures. We formalize this problem as a multiple optimization problem, and propose a probabilistic method for computing it by employing enumeration algorithms for TC-patterns and Markov chain Monte Carlo method. In addition, as a theoretical aspect of this problem, we show the hardness of approximability of it. Finally, we show the experimental results of our method on glycan structure data.

Original languageEnglish
Title of host publicationProceedings of the 7th IADIS International Conference Information Systems 2014, IS 2014
PublisherIADIS
Pages95-102
Number of pages8
ISBN (Electronic)9789898704047
Publication statusPublished - Jan 1 2014
Event7th IADIS International Conference on Information Systems, IS 2014 - Madrid, Spain
Duration: Feb 28 2014Mar 2 2014

Other

Other7th IADIS International Conference on Information Systems, IS 2014
CountrySpain
CityMadrid
Period2/28/143/2/14

Fingerprint

Markov processes
Monte Carlo methods
Labels
Hardness

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Information Systems
  • Software
  • Computer Science Applications

Cite this

Okamoto, Y., Koyanagi, K., Shoudai, T., & Maruyama, O. (2014). Discovery of tree structured patterns using Markov chain Monte Carlo method. In Proceedings of the 7th IADIS International Conference Information Systems 2014, IS 2014 (pp. 95-102). IADIS.

Discovery of tree structured patterns using Markov chain Monte Carlo method. / Okamoto, Yasuhiro; Koyanagi, Kensuke; Shoudai, Takayoshi; Maruyama, Osamu.

Proceedings of the 7th IADIS International Conference Information Systems 2014, IS 2014. IADIS, 2014. p. 95-102.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Okamoto, Y, Koyanagi, K, Shoudai, T & Maruyama, O 2014, Discovery of tree structured patterns using Markov chain Monte Carlo method. in Proceedings of the 7th IADIS International Conference Information Systems 2014, IS 2014. IADIS, pp. 95-102, 7th IADIS International Conference on Information Systems, IS 2014, Madrid, Spain, 2/28/14.
Okamoto Y, Koyanagi K, Shoudai T, Maruyama O. Discovery of tree structured patterns using Markov chain Monte Carlo method. In Proceedings of the 7th IADIS International Conference Information Systems 2014, IS 2014. IADIS. 2014. p. 95-102
Okamoto, Yasuhiro ; Koyanagi, Kensuke ; Shoudai, Takayoshi ; Maruyama, Osamu. / Discovery of tree structured patterns using Markov chain Monte Carlo method. Proceedings of the 7th IADIS International Conference Information Systems 2014, IS 2014. IADIS, 2014. pp. 95-102
@inproceedings{e6ae2ed391584172874998daa2acd416,
title = "Discovery of tree structured patterns using Markov chain Monte Carlo method",
abstract = "A tree contraction pattern (TC-pattern) is an unordered tree-structured pattern which can express a tree-structure common to given unordered trees. A TC-pattern has some special vertices, called contractible vertex, into which every uncommon connected substructure is merged by edge contractions. In this paper, we propose a probabilistic method for computing a binary classification problem on tree-structured data. Given a positive set P and a negative set N of unordered trees with vertex labels on a finite alphabet, the problem is to find meaningful and optimal TC-patterns that classify P and N with high statistical measures. We formalize this problem as a multiple optimization problem, and propose a probabilistic method for computing it by employing enumeration algorithms for TC-patterns and Markov chain Monte Carlo method. In addition, as a theoretical aspect of this problem, we show the hardness of approximability of it. Finally, we show the experimental results of our method on glycan structure data.",
author = "Yasuhiro Okamoto and Kensuke Koyanagi and Takayoshi Shoudai and Osamu Maruyama",
year = "2014",
month = "1",
day = "1",
language = "English",
pages = "95--102",
booktitle = "Proceedings of the 7th IADIS International Conference Information Systems 2014, IS 2014",
publisher = "IADIS",

}

TY - GEN

T1 - Discovery of tree structured patterns using Markov chain Monte Carlo method

AU - Okamoto, Yasuhiro

AU - Koyanagi, Kensuke

AU - Shoudai, Takayoshi

AU - Maruyama, Osamu

PY - 2014/1/1

Y1 - 2014/1/1

N2 - A tree contraction pattern (TC-pattern) is an unordered tree-structured pattern which can express a tree-structure common to given unordered trees. A TC-pattern has some special vertices, called contractible vertex, into which every uncommon connected substructure is merged by edge contractions. In this paper, we propose a probabilistic method for computing a binary classification problem on tree-structured data. Given a positive set P and a negative set N of unordered trees with vertex labels on a finite alphabet, the problem is to find meaningful and optimal TC-patterns that classify P and N with high statistical measures. We formalize this problem as a multiple optimization problem, and propose a probabilistic method for computing it by employing enumeration algorithms for TC-patterns and Markov chain Monte Carlo method. In addition, as a theoretical aspect of this problem, we show the hardness of approximability of it. Finally, we show the experimental results of our method on glycan structure data.

AB - A tree contraction pattern (TC-pattern) is an unordered tree-structured pattern which can express a tree-structure common to given unordered trees. A TC-pattern has some special vertices, called contractible vertex, into which every uncommon connected substructure is merged by edge contractions. In this paper, we propose a probabilistic method for computing a binary classification problem on tree-structured data. Given a positive set P and a negative set N of unordered trees with vertex labels on a finite alphabet, the problem is to find meaningful and optimal TC-patterns that classify P and N with high statistical measures. We formalize this problem as a multiple optimization problem, and propose a probabilistic method for computing it by employing enumeration algorithms for TC-patterns and Markov chain Monte Carlo method. In addition, as a theoretical aspect of this problem, we show the hardness of approximability of it. Finally, we show the experimental results of our method on glycan structure data.

UR - http://www.scopus.com/inward/record.url?scp=84944051162&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84944051162&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84944051162

SP - 95

EP - 102

BT - Proceedings of the 7th IADIS International Conference Information Systems 2014, IS 2014

PB - IADIS

ER -