HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [24 references]  Display  Hide  Download

Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Monday, July 10, 2017 - 5:27:56 PM
Last modification on : Thursday, March 5, 2020 - 5:42:04 PM
Long-term archiving on: : Wednesday, January 24, 2018 - 4:39:12 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads