期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
An Improved Heuristic Ant-Clustering Algorithm 被引量:2
1
作者 YunfeiChen YushuLiu JihaiZhao 《计算机工程与应用》 CSCD 北大核心 2004年第29期133-134,158,共3页
An improved heuristic ant-clustering algorithm(HAC)is presented in this paper.A device of ’memory bank’ is proposed,which can bring forth heuristic knowledge guiding ant to move in the bi-dimension grid space.The de... An improved heuristic ant-clustering algorithm(HAC)is presented in this paper.A device of ’memory bank’ is proposed,which can bring forth heuristic knowledge guiding ant to move in the bi-dimension grid space.The device lowers the randomness of ants’ moving and avoids the producing of"un-assigned data object".We have made some experiments on real data sets and synthetic data sets.The results demonstrate that HAC has superiority in misclassification error rate and runtime over the classical algorithm. 展开更多
关键词 蚁群聚类算法 记忆存储体 人工智能 启发式知识引导
在线阅读 下载PDF
An automatic scheme to construct Snort rules from honeypots data 被引量:1
2
作者 LiXiaoyong LiuDongxi 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2005年第2期466-470,共5页
A scheme to construct signatures automatically for Snort from the data captured by honeypots is presented. With this scheme intrusion detection systems can be quickly updated to detect new intrusions soon when happen.... A scheme to construct signatures automatically for Snort from the data captured by honeypots is presented. With this scheme intrusion detection systems can be quickly updated to detect new intrusions soon when happen. The idea is based on the observation that any traffic to and from honeypots represents abnormal activities, so data patterns extracted from these packets can be used by misuse detection system to identify new attacks. The algorithm of constructing rules is discussed. Experiment illustrates the effectiveness of the scheme. 展开更多
关键词 signature constructing intrusion detection SNORT honeypot.
在线阅读 下载PDF
Learning to Predict in Complex Biological Domains
3
作者 Steven Eschrich Nitesh V.Chawla Lawrence O.Hall 《系统仿真学报》 CAS CSCD 2002年第11期1464-1471,共8页
Protein secondary structure prediction and high-throughput drug screen data mining are two important applications in bioinformatics. The data is represented in sparse feature spaces and can be unrepresentative of futu... Protein secondary structure prediction and high-throughput drug screen data mining are two important applications in bioinformatics. The data is represented in sparse feature spaces and can be unrepresentative of future data. There is certainly some noise in the data and there may be significant noise. Supervised learners in this context will display their inherent bias toward certain solutions, generally solutions that fit the training set well. In this paper, we first describe an ensemble approach using subsampling that scales well with dataset size. A sufficient number of ensemble members using subsamples of the data can yield a more accurate classifier than a single classifier using the entire dataset. Experiments on several datasets demonstrate the effectiveness of the approach. We report results from the KDD Cup 2001 drug discovery dataset in which our approach yields a higher weighted accuracy than the winning entry. We then ex-tend our ensemble approach to create an over-generalized classifier for prediction by reducing the individual subsample size. The ensemble strategy using small subsamples has the effect of averaging over a wider range of hypotheses. We show that both protein secondary structure prediction and drug discovery prediction can be improved by the use of over-generalization, specifically through the use of ensembles of small subsamples. 展开更多
关键词 生物信息学 蛋白质再生结构 DNA 系统方法
在线阅读 下载PDF
Distributed genetic algorithm for optimal planar arrays of aperture synthesis telescope
4
作者 贺小箭 唐新怀 +1 位作者 尤晋元 文建国 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2004年第3期419-425,共7页
Sparse arrays of telescopes have a limited (u, v)-plane coverage. In this paper, an optimization method for designing planar arrays of an aperture synthesis telescope is proposed that is based on distributed genetic a... Sparse arrays of telescopes have a limited (u, v)-plane coverage. In this paper, an optimization method for designing planar arrays of an aperture synthesis telescope is proposed that is based on distributed genetic algorithm. This distributed genetic algorithm is implemented on a network of workstations using community communication model. Such an aperture synthesis system performs with imperfection of (u, v) components caused by deviations and(or) some missing baselines. With the maximum (u, v)-plane coverage of this rotation-optimized array, the image of the source reconstructed by inverse Fourier transform is satisfactory. 展开更多
关键词 distributed genetic algorithm optical aperture synthesis optimum planar array (u v) -spectrum sampling.
在线阅读 下载PDF
Hybrid approach for fuzzy system design
5
作者 李映 赵荣椿 +1 位作者 张艳宁 焦李成 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2004年第3期299-303,共5页
A hybrid approach for fuzzy system design based on clustering and a kind of neurofuzzy networks is proposed. An unsupervised clustering technique is firstly used to determine the number of if-then fuzzy rules and gene... A hybrid approach for fuzzy system design based on clustering and a kind of neurofuzzy networks is proposed. An unsupervised clustering technique is firstly used to determine the number of if-then fuzzy rules and generate an initial fuzzy rule base from the given input-output data. Then, a class of neurofuzzy networks is constructed and its weights are tuned so that the obtained fuzzy rule base has a high accuracy. Finally, two examples of function approximation problems are given to illustrate the effectiveness of the proposed approach. 展开更多
关键词 Fuzzy systems design fuzzy rule base CLUSTERING neurofuzzy networks.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部