一种基于投票机制的代表点选择算法

代表点选择是面向数据挖掘与模式识别的数据预处理的重要内容之一，是提高分类器分类正确率和执行效率的重要途径。提出了一种基于投票机制的代表点选择算法，该算法能使所得到的代表点尽可能分布在类别边界上，且投票选择机制易于排除异常点，减少数据量，从而有利于提高最近邻分类器的分类精度和效率。通过与多个经典的代表点选择算法的实验比较分析，表明所提出的基于投票机制的代表点选择算法在提高最近邻分类器分类精度和数据降低率上都具有一定的优势。     

New rank methods for reducing the size of the training set using the nearest neighbor rule

Some new rank methods to select the best prototypes from a training set are proposed in this paper in order to establish its size according to an external parameter, while maintaining the classification accuracy. The traditional methods that filter the training set in a classification task like editing or condensing have some rules that apply to the set in order to remove outliers or keep some prototypes that help in the classification. In our approach, new voting methods are proposed to compute the prototype probability and help to classify correctly a new sample. This probability is the key to sorting the training set out, so a relevance factor from 0 to 1 is used to select the best candidates for each class whose accumulated probabilities are less than that parameter. This approach makes it possible to select the number of prototypes necessary to maintain or even increase the classification accuracy. The results obtained in different high dimensional databases show that these methods maintain the final error rate while reducing the size of the training set.     

基于CURE聚类算法改进的原型选择算法

针对传统K近邻分类器在大规模数据集中存在时间和空间复杂度过高的问题,可采取原型选择的方法进行处理,即从原始数据集中挑选出代表原型（样例）进行K近邻分类而不降低其分类准确率.本文在CURE聚类算法的基础上,针对CURE的噪声点不易确定及代表点分散性差的特点,利用共享邻居密度度量给出了一种去噪方法和使用最大最小距离选取代表点进行改进,从而提出了一种新的原型选择算法PSCURE （improved prototype selection algorithm based on CURE algorithm）.基于UCI数据集进行实验,结果表明：提出的PSCURE原型选择算法与相关原型算法相比,不仅能筛选出较少的原型,而且可获得较高的分类准确率.     

Learning prototypes and distances: A prototype reduction technique based on nearest neighbor error minimization

A prototype reduction algorithm is proposed, which simultaneously trains both a reduced set of prototypes and a suitable local metric for these prototypes. Starting with an initial selection of a small number of prototypes, it iteratively adjusts both the position (features) of these prototypes and the corresponding local-metric weights. The resulting prototypes/metric combination minimizes a suitable estimation of the classification error probability. Good performance of this algorithm is assessed through experiments with a number of benchmark data sets and with a real task consisting in the verification of images of human faces.     

基于哈希学习的投票样例选择算法

随着数据的海量型增长，如何存储并利用数据成为目前学术研究和工业应用等方面的热门问题。样例选择是解决此类问题的方法之一，它在原始数据中依据既定规则选出代表性的样例，从而有效地降低后续工作的难度。基于此，提出一种基于哈希学习的投票样例选择算法。首先通过主成分分析（PCA）方法将高维数据映射到低维空间；然后利用k-means算法结合矢量量化方法进行迭代运算，并将数据用聚类中心的哈希码表示；接着将分类后的数据按比例进行随机选择，在多次独立运行算法后投票选择出最终的样例。与压缩近邻（CNN）算法和大数据线性复杂度样例选择算法LSH-IS-F相比，所提算法在压缩比方面平均提升了19%。所提算法思想简单容易实现，能够通过调节参数自主控制压缩比。在7个数据集上的实验结果显示所提算法在测试精度相似的情况下在压缩比和运行时间方面较随机哈希有较大优势。     

Optimising Perceived Distortion in Lossy Encoding of Dynamic Meshes

Development of geometry data compression techniques in the past years has been limited by the lack of a metric with proven correlation with human perception of mesh distortion. Many algorithms have been proposed, but usually the aim has been to minimise mean squared error, or some of its derivatives. In the field of dynamic mesh compression, the situation has changed with the recent proposal of the STED metric, which has been shown to capture the human perception of mesh distortion much better than previous metrics. In this paper we show how existing algorithms can be steered to provide optimal results with respect to this metric, and we propose a novel dynamic mesh compression algorithm, based on trajectory space PCA and Laplacian coordinates, specifically designed to minimise the newly proposed STED error. Our experiments show that using the proposed algorithm, we were able to reduce the required data rate by up to 50% while preserving the introduced STED error.     

CCD-Camera Based Optical Beacon Tracking for Virtual and Augmented Reality

We introduce a scheme for optical beacon tracking using two CCD-cameras and LED beacons. Due to the sub-pixel accuracy of the beacon detection algorithm a very high precision can be achieved so that the tracking method is suitable for augmented reality applications. We describe the assembly of the equipment needed for the whole tracking system, the behavior of LED-beacons, and how three beacons can be combined to form a 6-DOF tracker. A report on our accuracy evaluation and its results are given. Furthermore we describe two application prototypes in which the tracker was incorporated and tested.     

Local Averaging of Ensembles of LVQ-Based Nearest Neighbor Classifiers

Ensemble learning is a well-established method for improving the generalization performance of learning machines. The idea is to combine a number of learning systems that have been trained in the same task. However, since all the members of the ensemble are operating at the same time, large amounts of memory and long execution times are needed, limiting its practical application. This paper presents a new method (called local averaging) in the context of nearest neighbor (NN) classifiers that generates a classifier from the ensemble with the same complexity as the individual members. Once a collection of prototypes is generated from different learning sessions using a Kohonen's LVQ algorithm, a single set of prototypes is computed by applying a cluster algorithm (such as K-means) to this collection. Local averaging can be viewed either as a technique to reduce the variance of the prototypes or as the result of averaging a series of particular bootstrap replicates. Experimental results using several classification problems confirm the utility of the method and show that local averaging can compute a single classifier that achieves a similar (or even better) accuracy than ensembles generated with voting.     

基于IFS块的快速图象编码算法

文中首先叙述了目前分形块编码研究领域大致情况，然后，提出了一种新的快速编码算法，用Ｌ１距离替换了以往算法所用的Ｌ２距离，把匹配过程转换成类似于矢量量化的搜索过程，因而采纳了许多矢量量化的加速算法，还讨论了以平坦区的处理并提出了新的剖分方法，取得了较好的效果，同其它的分形块编码方法相比，该算法大大缩短了编码时间，改善了压缩图象的质量，特别是它能较大程度地消除块效应，压缩比也有了进一步的提高。     

MOPG: a multi-objective evolutionary algorithm for prototype generation

Prototype generation deals with the problem of generating a small set of instances, from a large data set, to be used by KNN for classification. The two key aspects to consider when developing a prototype generation method are: (1) the generalization performance of a KNN classifier when using the prototypes; and (2) the amount of data set reduction, as given by the number of prototypes. Both factors are in conflict because, in general, maximizing data set reduction implies decreasing accuracy and viceversa. Therefore, this problem can be naturally approached with multi-objective optimization techniques. This paper introduces a novel multi-objective evolutionary algorithm for prototype generation where the objectives are precisely the amount of reduction and an estimate of generalization performance achieved by the selected prototypes. Through a comprehensive experimental study we show that the proposed approach outperforms most of the prototype generation methods that have been proposed so far. Specifically, the proposed approach obtains prototypes that offer a better tradeoff between accuracy and reduction than alternative methodologies.     

基于异常值的拟态裁决优化方法

针对拟态裁决器多数一致性表决算法的优化方法,提出用异常检测的方法直接量化数据可靠性来提升表决正确率.基于异常值的表决算法,通过构建拟态系统异构执行体输出数据集和训练深度学习异常检测模型量化了执行体输出数据异常值;使用权值优化算法优化加权分配,在表决时选择最优加权结果作为表决输出结果.实验结果表明,该方法能够提升拟态裁决器的表决输出正确率,具有一定共模逃逸检测能力,提升了系统的安全性和可靠性.     

二维解析张量投票算法研究

针对传统张量投票(Tensor voting)算法计算过程复杂、算法效率低的问题, 本文提出了一种二维解析张量投票算法.首先, 深入分析张量投票理论的基本思想, 分析传统张量投票算法的不足及其根源; 其次, 设计了一种二维解析棒张量投票新机制, 实现了二维解析棒张量投票的直接求取; 在此基础上, 利用二维解析棒张量投票不依赖参考坐标系的特性, 设计并求解了二维解析球张量投票表达式, 解决了长期困扰张量投票理论中球张量投票无法解析求解, 仅能通过迭代数值计算, 计算过程复杂、算法效率低、算法精度与算法效率存在矛盾的难题.最后, 通过仿真分析和对比实验验证了本文算法在精度和计算效率方面的性能均优于传统张量投票算法.     

基于Markov逻辑网的两阶段数据冲突解决方法

在数据集成中,如何准确地解决数据冲突是关系集成数据质量的关键问题.现有的方法主要针对单个属性进行冲突解决,由于没有区分不同属性的冲突程度,也没有考虑不同属性间冲突解决的相互影响,导致数据冲突解决的准确率不高.针对现有方法存在的不足,文中提出一种基于Markov逻辑网的两阶段数据冲突解决方法.该方法可以根据冲突程度对属性进行划分,并分两阶段进行处理:(1)在第1阶段,对于弱冲突属性,利用投票规则及事实之间相互印证等简单规则进行冲突解决;(2)在第2阶段,利用了第1阶段冲突解决的结果,在规则中加入数据源与事实之间的相互影响规则、数据源之间相互依赖规则及弱冲突属性对强冲突属性影响规则,对强冲突属性进行冲突解决.通过在大量真实数据上的实验结果证明,该方法能够有效地解决集成数据的冲突问题,具有较高的准确率.     

边界特征保持的网格模型分级二次误差简化算法

在参考张量投票理论的基础上,结合二次误差简化算法,提出一种边界特征保持的几何网格模型分级二次误差简化算法.首先根据张量投票理论对三角网格顶点进行面点、边点、角点类型分类;然后对各边对按照二次误差简化算法进行边折叠代价计算;再将分类顶点按照设定的等级权重加入边对折叠代价中,从而保证渐进式简化过程中能够对顶点进行分级简化.实验结果表明,该算法不但能实现渐进简化,而且能按需保留模型的整体特征和细节特征.     

一种面向表情识别的ROI区域二级投票机制

针对如何更有效地使用卷积神经网络从训练图像中学习到的分布式特征进行研究,提出了一种面向人脸表情识别的ROI区域二级投票机制。将图像划分成一系列感兴趣区域（ROI）图像输入到卷积神经网络中进行训练;然后将测试图像的ROI图像输入到卷积神经网络中,统计所有ROI图像的判别结果;最后采用二级投票机制确定测试图像的最终类别,得到最终判别结果。针对卷积神经网络不能从人脸图像中学习到旋转等空间位置信息,引入了STN（spatial transformer network）,提高算法在解决复杂情况下的表情识别问题的能力。实验表明,ROI区域二级投票机制能够更有效地使用卷积神经网络从训练图像中学习到的分布式特征,比直接使用ROI图像进行投票的方法准确率提升了1.1%,引入STN能够有效提升卷积神经网络的鲁棒性,比未引入STN的方法准确率提升了1.5%。     

A training sample sequence planning method for pattern recognition problems

In solving pattern recognition problems, many classification methods, such as the nearest-neighbor (NN) rule, need to determine prototypes from a training set. To improve the performance of these classifiers in finding an efficient set of prototypes, this paper introduces a training sample sequence planning method. In particular, by estimating the relative nearness of the training samples to the decision boundary, the approach proposed here incrementally increases the number of prototypes until the desired classification accuracy has been reached. This approach has been tested with a NN classification method and a neural network training approach. Studies based on both artificial and real data demonstrate that higher classification accuracy can be achieved with fewer prototypes.     

Effective intervals determined by information granules to improve forecasting in fuzzy time series

Partitioning the universe of discourse and determining effective intervals are critical for forecasting in fuzzy time series. Equal length intervals used in most existing literatures are convenient but subjective to partition the universe of discourse. In this paper, we study how to partition the universe of discourse into intervals with unequal length to improve forecasting quality. First, we calculate the prototypes of data using fuzzy clustering, then form some subsets according to the prototypes. An unequal length partitioning method is proposed. We show that these intervals carry well-defined semantics. To verify the suitability and effectiveness of the approach, we apply the proposed method to forecast enrollment of students of Alabama University and Germany’s DAX stock index monthly values. Empirical results show that the unequal length partitioning can greatly improve forecast accuracy. Further more, the proposed method is very robust and stable for forecasting in fuzzy time series.     

基于CP-ABE和区块链的时间锁加密电子投票方案

现有电子投票系统无法同时满足投票数据隐私性、投票者之间的公平性、投票者资格控制的灵活性、投票结果的精准性、投票结果的延时公布等多元应用需求。针对上述问题,提出了一种基于CP-ABE和区块链的时间锁加密电子投票方案。该方案综合考虑了电子投票在实际场景中的多元应用需求,通过结合CP-ABE算法和Fabric技术,将属性加密后的投票链接数据存入区块链账本,满足属性策略的投票用户才能访问其链接,实现了灵活控制投票资格的机制,从而保证能获取针对不同用户群体属性的精确投票结果;基于改进的时间锁加密方案将投票数据进行加密上链,在预计投票结果公布之前为投票数据的机密性提供了保障,避免恶意节点造成合谋攻击问题,同时实现了投票结果延时公布的功能。实验从用户属性限制、投票链接获取、投票数据上链,以及投票结果延时这四个方面验证所提方案的有效性。系统测试结果表明,该方案可以有效地控制投票资格,符合属性策略的投票用户能成功获取投票链接并发送至区块链存储,同时为投票数据的机密性提供了保障。通过性能分析、安全性分析以及对比分析表明了该方案的可行性。