Worcester Polytechnic Institute Electronic Theses and Dissertations Collection

Title page for ETD etd-0902104-163011

Document Typethesis
Author NameStoecker-Sylvia, Zachary
Email Address zackss at gmail.com
TitleMining for Frequent Events in Time Series
DepartmentComputer Science
  • Carolina Ruiz, Advisor
  • Fernando C. Colon Osorio, Reader
  • Keywords
  • envelopes
  • numeric
  • time series
  • events
  • mining
  • Date of Presentation/Defense2004-04-30
    Availability unrestricted


    While much work has been done in mining nominal sequential data much less has been done on mining numeric time series data. This stems primarily from the problems of relating numeric data, which likely contains error or other variations which make directly relating values difficult. To handle this problem, many algorithms first convert data into a sequence of events. In some cases these events are known a priori, but in others they are not. Our work evaluates a set of time series data instances in order to determine likely candidates for unknown underlying events. We use the concept of bounding envelopes to represent the area around a numeric time series in which the unknown noise-free points could exist. We then use an algorithm similar to Apriori to build up sets of envelope intersections. The areas created by these intersections represent common patterns found throughout the data.

  • zstoecker-sylvia.pdf

  • Browse by Author | Browse by Department | Search all available ETDs

    [WPI] [Library] [Home] [Top]

    Questions? Email etd-questions@wpi.edu
    Maintained by webmaster@wpi.edu