BOOKS
BOOK SERIES
JOURNALS
PROCEEDINGS
TEACHING CASES
PAY-PER-VIEW
REFERENCE
E-RESOURCES
ABOUT IGI
BECOME AN AUTHOR/EDITOR  |   MAILING LIST  |   HOW TO ORDER  |   LIBRARY SUGGESTION | EXAMINATION REQUESTS/COURSE ADOPTION | DISTRIBUTORS
IGI Online Bookstore
Click here to PLAY Demo Click here to Start Search Search 30,000+ chapters, articles, and cases - available for download today!

IGI Global Online Symposium!



  Browse Our Bookstore
IGI Catalogs & Newsletters
Forthcoming Titles
Featured Book
By Category
Advanced Search

  Shop
My Profile
View My Cart

  Contact Us
IGI Global
Main Office
701 E. Chocolate Avenue
Hershey, PA 17033, USA
Tel: 717-533-8845 x100
Toll Free: 1-866-342-6657
Fax: 717-533-8661
    or 717-533-7115
 

A Single Pass Algorithm for Discovering Significant Intervals in Time-Series Data:
Our Price:    $30.00 US
Article #:    ITJ3769
Number of pages:    28-44 pages
Source:    International Journal of Data Warehousing and Mining, Vol. 3, Issue 3
Author(s):    Savla, Sagar; Chakravarthy, Sharma
Affiliation(s):    The University of Texas at Arlington, USA; The University of Texas at Arlington, USA

Order Now! This document will be delivered electronically. Terms of Delivery
 

Description
Sensor-based applications, such as smart homes, require prediction of event occurrences for automating the environment using time-series data collected over a period of time. In these applications, it is important to predict events in tight and accurate intervals to effectively automate the application. This article deals with the discovery of significant intervals from time-series data. Although there is a considerable body of work on sequential mining of transactional data, most of them deal with time-point data and make several passes over the entire data set in order to discover frequently occurring patterns/events. We propose an approach in which significant intervals representing intrinsic nature of data are discovered in a single pass. In our approach, time-series data is folded over a periodicity (day, week, etc.) in which the intervals are formed. Significant intervals are discovered from this interval data that satisfy the criteria of minimum confidence and maximum interval length specified by the user. Both compression and working with intervals contribute towards improving the efficiency of the algorithm. In this article, we present a new single-pass algorithm for detecting significant intervals; discuss its characteristics, advantages, and disadvantages; and analyze it. Finally, we compare the performance of our algorithm with previously developed level-wise and SQL-based algorithms for significant interval discovery (SID).

 
Books  |  Book Series  |  Journals  |  Proceedings  |  Teaching Cases  |  Pay-Per-View  |  Reference  |  E-Resources  |  About IGI
Become An Author/Editor  |  Mailing List  |  How To Order  |  Library Suggestion  |  Examination Requests

IGI Global - All Rights Reserved ©2001-2010