• DocumentCode
    2083572
  • Title

    The most frequent closed sequence mining

  • Author

    Songram, Panida ; Kaewman, Sasitorn

  • Author_Institution
    Dept. of Comput. Sci., Mahasarakham Univ., Mahasarakham, Thailand
  • fYear
    2010
  • fDate
    16-18 Aug. 2010
  • Firstpage
    213
  • Lastpage
    217
  • Abstract
    Frequent sequence mining is an important data mining task with broad applications. To mine frequent sequences, a minimum support threshold is required as a filter. If a very small support threshold value is given in the mining process, a large number of resulting sequences may be produced. Consequently, users have to find useful sequences from the large number of resulting sequences and make tasks of analyze complicated. To avoid this problem, the most frequent sequences should be mined instead of mining of all frequent sequences because they are always the useful sequences. Therefore, this paper is proposed to mine the most frequent sequences. Moreover, the most frequent sequences are produced in form of closed sequences, called the most frequent closed sequences, to avoid generation of redundant sequences. In addition, an efficient method is presented in this paper for mining the most frequent closed sequences.
  • Keywords
    data mining; data mining task; filter; frequent closed sequence mining; minimum support threshold; closed pattern; data mining; frequent pattern; sequence; top-k;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networked Computing and Advanced Information Management (NCM), 2010 Sixth International Conference on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-7671-8
  • Electronic_ISBN
    978-89-88678-26-8
  • Type

    conf

  • Filename
    5572512