期刊文献+

布尔序列的一种KNN改进算法 被引量:3

An Improved KNN Algorithm for Boolean Sequence
原文传递
导出
摘要 布尔序列分类作为一类特殊的分类问题在以往很少被予以专门的研究.本文首先定义布尔序列的属性序化和分片映射的概念,在此基础上提出一种称为序化分片映射(OPM)的降维方法,并将此方法与KNN算法结合提出了一种KNN的改进算法(OPM-KNN).实际数据的实验和分析表明,在降维方面,本文OPM方法与传统PCA方法效果相当,速度有较大提高;在分类方面,本文改进KNN算法与传统的KNN算法相比,分类准确度相当,分类速度增快. As a special classification problem, classification of Boolean sequences is seldom studied. Definitions of the ordering and piecewise mapping are given. And then a dimension-reduction method called ordering and piecewise mapping (OPM) is put forward. Thus an improved KNN algorithm (OPM-KNN) is presented by integrating OPM with KNN. Analytical and experimental results show the speed of OPM method is improved compared with that of traditional PCA algorithm in dimension reduction. As for classification, the accurate rate of OPM-KNN is almost equivalent to the traditional KNN algorithm or appreciably higher than it and the speed is also faster.
出处 《模式识别与人工智能》 EI CSCD 北大核心 2009年第2期330-336,共7页 Pattern Recognition and Artificial Intelligence
基金 国家973计划资助项目(No.2003CB517102)
关键词 布尔序列 序化 分片映射 降维 K-近邻(KNN) 分类 Boolean Sequence, Ordering, Piecewise Mapping, Dimension Reduction, K-Nearest Neighbor (KNN), Classification
  • 相关文献

参考文献22

  • 1Kim K H. Boolean Matrix Theory and Application. New York, USA: Marcel Dekker, 1982
  • 2Gelfand M S, Roytberg M A. Prediction of the Exon-Intron Structure by a Dynamic Programming Approach. Biosystems, 1993, 30 ( 1/2/ 3) : 173 -182
  • 3Pedro A M. Walsh-Fourier Analysis and Its Statistical Applications : Comment. Journal of the American Statistical Association, 1991, 86(414) : 482 -483
  • 4Pique-Regi R, Ortega A, Asgharzadeh S. Sequential Diagonal Linear Discriminant Analysis ( SeqDLDA ) for Microarray Classification and Gene Identification//Proc of the IEEE Workshops and Poster Abstracts on Computational Systems Bioinformatics Conference. Stanford, USA, 2005:112-113
  • 5Selbig J, Mevissen T, Lengauer T. Decision Tree-Based Formation of Consensus Protein Secondary Structure Prediction. Bioinformatics, 1999, 15(12): 1039-1046
  • 6吕锋,张炜玮.4种序列模式挖掘算法的特性研究[J].武汉理工大学学报,2006,28(2):57-60. 被引量:14
  • 7Zhang Chunting, Lin Zhesuai, Yan Ming, et al. A Novel Approach to Distinguish between Intron-Containing and Intronless Genes Based on the Format of Z Curves. Journal of Theoretical Biology, 1998, 192(4) : 467 -473
  • 8Samuel S G, Olga R, Chuong B D, et al. Training Conditional Random Fields for Maximum Labelwise Accuracy [ EB/OL]. [2007 - 09 -01 ]. http://books, nips. cc/nips19.html
  • 9孟大志.DNA序列中的结构与简化模型[J].数学的实践与认识,2001,31(1):54-58. 被引量:4
  • 10Gyllenberg M, Koski T, Verlaan M. Clustering and Quantization of Binary Vectors with Stochastic Complexity// Proc of the IEEE International Symposium on Information Theory. Trondheim, Norway, 1994,Ⅴ: 390 -396

二级参考文献8

  • 1李招远,丁振国.一个基于投影的Web访问序列挖掘算法[J].情报杂志,2004,23(8):59-60. 被引量:3
  • 2王言.基因:讲述生命的故障[M].经济日报出版社,2000,7..
  • 3Agrawal R,Srikant R.Mining Sequential Patterns [A].Proc 1995 Int Conf Data Engineering (ICDE'95)[C].Taipei:IEEE Computer Society,1995.3~14.
  • 4Agrawal R,Srikant R.Mining Sequential Patterns:Generalizationgs and Performance Improvments[A].Proc 5th Int Conf Extending Database Technology (EDBT) [C].Avignon:Lecture Notes in Computer Science,1996.3~17.
  • 5Han Jiawei,Pei Jian.FreeSpan:Frequent Pattern-projected Sequential Pattern Mining[A].Proc 2000 Int Conf Knowledge Discovery and Data Mining (KDD'00)[C].Boston:MAACM Press,2000.355~359.
  • 6Pei Jian,Han Jiawei.Mining Sequential Patterns by Patter-growth:The PrefixSpan Approach[J].IEEE Transactions on Knowledge and Data Engineering,2004,6(10):1~17.
  • 7Han J,Pei J,Yin Y.Mining Frequent Patterns Without Candidate Generation[A].Proc 2000 ACM-SIGMOD Int'l Conf Management of Data (SIGMOD '00)[C].Dallas:TX ACM Press,2000.1~12.
  • 8李松辉,戚昌文,周祖德.企业的客户数据挖掘系统设计[J].武汉理工大学学报,2003,25(9):92-95. 被引量:3

共引文献16

同被引文献38

引证文献3

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部