Combining feature spaces for classification

In this paper we offer a variational Bayes approximation to the multinomial probit model for basis expansion and kernel combination. Our model is well-founded within a hierarchical Bayesian framework and is able to instructively combine available sources of information for multinomial classification. The proposed framework enables informative integration of possibly heterogeneous sources in a multitude of ways, from the simple summation of feature expansions to weighted product of kernels, and it is shown to match and in certain cases outperform the well-known ensemble learning approaches of combining individual classifiers. At the same time the approximation reduces considerably the CPU time and resources required with respect to both the ensemble learning methods and the full Markov chain Monte Carlo, Metropolis-Hastings within Gibbs solution of our model. We present our proposed framework together with extensive experimental studies on synthetic and benchmark datasets and also for the first time report a comparison between summation and product of individual kernels as possible different methods for constructing the composite kernel matrix.     

Stable local dimensionality reduction approaches

Dimensionality reduction is a big challenge in many areas. A large number of local approaches, stemming from statistics or geometry, have been developed. However, in practice these local approaches are often in lack of robustness, since in contrast to maximum variance unfolding (MVU), which explicitly unfolds the manifold, they merely characterize local geometry structure. Moreover, the eigenproblems that they encounter, are hard to solve. We propose a unified framework that explicitly unfolds the manifold and reformulate local approaches as the semi-definite programs instead of the above-mentioned eigenproblems. Three well-known algorithms, locally linear embedding (LLE), laplacian eigenmaps (LE) and local tangent space alignment (LTSA) are reinterpreted and improved within this framework. Several experiments are presented to demonstrate the potential of our framework and the improvements of these local algorithms.     

Learning a color distance metric for region-based image segmentation

In this paper we describe an experiment where we studied empirically the application of a learned distance metric to be used as discrimination function for an established color image segmentation algorithm. For this purpose we chose the Mumford–Shah energy functional and the Mahalanobis distance metric. The objective was to test our approach in an objective and quantifiable way on this specific algorithm employing this particular distance model, without making generalization claims. The empirical validation of the results was performed in two experiments: one applying the resulting segmentation method on a subset of the Berkeley Image Database, an exemplar image set possessing ground-truths and validating the results against the ground-truths using two well-known inter-cluster validation methods, namely, the Rand and BGM indexes, and another experiment using images of the same context divided into training and testing set, where the distance metric is learned from the training set and then applied to segment all the images. The obtained results suggest that the use of the specified learned distance metric provides better and more robust segmentations, even if no other modification of the segmentation algorithm is performed.     

Least squares twin support vector machines for pattern classification

In this paper we formulate a least squares version of the recently proposed twin support vector machine (TSVM) for binary classification. This formulation leads to extremely simple and fast algorithm for generating binary classifiers based on two non-parallel hyperplanes. Here we attempt to solve two modified primal problems of TSVM, instead of two dual problems usually solved. We show that the solution of the two modified primal problems reduces to solving just two systems of linear equations as opposed to solving two quadratic programming problems along with two systems of linear equations in TSVM. Classification using nonlinear kernel also leads to systems of linear equations. Our experiments on publicly available datasets indicate that the proposed least squares TSVM has comparable classification accuracy to that of TSVM but with considerably lesser computational time. Since linear least squares TSVM can easily handle large datasets, we further went on to investigate its efficiency for text categorization applications. Computational results demonstrate the effectiveness of the proposed method over linear proximal SVM on all the text corpuses considered.     

Multi-category classifiers and sample width

In a recent paper, the authors introduced the notion of sample width for binary classifiers defined on the set of real numbers. It was shown that the performance of such classifiers could be quantified in terms of this sample width. This paper considers how to adapt the idea of sample width so that it can be applied in cases where the classifiers are multi-category and are defined on some arbitrary metric space.     

Prediction of landslide displacement with controlling factors using extreme learning adaptive neuro-fuzzy inference system (ELANFIS)

Landslide is a major geo-environmental hazard which imparts serious threat to lives and properties. The slope failures are due to adverse inherent geological conditions triggered by an external factor. This paper proposes a new method for the prediction of displacement of step-like landslides, by accounting the controlling factors, using recently proposed extreme learning adaptive neuro-fuzzy inference system (ELANFIS) with empirical mode decomposition (EMD) technique. ELANFIS reduces the computational complexity of conventional ANFIS by incorporating the theoretical idea of extreme learning machines (ELM). The rainfall data and reservoir level elevation data are also integrated into the study. The nonlinear original landslide displacement series, rainfall data, and reservoir level elevation data are first converted into a limited number of intrinsic mode functions (IMF) and one residue. Then decomposed displacement data are predicted by using appropriate ELANFIS model. Final prediction is obtained by the summation of outputs of all ELANFIS sub models. The performance of proposed the technique is tested for the prediction Baishuihe and Shiliushubao landslides. The results show that ELANFIS with EMD model outperforms other methods in terms of generalization performance.     

开放的大学英语网络教学运行环境和模式研究

通过对大学英语网络自主学习运行环境和教学模式的研究,介绍了现有网络学习运行环境包含的各种网络结构、软件架构、学习和考核方法等几个方面,讨论了各种环境因素在实际应用中的优劣与取舍原因,给出了开放教学理念下的网络运行环境研究结果。在研究中能给学生提供充分思考的空间、促进学生在学习中的独立思考和探索精神,进而达到学生素质全面发展的目的。     

高职电子技术课程的兴趣教学法

高职院校学生学习基础相对较差,对于传统的课堂教育难以适应,提出在电子技术教学中实施兴趣教学法,提高学生主动学习的积极性,也有助于提高教学质量。电子技术课实践性强,几乎每堂课都会涉及到实验,这样可以长期在实验室上课或者在教室做演示实验,每次课前教师列一个清单让学生提前到实验室准备好实验器材,学生在准备器材的过程中就会带着疑问：这是做什么用的呢？学生有了疑问就会有学习的好奇心,进而也就激发了对该课程的学习兴趣。     

Admission control for a responsive distributed middleware using decision trees to model run-time parameters

The software in modern systems has become too complex to make accurate predictions about their performance under different configurations. Real-time or even responsiveness requirements cannot be met because it is not possible to perform admission control for new or changing tasks if we cannot tell how their execution affects the other tasks already running. Previously, we proposed a resource-allocation middleware that manages the execution of tasks in a complex distributed system with real-time requirements. The middleware behavior can be modeled depending on the configuration of the tasks running, so that the performance of any given configuration can be calculated. This makes it possible to have admission control in such a system, but the model requires knowledge of run-time parameters. We propose the utilization of machine-learning algorithms to obtain the model parameters, and be able to predict the system performance under any configuration, so that we can provide a full admission control mechanism for complex software systems. In this paper, we present such an admission control mechanism, we measure its accuracy in estimating the parameters of the model, and we evaluate its performance to determine its suitability for a real-time or responsive system.     

健壮性学习算法

使用统计方法可以对汉英机器翻译的词性标注和句法语义分析阶段产生的歧义进行消歧,在估计过程中往往使用最大可能方法,但是并不是在所有的情况下取最大值都是正确的。为了从所有候选结果中取到正确的结果,本文使用健壮性学习算法。使用这个算法,当正确的候选结果评分不是最高时,仍能通过健壮性算法来调整正确结果的评分,使之最大,并且降低不正确候选的评分。而且,由于训练集与测试集存在不同,使训练集中的错误率最小不能保证测试集中的错误率也最小。因此当考虑训练语料库和测试语料库存在统计变化时,应该使用健壮性学习算法。