Efficient bitmap-based indexing of time-based interval sequences
SCIE
SCOPUS
- Title
- Efficient bitmap-based indexing of time-based interval sequences
- Authors
- Roh, JW; Hwang, SW; Yi, BK
- Date Issued
- 2012-07-01
- Publisher
- ELSEVIER SCIENCE INC
- Abstract
- In this paper, we discuss similarity searches for time series data represented as interval sequences. For instance, the time series of phone call records can be represented by time-based interval sequences, or T-interval sequences, which consist of the start and end times of the call records. To support an efficient similarity search for such sequences, we address the desirable semantics for similarity measures for the T-interval sequences, observe how existing measures fail to address such semantics, and propose a new measure that satisfies all our semantics. We then propose approximate encoding methods for T-interval sequences. More specifically, we propose two bitmap-based feature extraction methods: (1) a bin-bitmap encoding method that transforms the T-interval sequences into bitmaps affixed length, and (2) a segmented feature extraction method that takes the longest bitmap sequences of consecutive '1' elements. Finally, we propose two query processing schemes using these bitmap-based approximate representations. We validate the efficiency and effectiveness of our proposed solutions empirically. (C) 2011 Elsevier Inc. All rights reserved.
- Keywords
- T-interval sequences; Similarity search; Bitmap-based feature extraction; Indexing and approximate query processing; TEMPORAL PATTERNS; DATABASES
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/15928
- DOI
- 10.1016/J.INS.2011.08.013
- ISSN
- 0020-0255
- Article Type
- Article
- Citation
- INFORMATION SCIENCES, vol. 194, page. 38 - 56, 2012-07-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.