降维方法监督分类的比较研究

对ISOMap、LDA、LLE、PCA这4种典型降维算法的主要思想和算法步骤进行了详细分析,并将它们用于有监督分类。从实验结果分析得到结论 ,其可为有监督分类提供有益的借鉴。     

酚醛胺(T-31)环氧树脂固化剂之浅谈

介绍了酚醛胺(T-31)系列环氧固化剂及原料的现状和特点,并对酚醛胺(T-31)系列环氧固化剂进行了分代,阐述了第三代酚醛胺(T-31)系列环氧固化剂的系列化、专用化、高档化。预测和展望了2005年的需求和方向。     

基于数据密度的半监督自训练分类算法

在实际的分类任务中,无标记样本数量充足而有标记样本数量稀少的情况经常出现,目前处理这种情况的常用方法是半监督自训练分类算法。提出了一种基于数据密度的半监督自训练分类算法,该算法首先依据数据的密度对数据集进行划分,从而确定数据的空间结构;然后再按照数据的空间结构对分类器进行自训练的迭代,最终得到一个新的分类器。在UCI中6个数据集上的实验结果表明,与三种监督学习算法以及其分别对应的自训练版本相比,提出的算法分类效果更好。     

Multi-label core vector machine with a zero label

Multi-label core vector machine (Rank-CVM) is an efficient and effective algorithm for multi-label classification. But there still exist two aspects to be improved: reducing training and testing computational costs further, and detecting relevant labels effectively. In this paper, we extend Rank-CVM via adding a zero label to construct its variant with a zero label, i.e., Rank-CVMz, which is formulated as the same quadratic programming form with a unit simplex constraint and non-negative ones as Rank-CVM, and then is solved by Frank–Wolfe method efficiently. Attractively, our Rank-CVMz has fewer variables to be solved than Rank-CVM, which speeds up training procedure dramatically. Further, the relevant labels are effectively detected by the zero label. Experimental results on 12 benchmark data sets demonstrate that our method achieves a competitive performance, compared with six existing multi-label algorithms according to six indicative instance-based measures. Moreover, on the average, our Rank-CVMz runs 83 times faster and has slightly fewer support vectors than its origin Rank-CVM.     

计算机编程语言与输入设备的发展问题初探

现代化建设事业的发展离不开计算机水平的提高。计算机编程语言作为人与机器沟通的桥梁,在计算机系统里有着非常重要的地位。本文从探讨计算机编程语言的概念出发,详细阐述了计算机编程语言所包含的内容和基本分类。接着笔者又深入分析了计算机输入设备的发展问题。最后,针对计算机编程语言和输入之间的联系问题,笔者做了观点性和理论性的论述分析。     

基于PCA-Logistic模型的围岩稳定性分类研究

为了建立易于理解和应用的围岩稳定性分类模型,采用主成分分析法对围岩样本数据进行降维处理,以Logistic模型来描述围岩稳定性影响因素与围岩稳定性之间的经验关系。选取影响围岩分类的5个主要因素,根据分类标准,采用在每级标准中随机内插的方法,得到100个标准样本,用于建立PCA-Logistic模型。分析结果显示,PCA-Logistic模型拟合效果良好,对工程实例的预测结果同投影寻踪模型和分形-插值模型完全一致,表明该模型在围岩稳定性评价中具有可行性和有效性。     

计算机内存的优化及管理浅析

信息总量、网络浏览人数以及人们对网络享受需求的增加,促使着信息制作水平的提高,制作水平的提高在给人们带来了更好的视觉和听觉享受的同时,也对计算机的硬件系统提出了巨大的考验.计算机内存作为计算机硬件系统的重要组成部分,能否对内存做好合理的划分,对计算机的体验具有重要的意义.     

Supervised classification of share price trends

Share price trends can be recognized by using data clustering methods. However, the accuracy of these methods may be rather low. This paper presents a novel supervised classification scheme for the recognition and prediction of share price trends. We first produce a smooth time series using zero-phase filtering and singular spectrum analysis from the original share price data. We train pattern classifiers using the classification results of both original and filtered time series and then use these classifiers to predict the future share price trends. Experiment results obtained from both synthetic data and real share prices show that the proposed method is effective and outperforms the well-known K-means clustering algorithm.     

基于概念的形状分类与识别

基于内容的图像检索已经成为图像检索的一个重要研究方向。其中利用形状特征可以实现形状较为明显的各类图像库的检索。该文对图像形状特征的提取和描述方法进行了较深入地研究,选取其中一部分特征值,分别利用BP神经网络和支持向量机进行形状识别,取得令人满意的实验效果。     

Hierarchical classification of protein function with ensembles of rules and particle swarm optimisation

This paper focuses on hierarchical classification problems where the classes to be predicted are organized in the form of a tree. The standard top-down divide and conquer approach for hierarchical classification consists of building a hierarchy of classifiers where a classifier is built for each internal (non-leaf) node in the class tree. Each classifier discriminates only between its child classes. After the tree of classifiers is built, the system uses them to classify test examples one class level at a time, so that when the example is assigned a class at a given level, only the child classes need to be considered at the next level. This approach has the drawback that, if a test example is misclassified at a certain class level, it will be misclassified at deeper levels too. In this paper we propose hierarchical classification methods to mitigate this drawback. More precisely, we propose a method called hierarchical ensemble of hierarchical rule sets (HEHRS), where different ensembles are built at different levels in the class tree and each ensemble consists of different rule sets built from training examples at different levels of the class tree. We also use a particle swarm optimisation (PSO) algorithm to optimise the rule weights used by HEHRS to combine the predictions of different rules into a class to be assigned to a given test example. In addition, we propose a variant of a method to mitigate the aforementioned drawback of top-down classification. These three types of methods are compared against the standard top-down hierarchical classification method in six challenging bioinformatics datasets, involving the prediction of protein function. Overall HEHRS with the rule weights optimised by the PSO algorithm obtains the best predictive accuracy out of the four types of hierarchical classification method.