An Efficient and Fast Algorithm for Mining Frequent Patterns on Multiple Biosequences - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

An Efficient and Fast Algorithm for Mining Frequent Patterns on Multiple Biosequences

Wei Liu
  • Fonction : Auteur
  • PersonId : 1012378
Ling Chen
  • Fonction : Auteur
  • PersonId : 1012379

Résumé

Mining frequent patterns on biosequences is one of the important research fields in biological data mining. Traditional frequent pattern mining algorithms may generate large amount of short candidate patterns in the process of mining which cost more computational time and reduce the efficiency. In order to overcome such shortcoming of the traditional algorithms, we present an algorithm named MSPM for fast mining frequent patterns on biosequences. Based on the concept of primary patterns, the algorithm focuses on longer patterns for mining in order to avoid producing lots of short patterns. Meanwhile by using prefix tree of primary frequent patterns, the algorithm can extend the primary patterns and avoid plenty of irrelevant patterns. Experimental results show that MSPM can achieve mining results efficiently and improves the performance.
Fichier principal
Vignette du fichier
978-3-642-18333-1_22_Chapter.pdf (123.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01559564 , version 1 (10-07-2017)

Licence

Paternité

Identifiants

Citer

Wei Liu, Ling Chen. An Efficient and Fast Algorithm for Mining Frequent Patterns on Multiple Biosequences. 4th Conference on Computer and Computing Technologies in Agriculture (CCTA), Oct 2010, Nanchang, China. pp.178-194, ⟨10.1007/978-3-642-18333-1_22⟩. ⟨hal-01559564⟩
64 Consultations
225 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More