Paper Abstract and Keywords |
Presentation |
2008-04-18 14:55
Learning Walks from Graphs Junpei Tsutsui, Hiroki Arimura (Hokkaido Univ.) COMP2008-6 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
In this paper, we study the problem of learning an unknown label sequence, called a walk, that is embedded in a collection of vertex-labeled graphs. We present a polynomial time learning algorithm that learns all walks $\pi_*$ from one positive example and using $O(m+n)$ membership queries, where $m = |\pi_*|$ is the size of the walk and $n$ is the size of the positive example, respectively.
Based on prediction preserving reduction, we also show that the prediction problem for the class of walks from positive and negative examples of graphs under both of vertex-non-overlapping and edge-non-overlapping embeddings are as hard as the prediction problem of DNF (disjunctive normal form formulas) from positive and negative examples. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
graph inference / query learning model / membership queries / polynomial time learning / positive examples / / / |
Reference Info. |
IEICE Tech. Rep., vol. 108, no. 11, COMP2008-6, pp. 35-40, April 2008. |
Paper # |
COMP2008-6 |
Date of Issue |
2008-04-11 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2008-6 |
Conference Information |
Committee |
COMP |
Conference Date |
2008-04-18 - 2008-04-18 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Osaka Prefecture University |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2008-04-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Learning Walks from Graphs |
Sub Title (in English) |
|
Keyword(1) |
graph inference |
Keyword(2) |
query learning model |
Keyword(3) |
membership queries |
Keyword(4) |
polynomial time learning |
Keyword(5) |
positive examples |
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Junpei Tsutsui |
1st Author's Affiliation |
Hokkaido University (Hokkaido Univ.) |
2nd Author's Name |
Hiroki Arimura |
2nd Author's Affiliation |
Hokkaido University (Hokkaido Univ.) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2008-04-18 14:55:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2008-6 |
Volume (vol) |
vol.108 |
Number (no) |
no.11 |
Page |
pp.35-40 |
#Pages |
6 |
Date of Issue |
2008-04-11 (COMP) |
|