完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chen, Yi-Cheng | en_US |
dc.contributor.author | Peng, Wen-Chih | en_US |
dc.contributor.author | Lee, Suh-Yin | en_US |
dc.date.accessioned | 2017-04-21T06:48:55Z | - |
dc.date.available | 2017-04-21T06:48:55Z | - |
dc.date.issued | 2016 | en_US |
dc.identifier.isbn | 978-1-5090-2020-1 | en_US |
dc.identifier.issn | 1084-4627 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/135893 | - |
dc.description.abstract | Sequential pattern mining is an important subfield in data mining. Recently, discovering patterns from interval events has attracted considerable efforts due to its widespread applications. However, due to the complex relation between two intervals, mining interval-based sequences efficiently is a challenging issue. In this paper, we develop a novel algorithm, P-TPMiner, to efficiently discover two types of interval-based sequential patterns. Some pruning techniques are proposed to further reduce the search space of the mining process. Experimental studies show that proposed algorithm is efficient and scalable. Furthermore, we apply proposed method to real datasets to demonstrate the practicability of discussed patterns. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | data mining | en_US |
dc.subject | interval-based event | en_US |
dc.subject | representation | en_US |
dc.subject | sequential pattern | en_US |
dc.subject | temporal pattern | en_US |
dc.title | Mining Temporal Patterns in Interval-Based Data | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | 2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE) | en_US |
dc.citation.spage | 1506 | en_US |
dc.citation.epage | 1507 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000382554200174 | en_US |
dc.citation.woscount | 0 | en_US |
顯示於類別: | 會議論文 |