Cart (Loading....) | Create Account
Close category search window
 

A Fast Mining and Updating Algorithm for Frequent Patterns on Biological Single Sequence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Liu Wei ; Inst. of Inf. Sci. & Technol., Nanjing Univ. of Aeronaut. & Astronaut., Nanjing, China ; Chen Ling

Traditional Mining Frequent Pattems algorithms will construct lots of projected databases and generate lots of patterns with short length in the process of mining which cause the low efficiency of mining. In order to overcome the shortcomings of traditional algorithms, a fast and efficient algorithm SSPM was proposed. We used longer pattems for mining, which avoided producing lots of patterns with short length. We also used prefix tree of primary patterns for frequent patterns mining and pattern growth which could avoid producing plenty of irrelevant patterns. The experimental results show that SSPM not only improves the performance but also achieves effective mining results.

Published in:

Information Technology and Applications (IFITA), 2010 International Forum on  (Volume:1 )

Date of Conference:

16-18 July 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.