FDSMO: Frequent DNA Sequence Mining Using FBSB and Optimization

作者: Kuruva Lakshmanna , , Neelu Khare ,

DOI: 10.22266/IJIES2016.1231.17

关键词: Process (computing)Word error rateDNA sequencingRegular expressionSequenceData miningScalabilityPrefixBitmapComputer science

摘要: DNA Sequence mining helps in discovering the patterns which can occur frequently, structures of data sets. Frequent pattern is a central strategy for affiliation guideline discovery, but existing calculations experience ill effects low effectiveness or poor error rate on grounds that natural groupings vary from general successions with more attributes. In our last work, we proposed Prefix Span Group Search Optimization (PSGSO) to optimize mined results method. We propose new method called Mining using (FDSMO) combines Biological based Bitmap (FBSB) and Hybrid Firefly (HFGSO) this paper. The FDSMO process includes three stages: (i) applying (ii) calculate length, width regular expression (iii) optimization HFGSO. exploratory demonstrate performs better than methods, both terms running time scalability.

参考文章(31)
Hisashi Tosaka, Mineichi Kudo, Hiroshi Mamitsuka, Atsuyoshi Nakamura, Ichigaku Takigawa, Mining approximate patterns with frequent locally optimal occurrences Discrete Applied Mathematics. ,vol. 200, pp. 123- 152 ,(2016) , 10.1016/J.DAM.2015.07.002
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Wolfgang Banzhaf, Robert E. Keller, Peter Nordin, Genetic Programming: An Introduction ,(1997)
S. He, Q. H. Wu, J. R. Saunders, A Group Search Optimizer for Neural Network Training Computational Science and Its Applications - ICCSA 2006. pp. 934- 943 ,(2006) , 10.1007/11751595_98
Sanjay Garg, Jatin D. Parmar, Modified web access pattern (mWAP) approach for sequential pattern mining INFOCOMP Journal of Computer Science. ,vol. 6, pp. 46- 54 ,(2015)
Iain D. Couzin, Jens Krause, Nigel R. Franks, Simon A. Levin, Effective leadership and decision-making in animal groups on the move Nature. ,vol. 433, pp. 513- 516 ,(2005) , 10.1038/NATURE03236
George Aloysius, D. Binu, Original Article: An approach to products placement in supermarkets using PrefixSpan algorithm Journal of King Saud University - Computer and Information Sciences archive. ,vol. 25, pp. 77- 87 ,(2013) , 10.1016/J.JKSUCI.2012.07.001
Sushmita Mitra, Tinku Acharya, Data Mining: Multimedia, Soft Computing, and Bioinformatics Journal of Electronic Imaging. ,vol. 15, pp. 019901- ,(2006) , 10.1117/1.2179076
Ke-Chung Lin, I-En Liao, Tsui-Ping Chang, Shu-Fan Lin, A frequent itemset mining algorithm based on the Principle of Inclusion-Exclusion and transaction mapping Information Sciences. ,vol. 276, pp. 278- 289 ,(2014) , 10.1016/J.INS.2014.02.060
F. Masseglia, P. Poncelet, M. Teisseire, Efficient mining of sequential patterns with time constraints: Reducing the combinations Expert Systems With Applications. ,vol. 36, pp. 2677- 2690 ,(2009) , 10.1016/J.ESWA.2008.01.021