WEKO3
インデックスリンク
アイテム
A sequential pattern mining algorithm using rough set theory
https://iwate-u.repo.nii.ac.jp/records/10069
https://iwate-u.repo.nii.ac.jp/records/1006993751509-ae97-422b-98b9-c784f5c542a1
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
ijar-v52i6p881-893.pdf (277.3 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2011-09-01 | |||||||||
| タイトル | ||||||||||
| タイトル | A sequential pattern mining algorithm using rough set theory | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | Rough set theory | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | Sequential pattern mining | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | Local patterns | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者 |
Kaneiwa, Ken
× Kaneiwa, Ken
× Kudo, Yasuo
|
|||||||||
| 著者(機関) | ||||||||||
| 値 | Department of Electrical Engineering and Computer Science, Iwate University | |||||||||
| 著者(機関) | ||||||||||
| 値 | College of Information and Systems, Muroran Institute of Technology | |||||||||
| 登録日 | ||||||||||
| 日付 | 2011-09-01 | |||||||||
| 書誌情報 |
International Journal of Approximate Reasoning 巻 52, 号 6, p. 881-893, 発行日 2011-09-01 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 0888-613X | |||||||||
| Abstract | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns in time series data. This task becomes difficult when valuable patterns are locally or implicitly involved in noisy data. In this paper, we propose a method for mining such local patterns from sequences. Using rough set theory, we describe an algorithm for generating decision rules that take into account local patterns for arriving at a particular decision. To apply sequential data to rough set theory, the size of local patterns is specified, allowing a set of sequences to be transformed into a sequential information system. We use the discernibility of decision classes to establish evaluation criteria for the decision rules in the sequential information system. | |||||||||
| 出版者 | ||||||||||
| 出版者 | Elsevier Inc. | |||||||||
| 権利 | ||||||||||
| 権利情報 | Copyright © 2011 Elsevier Inc. All rights reserved. | |||||||||
| DOI | ||||||||||
| 関連タイプ | isVersionOf | |||||||||
| 識別子タイプ | DOI | |||||||||
| 関連識別子 | 10.1016/j.ijar.2011.03.002 | |||||||||
| 著者版フラグ | ||||||||||
| 出版タイプ | AM | |||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||
