| Item type |
Trans(1) |
| 公開日 |
2017-07-19 |
| タイトル |
|
|
タイトル |
Enumeration of Maximally Frequent Ordered Tree Patterns with Wildcards for Edge Labels |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Enumeration of Maximally Frequent Ordered Tree Patterns with Wildcards for Edge Labels |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
主題Scheme |
Other |
|
主題 |
[オリジナル論文] ordered tree pattern, enumeration algorithm, tree structured feature |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Hiroshima City University |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Hiroshima City University |
| 著者所属 |
|
|
|
Faculty of Contemporary Business, Kyushu International University |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Hiroshima City University |
| 著者所属 |
|
|
|
Computer Centre, Gakushuin University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Hiroshima City University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Hiroshima City University |
| 著者所属(英) |
|
|
|
en |
|
|
Faculty of Contemporary Business, Kyushu International University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Hiroshima City University |
| 著者所属(英) |
|
|
|
en |
|
|
Computer Centre, Gakushuin University |
| 著者名 |
Tetsuhiro, Miyahara
Yusuke, Suzuki
Takayoshi, Shoudai
Tomoyuki, Uchida
Tetsuji, Kuboyama
|
| 著者名(英) |
Tetsuhiro, Miyahara
Yusuke, Suzuki
Takayoshi, Shoudai
Tomoyuki, Uchida
Tetsuji, Kuboyama
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
We consider representing tree structured features of structured data which are represented by rooted trees with ordered children. As representations of tree structured features, we use ordered tree patterns, called ordered wildcard tree patterns, which have structures of rooted ordered trees, structured variables and wildcards for edge labels. A structured variable can be replaced with an arbitrary rooted ordered tree. First we show that it is hard to compute two types of optimum frequent ordered wildcard tree patterns. Then we present an algorithm for enumerating all maximally frequent ordered wildcard tree patterns. Finally we consider extended ordered wildcard tree patterns, called ordered tag tree patterns, which have structured variables, wildcards, tags and keywords, and present an algorithm for enumerating all maximally frequent ordered tag tree patterns. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
We consider representing tree structured features of structured data which are represented by rooted trees with ordered children. As representations of tree structured features, we use ordered tree patterns, called ordered wildcard tree patterns, which have structures of rooted ordered trees, structured variables and wildcards for edge labels. A structured variable can be replaced with an arbitrary rooted ordered tree. First we show that it is hard to compute two types of optimum frequent ordered wildcard tree patterns. Then we present an algorithm for enumerating all maximally frequent ordered wildcard tree patterns. Finally we consider extended ordered wildcard tree patterns, called ordered tag tree patterns, which have structured variables, wildcards, tags and keywords, and present an algorithm for enumerating all maximally frequent ordered tag tree patterns. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA11464803 |
| 書誌情報 |
情報処理学会論文誌数理モデル化と応用（TOM）
巻 10,
号 2,
p. 59-69,
発行日 2017-07-19
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
1882-7780 |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-TOM1002008.pdf (1.3 MB)
