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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01559564
Contributor : Hal Ifip <>
Submitted on : Monday, July 10, 2017 - 5:27:56 PM
Last modification on : Tuesday, July 18, 2017 - 3:30:23 PM
Long-term archiving on : Wednesday, January 24, 2018 - 4:39:12 PM

File

978-3-642-18333-1_22_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

98

Files downloads

144