Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, Yi-Chengen_US
dc.contributor.authorPeng, Wen-Chihen_US
dc.contributor.authorLee, Suh-Yinen_US
dc.date.accessioned2017-04-21T06:48:55Z-
dc.date.available2017-04-21T06:48:55Z-
dc.date.issued2016en_US
dc.identifier.isbn978-1-5090-2020-1en_US
dc.identifier.issn1084-4627en_US
dc.identifier.urihttp://hdl.handle.net/11536/135893-
dc.description.abstractSequential 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.isoen_USen_US
dc.subjectdata miningen_US
dc.subjectinterval-based eventen_US
dc.subjectrepresentationen_US
dc.subjectsequential patternen_US
dc.subjecttemporal patternen_US
dc.titleMining Temporal Patterns in Interval-Based Dataen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE)en_US
dc.citation.spage1506en_US
dc.citation.epage1507en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000382554200174en_US
dc.citation.woscount0en_US
Appears in Collections:Conferences Paper