Title page for etd-0703116-150911


[Back to Results | New Search]

URN etd-0703116-150911
Author Zhi-Feng Liao
Author's Email Address No Public.
Statistics This thesis had been viewed 5346 times. Download 10 times.
Department Computer Science and Engineering
Year 2016
Semester 2
Degree Master
Type of Document
Language English
Title An Efficient Algorithm for Mining Repeating Patterns
Date of Defense 2016-07-13
Page Count 53
Keyword
  • suffix tree
  • repeating pattern
  • fast mining of repeating patterns
  • data mining
  • repeating-pattern-index
  • Abstract A repeating pattern is composed of identifiable elements that repeat in a predictable manner. In our real life, there are lots of applications such as musical and medical sequences containing valuable repeating patterns. The repeating patterns hidden in sequences might be viewed as implicit knowledge for identification of objects. Hence, how to efficiently and effectively retrieve the valuable repeating patterns has been a hot issue in the last decades. Although a number of studies were proposed to deal with this issue, the performance cannot still earn users' satisfactions if large data are processed. To aim at this issue, in this thesis, we propose an efficient algorithm named Fast Mining of Repeating Patterns (FMRP) that achieves high performance of mining repeating patterns by our designed Quick-Pattern-Index (QPI). This index can provide the proposed FMRP algorithm with an effective support because it contains the information of pattern positions. Without scanning a given sequence iteratively, the repeating patterns can be discovered by only one scan of the sequence. The experimental results reveal that our proposed algorithm performs better than the compared method in finding the repeating patterns.
    Advisory Committee
  • Wen-yang Lin - chair
  • Ming-chao Chiang - co-chair
  • Chun Hao Chen - co-chair
  • Tzung-Pei Hong - advisor
  • Files
  • etd-0703116-150911.pdf
  • Indicate in-campus at 0 year and off-campus access at 3 year.
    Date of Submission 2016-08-18

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys