检索结果-南通市图书馆

NEW FEATURE SELECTION METHOD IN MACHINE FAULT DIAGNOSIS

Chinese Journal of Mechanical Engineering 2005年第2期18卷 251-254页

作者： WangXinfeng QiuJing LiuGuanjun collegeofmechatronicsengineeringandautomation NationalUniversityofDefenseTechnologyChangsha410073China

Aiming to deficiency of the filter and wrapper feature selection methods, anew method based on composite method of filter and wrapper method is proposed. First the methodfilters original features to form a feature subset which can meet classification correctness rate,then applies wrapper feature selection method select optimal feature subset. A successful techniquefor solving optimization problems is given by genetic algorithm (GA). GA is applied to the problemof optimal feature selection. The composite method saves computing time several times of the wrappermethod with holding the classification accuracy in data simulation and experiment on bearing faultfeature selection. So this method possesses excellent optimization property, can save more selectiontime, and has the characteristics of high accuracy and high efficiency.

关键词： Feature selection Filter method Wrapper method Composite method Mutualinformation Genetic algorithm (GA)

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Novel Algorithm for Finding Interspersed Repeat Regions

引用

Genomics, Proteomics & Bioinformatics 2004年第3期2卷 184-191页

作者： DongdongLi ZhengzhiWang QingshanNi collegeofmechatronicsengineeringandautomation NationalUniversityofDefenseTechnologyChangsha410073China.

The analysis of repeats in the DNA sequences is an important subject in bioin- formatics. In this paper, we propose a novel projection-assemble algorithm to ?nd unknown interspersed repeats in DNA sequences. The algorithm employs random projection algorithm to obtain a candidate fragment set, and exhaustive search algorithm to search each pair of fragments from the candidate fragment set to ?nd potential linkage, and then assemble them together. The complexity of our projection-assemble algorithm is nearly linear to the length of the genome sequence, and its memory usage is limited by the hardware. We tested our algo- rithm with both simulated data and real biology data, and the results show that our projection-assemble algorithm is e?cient. By means of this algorithm, we found an un-labeled repeat region that occurs ?ve times in Escherichia coli genome, with its length more than 5,000 bp, and a mismatch probability less than 4%.

关键词： repeats random projection assemble

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：