A DSS for integrated distribution of empty and full containers

A DSS integrating empty and full containers transshipment operations is presented, addressing the typically unbalanced export/import containers trading problem. The problem is modeled as a network, where nodes represent customers, leasing companies, harbors and warehouses, while arcs represent transportation routes. The underlying mathematical model operates in stages, first prioritizing and adjusting full containers demands considering available empty containers supplies, and then statically optimizing costs. Transportation routes are registered and dynamically controlled, cyclically, for a given time horizon. The DSS is flexible, allowing several parameters to be configured. Experimental examples using randomly generated parameters were conducted to evaluate the effectiveness of the system.     

Modeling wine preferences by data mining from physicochemical properties

We propose a data mining approach to predict human wine taste preferences that is based on easily available analytical tests at the certification step. A large dataset (when compared to other studies in this domain) is considered, with white and red vinho verde samples (from Portugal). Three regression techniques were applied, under a computationally efficient procedure that performs simultaneous variable and model selection. The support vector machine achieved promising results, outperforming the multiple regression and neural network methods. Such model is useful to support the oenologist wine tasting evaluations and improve wine production. Furthermore, similar techniques can help in target marketing by modeling consumer tastes from niche markets.     

Automatic detection of breast cancers in mammograms using structured support vector machines

Breast cancer is one of the most common cancers diagnosed in women. Large margin classifiers like the support vector machine (SVM) have been reported effective in computer-assisted diagnosis systems for breast cancers. However, since the separating hyperplane determination exclusively relies on support vectors, the SVM is essentially a local classifier and its performance can be further improved. In this work, we introduce a structured SVM model to determine if each mammographic region is normal or cancerous by considering the cluster structures in the training set. The optimization problem in this new model can be solved efficiently by being formulated as one second order cone programming problem. Experimental evaluation is performed on the Digital Database for Screening Mammography (DDSM) dataset. Various types of features, including curvilinear features, texture features, Gabor features, and multi-resolution features, are extracted from the sample images. We then select the salient features using the recursive feature elimination algorithm. The structured SVM achieves better detection performance compared with a well-tested SVM classifier in terms of the area under the ROC curve.     

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.     

基于支持向量机的文本隐写分析

通过对自然文本统计模型和特性的分析,指出隐藏消息后可能对文本统计特性带来的变化,提出基子支持向量机的通用检测算法。将文本的5个基本统计特征量作为分类特征向量,采用支持向量机对自然文本和载密文本进行有效分类检测。实验结果证明,该算法具有较好的适用性和可靠性。     

基于文档空间向量距离的查询扩展

查询扩展是信息检索中优化查询的一种有效方法。在分析几种基于互信息的查询扩展方法的基础上,将检索词在文档空间中的距离引入到互信息计算中,提出基于向量距离的改进互信息的查询扩展方法。实验结果表明,该方法能够有效提高信息检索中的查询效果。     

基于流形学习和SVM的Web文档分类算法

为解决Web文档分类问题,提出一种基于流形学习和SVM的Web文档分类算法。该算法利用流形学习算法LPP对训练集中的高维Web文档空间进行非线性降维,从中找出隐藏在高维观测数据中有意义的低维结构,在降维后的低维特征空间中利用乘性更新规则的优化SVM进行分类预测。实验结果表明该算法以较少的运行时间获得更高的分类准确率。     

佳点集遗传覆盖算法

针对覆盖算法中识别精度与泛化能力之间的一对矛盾,结合佳点集遗传算法思想,提出佳点集遗传覆盖算法。通过在覆盖种群中引入竞争,淘汰不好的覆盖,保留较优的覆盖,减少了覆盖个数和拒识样本个数,从而提高了整体覆盖种群的分类能力。与Lib-SVM、领域覆盖、交叉覆盖的对比实验证明了该算法具有良好的分类识别精度与泛化能力。     

基于先验信息的运动物体分割与跟踪

提出一种基于先验信息的运动物体分割与跟踪算法。该算法假设帧间运动物体颜色直方图和大小等信息是相对不变的,利用动态规划思想最小化当前帧目标物体颜色直方图和大小与已知目标物体颜色直方图和大小信息的差距,从而找到较准确的目标物体轮廓。与梯度向量流算法相比,该算法对初始轮廓的鲁棒性较好,能在复杂的背景中找到物体轮廓。