WEKO3
アイテム
Indexing Method for Hierarchical Graphs based on Relation among Interlacing Sequences of Eigenvalues
https://ipsj.ixsq.nii.ac.jp/records/113180
https://ipsj.ixsq.nii.ac.jp/records/1131804c38c102-e34b-4ab3-a7ae-436809765a63
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5602035 (336.4 kB)
|
Copyright (c) 2015 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2015-02-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Indexing Method for Hierarchical Graphs based on Relation among Interlacing Sequences of Eigenvalues | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Indexing Method for Hierarchical Graphs based on Relation among Interlacing Sequences of Eigenvalues | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [一般論文] index, hierarchical graph, interlace, eigenvalue | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Graduate School of System Design, Tokyo Metropolitan University | ||||||||||
| 著者所属 | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Graduate School of System Design, Tokyo Metropolitan University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| 著者名 |
Kaoru, Katayama
× Kaoru, Katayama
× ErnestWekeMaina
|
|||||||||
| 著者名(英) |
Kaoru, Katayama
× Kaoru, Katayama
× Ernest, WekeMaina
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | We propose an indexing method for hierarchical graphs using their eigenvalues in order to detect those that are substructures or superstructures of a hierarchical graph given as a query efficiently. The index construction and the query processing are based on a relation among three interlacing sequences of eigenvalues of hierarchical graphs. We also propose a matrix representation for a hierarchical graph. Hierarchical graphs are decomposed to improve the filtering effect of the index and reduce the computational cost of both the index construction and the query processing. We evaluate the effectiveness of the proposed method by experiments. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.23(2015) No.2 (online) ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | We propose an indexing method for hierarchical graphs using their eigenvalues in order to detect those that are substructures or superstructures of a hierarchical graph given as a query efficiently. The index construction and the query processing are based on a relation among three interlacing sequences of eigenvalues of hierarchical graphs. We also propose a matrix representation for a hierarchical graph. Hierarchical graphs are decomposed to improve the filtering effect of the index and reduce the computational cost of both the index construction and the query processing. We evaluate the effectiveness of the proposed method by experiments. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.23(2015) No.2 (online) ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 56, 号 2, 発行日 2015-02-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
