| Item type |
SIG Technical Reports(1) |
| 公開日 |
2015-09-22 |
| タイトル |
|
|
タイトル |
Periodic Pattern Mining with Periodical Co-occurrences of Symbols |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Periodic Pattern Mining with Periodical Co-occurrences of Symbols |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Kyoto University／Japan Society for the Promotion of Science |
| 著者所属 |
|
|
|
Kyoto University |
| 著者所属(英) |
|
|
|
en |
|
|
Kyoto University / Japan Society for the Promotion of Science |
| 著者所属(英) |
|
|
|
en |
|
|
Kyoto University |
| 著者名 |
Keisuke, Otaki
Akihiro, Yamamoto
|
| 著者名(英) |
Keisuke, Otaki
Akihiro, Yamamoto
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Finding periodic regularity in sequential databases is an important topic in Knowledge Discovery and in pattern mining such regularity is modeled as periodic patterns. Although efficient enumeration algorithms have been studied, applying them to real databases is still challenging because they are noisy and most transactions are not extremely frequent in practice. They cause a combinatorial explosion of patterns and the difficulty of tuning a threshold parameter. To overcome these issues we provide a novel pre-processing method called skeletonization, which was recently introduced for finding sequential patterns. It tries to find clusters of symbols in patterns, aiming at shrinking the space of all possible patterns in order to avoid the combinatorial explosion by considering co-occurrences of symbols. Although the original method cannot allow for periods, we generalize it by using the periodicity. We give experimental results using both synthetic and real datasets to show the effectiveness of our approach, and compare results of mining with and without the skeletonization to see that our method is helpful for mining comprehensive patterns. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Finding periodic regularity in sequential databases is an important topic in Knowledge Discovery and in pattern mining such regularity is modeled as periodic patterns. Although efficient enumeration algorithms have been studied, applying them to real databases is still challenging because they are noisy and most transactions are not extremely frequent in practice. They cause a combinatorial explosion of patterns and the difficulty of tuning a threshold parameter. To overcome these issues we provide a novel pre-processing method called skeletonization, which was recently introduced for finding sequential patterns. It tries to find clusters of symbols in patterns, aiming at shrinking the space of all possible patterns in order to avoid the combinatorial explosion by considering co-occurrences of symbols. Although the original method cannot allow for periods, we generalize it by using the periodicity. We give experimental results using both synthetic and real datasets to show the effectiveness of our approach, and compare results of mining with and without the skeletonization to see that our method is helpful for mining comprehensive patterns. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN10505667 |
| 書誌情報 |
研究報告数理モデル化と問題解決（MPS）
巻 2015-MPS-105,
号 7,
p. 1-6,
発行日 2015-09-22
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8833 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-MPS15105007.pdf (1.6 MB)
