Computing budget allocation for efficient ranking and selection of variances with application to target tracking algorithms

This paper addresses the problem of ranking and selection for stochastic processes, such as target tracking algorithms, where variance is the performance metric. Comparison of different tracking algorithms or parameter sets within one algorithm relies on time-consuming and computationally demanding simulations. We present a method to minimize simulation time, yet to achieve a desirable confidence of the obtained results by applying ordinal optimization and computing budget allocation ideas and techniques, while taking into account statistical properties of the variance. The developed method is applied to a general tracking problem of N/sub s/ sensors tracking T targets using a sequential multi-sensor data fusion tracking algorithm. The optimization consists of finding the order of processing sensor information that results in the smallest variance of the position error. Results that we obtained with high confidence levels and in reduced simulation times confirm the findings from our previous research (where we considered only two sensors) that processing the best available sensor the last performs the best, on average. The presented method can be applied to any ranking and selection problem where variance is the performance metric.     

BP算法和对称ARCH类模型对股市波动性预测的实证比较

利用我国深圳股票市场的实际数据,建立了相应的BP算法网络预测模型和ARCH(1),GARCH(1,1)预测模型,分别用来对深成指数每个周末收盘价的波动性进行预测．研究表明,BP算法对样本外观测值的上凸曲线拟合得较好,对下凸曲线的拟合效果较差;ARCH(1)和GARCH(1,1)则反之,其预测曲线对样本外观测值的下凸曲线拟合效果都较好,但对上凸曲线的拟合效果都较差．通过采用6种常用的预测误差统计量:平均误差、平均绝对误差、均方根误差、平均绝对比率误差、Akaike信息准则、Baves信息准则对样本外数据的预测结果进行检验,BP算法的预测效果最好,ARCH(1)模型次之,GARcH(1,1)模型偏差．     

A comparison of error metrics and constraints for multiple endmember spectral mixture analysis and spectral angle mapper

Spectral matching algorithms can be used for the identification of unknown spectra based on a measure of similarity with one or more known spectra. Two popular spectral matching algorithms use different error metrics and constraints to determine the existence of a spectral match. Multiple endmember spectral mixture analysis (MESMA) is a linear mixing model that uses a root mean square error (RMSE) error metric. Spectral angle mapper (SAM) compares two spectra using a spectral angle error metric. This paper compares two endmember MESMA and SAM using a spectral library containing six land cover classes. RMSE and spectral angle for models within each land cover class were directly compared. The dependence of RMSE on the albedo of the modeled spectrum was also explored. RMSE and spectral angle were found to be closely related, although not equivalent, due to variations in the albedo of the modeled spectra. Error constraints applied to both models resulted in large differences in the number of spectral matches. Using MESMA, the number of spectra modeled within the error constraint increased as the albedo of the modeled spectra decreased. The value of the error constraint used was shown to make a much larger difference in the number of spectra modeled than the choice of spectral matching algorithm.     

基于误差控制的自适应3次B样条曲线插值

针对现有曲线插值算法不能有效压缩型值点的缺陷,研究了一种自适应三次B样条曲线插值算法。从型值点序列中选用最少的点插值一条初始曲线,基于提出的点到曲线的最小距离计算方法,分别计算各非插值点对应的插值误差,并从中提取最大插值误差。若最大误差大于给定的误差阈值,则将其对应的型值点加入插值型值点序列,重新插值曲线,直到最大插值误差满足误差要求。与现有曲线插值算法相比,该算法可以在保证插值精度的前提下有效压缩数据量。     

基于光谱信息散度与光谱角匹配的高光谱解混算法

针对采用线性逆卷积(LD)算法进行端元初选过程中,端元子集中存在相似端元光谱,影响解混精度的问题,提出了一种基于光谱信息散度(SID)与光谱角匹配(SAM)算法的端元子集优选光谱解混算法。通过在端元进行二次选择时,采用以光谱信息散度和光谱角(SID-SA)混合法准则作为最相似端元选择的判据,去除相似端元,降低相似端元对解混精度的影响。实验结果表明,基于SID与SAM的高光谱解混算法将重构影像的均方根误差(RMSE)降低到0.0104,该方法比传统方法提高了端元的选择精度,减少了丰度估计误差,误差分布更加均匀。     

分形插值在风速时间序列中的应用

针对风电场风速数据中大量连续缺失数据的插值问题,提出了一种基于自适应变异粒子群优化（PSO）的分形插值算法。首先,在粒子群优化算法中引入变异因子,增强粒子的多样性,提高算法搜索精度;其次,通过自适应变异粒子群优化算法来得到分形插值算法中垂直比例因子参数的最佳取值;最后,对两组不同趋势和变化特征的数据集进行分形插值计算分析,并把所提算法与Lagrange插值和三次样条插值方法进行对比。结果表明：分形插值不仅可以保持风速曲线的整体波动特性和局部特征,而且比传统插值方法的精度更高;在基于Dataset A的实验中,分形插值的均方根误差（RMSE）分别比Lagrange插值和三次样条插值减小了66.52%和58.57%;在基于Dataset B的实验中,分形插值的RMSE分别比Lagrange插值和三次样条插值减小了76.72%和67.33%。证明分形插值更适合连续缺失且波动强烈的风速时间序列的插值。     

分形插值在风速时间序列中的应用

针对风电场风速数据中大量连续缺失数据的插值问题，提出了一种基于自适应变异粒子群优化（PSO）的分形插值算法。首先，在粒子群优化算法中引入变异因子，增强粒子的多样性，提高算法搜索精度；其次，通过自适应变异粒子群优化算法来得到分形插值算法中垂直比例因子参数的最佳取值；最后，对两组不同趋势和变化特征的数据集进行分形插值计算分析，并把所提算法与Lagrange插值和三次样条插值方法进行对比。结果表明：分形插值不仅可以保持风速曲线的整体波动特性和局部特征，而且比传统插值方法的精度更高；在基于Dataset A的实验中，分形插值的均方根误差（RMSE）分别比Lagrange插值和三次样条插值减小了66.52%和58.57%；在基于Dataset B的实验中，分形插值的RMSE分别比Lagrange插值和三次样条插值减小了76.72%和67.33%。证明分形插值更适合连续缺失且波动强烈的风速时间序列的插值。     

Topology preserving top-down compression of 2D vector fields using bintree and triangular quadtrees

We present a hierarchical top-down refinement algorithm for compressing 2D vector fields that preserves topology. Our approach is to reconstruct the data set using adaptive refinement that considers topology. The algorithms start with little data and subdivide regions that are most likely to reconstruct the original topology of the given data set. We use two different refinement techniques. The first technique uses bintree subdivision and linear interpolation. The second algorithm is driven by triangular quadtree subdivision with Coons patch quadratic interpolation. We employ local error metrics to measure the quality of compression and as a global metric we compute Earth Mover's Distance (EMD) to measure the deviation from the original topology. Experiments with both analytic and simulated data sets are presented. Results indicate that one can obtain significant compression with low errors without losing topological information. Advantages and disadvantages of different topology preserving compression algorithms are also discussed in the paper.     

Recommender systems based on ranking performance optimization

The rapid development of online services and information overload has inspired the fast development of recommender systems, among which collaborative filtering algorithms and model-based recommendation approaches are wildly exploited. For instance, matrix factorization (MF) demonstrated successful achievements and advantages in assisting internet users in finding interested information. These existing models focus on the prediction of the users’ ratings on unknown items. The performance is usually evaluated by the metric root mean square error (RMSE). However, achieving good performance in terms of RMSE does not always guarantee a good ranking performance. Therefore, in this paper, we advocate to treat the recommendation as a ranking problem. Normalized discounted cumulative gain (NDCG) is chosen as the optimization target when evaluating the ranking accuracy. Specifically, we present three ranking-oriented recommender algorithms, NSMF, AdaMF and AdaNSMF. NSMF builds a NDCG approximated loss function for Matrix Factorization. AdaMF is based on an algorithm by adaptively combining component MF recommenders with boosting method. To combine the advantages of both algorithms, we propose AdaNSMF, which is a hybird of NSMF and AdaMF, and show the superiority in both ranking accuracy and model generalization. In addition, we compare our proposed approaches with the state-of-the-art recommendation algorithms. The comparison studies confirm the advantage of our proposed approaches.     

基于基因表达式编程的错误定位方法

错误定位是软件调试中最重要且最耗时的部分,错误定位中的任何改进都可以大大降低软件成本,而其中秩函数的选择问题则尤为关键。结合基因表达式编程技术以及基于频谱的错误定位算法,找到适应程序的高效秩函数,提出了一种新的错误定位方法。从程序测试用例的覆盖信息中提取出四种类型的子集信息;通过基因表达式编程训练出适应程序的最优秩函数;利用秩函数计算出每条语句的可疑度值,并按照可疑度值由高到低的顺序逐条检查程序的可疑语句进行错误定位。通过实验,将训练出的秩函数与已经提出的秩函数（如Tarantula,Ochiai等）进行比较分析,结果表明,基于基因表达式编程的错误定位方法具有更精确的错误定位效果和更显著的定位效率。     

An empirical study on software defect prediction with a simplified metric set

ContextSoftware defect prediction plays a crucial role in estimating the most defect-prone components of software, and a large number of studies have pursued improving prediction accuracy within a project or across projects. However, the rules for making an appropriate decision between within- and cross-project defect prediction when available historical data are insufficient remain unclear.ObjectiveThe objective of this work is to validate the feasibility of the predictor built with a simplified metric set for software defect prediction in different scenarios, and to investigate practical guidelines for the choice of training data, classifier and metric subset of a given project.MethodFirst, based on six typical classifiers, three types of predictors using the size of software metric set were constructed in three scenarios. Then, we validated the acceptable performance of the predictor based on Top-k metrics in terms of statistical methods. Finally, we attempted to minimize the Top-k metric subset by removing redundant metrics, and we tested the stability of such a minimum metric subset with one-way ANOVA tests.ResultsThe study has been conducted on 34 releases of 10 open-source projects available at the PROMISE repository. The findings indicate that the predictors built with either Top-k metrics or the minimum metric subset can provide an acceptable result compared with benchmark predictors. The guideline for choosing a suitable simplified metric set in different scenarios is presented in Table 12.ConclusionThe experimental results indicate that (1) the choice of training data for defect prediction should depend on the specific requirement of accuracy; (2) the predictor built with a simplified metric set works well and is very useful in case limited resources are supplied; (3) simple classifiers (e.g., Naïve Bayes) also tend to perform well when using a simplified metric set for defect prediction; and (4) in several cases, the minimum metric subset can be identified to facilitate the procedure of general defect prediction with acceptable loss of prediction precision in practice.     

Spatial skyline queries: exact and approximation algorithms

As more data-intensive applications emerge, advanced retrieval semantics, such as ranking and skylines, have attracted the attention of researchers. Geographic information systems are a good example of an application using a massive amount of spatial data. Our goal is to efficiently support exact and approximate skyline queries over massive spatial datasets. A spatial skyline query, consisting of multiple query points, retrieves data points that are not father than any other data points, from all query points. To achieve this goal, we present a simple and efficient algorithm that computes the correct results, also propose a fast approximation algorithm that returns a desirable subset of the skyline results. In addition, we propose a continuous query algorithm to trace changes of skyline points while a query point moves. To validate the effectiveness and efficiency of our algorithm, we provide an extensive empirical comparison between our algorithms and the best known spatial skyline algorithms from several perspectives.     

Evaluation of most similar neighbour and random forest methods for imputing forest inventory variables using data from target and auxiliary stands

We report the results from modelling standing volume, above-ground biomass and stem count with the aim of exploring the potential of two non-parametric approaches to estimate forest attributes. The models were built based on spectral and 3D information extracted from airborne optical and laser scanner data. The survey was completed across two geographically adjacent temperate forest sites in southwestern Germany, using spatially and temporally comparable remote-sensing data collected by similar instruments. Samples from the auxiliary reference stands (called off-site samples) were combined with random, random stratified and systematically stratified samples from the target area for prediction of standing volume, above-ground biomass and stem count in the target area. A range of combinations was used for the modelling process, comprising the most similar neighbour (MSN) and random forest (RF) imputation methods, three sampling designs and two predictor subset sizes. An evolutionary genetic algorithm (GA) was applied to prune the predictor variables. Diagnostic tools, including root mean square error (RMSE), bias and standard error of imputation, were employed to evaluate the results. The results showed that RF produced more accurate results than MSN (average improvement of 3.5% for a single-neighbour case with selected predictors), yet was more biased than MSN (average bias of 5.13% with RF compared to 2.44% with MSN for stem volume in a single-neighbour case with selected predictors). Combining systematically stratified auxiliary samples from the target data set with the reference data set yielded more accurate results compared to those from random and stratified random samples. Combining additional data was most influential when an intensity of up to 40% of supplementary samples was appended to the reference set. The use of GA-selected predictors resulted in reduced bias of the models. By means of bootstrap simulations of RMSE, the simulations were shown to lie within the applied non-parametric confidence intervals. The achieved results are concluded to be helpful for modelling the mentioned forest attributes by means of airborne remote-sensing data.     

基于莱特准则的椭圆拟合优化算法

普遍使用的代数距离最小的最小二乘（LS）椭圆拟合算法简单、易实现,但对样本点无选择,导致拟合结果易受误差点影响,拟合不准确。针对此特性,提出了一种基于莱特准则的椭圆拟合优化算法。首先,由代数距离最小的LS法对待拟合曲线进行椭圆拟合;其次,将待拟合曲线上的点与LS法拟合的椭圆的代数距离作为样本点集,在验证该样本点集服从正态分布的情况下,采用莱特准则,将样本点中值大于|3σ|的点判定为野值并剔除,进行多次拟合,直至样本点中无野值;最后,得到椭圆最优拟合结果。仿真实验结果表明,优化算法的拟合误差在1.0%以下,相比同条件下的LS法,其拟合精度至少提高2个百分点。优化算法的仿真结果与其在香烟圆度在线检测中的实际应用验证了此算法的有效性。     

The continuous non-linear approximation of procedurally defined curves using integral B-splines

This paper outlines an algorithm for the continuous non-linear approximation of procedurally defined curves. Unlike conventional approximation methods using the discrete L_2 form metric with sampling points, this algorithm uses the continuous L_2 form metric based on minimizing the integral of the least square error metric between the original and approximate curves. Expressions for the optimality criteria are derived based on exact B-spline integration. Although numerical integration may be necessary for some complicated curves, the use of numerical integration is minimized by a priori explicit evaluations. Plane or space curves with high curvatures and/or discontinuities can also be handled by means of an adaptive knot placement strategy. It has been found that the proposed scheme is more efficient and accurate compared to currently existing interpolation and approximation methods.     

基于对应点匹配的眼球切片图像插值算法

图像插值是三维重建的一个关键步骤。针对眼球切片图像的特点，研究和分析了传统的图像插值方法，并在此基础上提出了一种改进的对应点匹配插值方法。先根据改进的对应点匹配准则在相邻层间建立点对点的对应关系，然后利用这些对应点进行插值，得到插值图像数据。实验结果表明，该算法能有效减少插值误差，获得令人满意的效果。     

基于对应点匹配的眼球切片图像插值算法

图像插值是三维重建的一个关键步骤。针对眼球切片图像的特点,研究和分析了传统的图像插值方法,并在此基础上提出了一种改进的对应点匹配插值方法。先根据改进的对应点匹配准则在相邻层间建立点对点的对应关系,然后利用这些对应点进行插值,得到插值图像数据。实验结果表明,该算法能有效减少插值误差,获得令人满意的效果。     

面向排序学习的层次聚类特征选择算法

大型搜索系统对用户查询的快速响应尤为必要,同时在计算候选文档的特征相关性时,必须遵守严格的后端延迟约束。通过特征选择,提高了机器学习的效率。针对排序学习中快速特征选择的起点多为单一排序效果最好的特征的特点,首先提出了一种用层次聚类法生成特征选择起点的算法,并将该算法应用于已有的2种快速特征选择中。除此之外,还提出了一种充分利用聚类特征的新方法来处理特征选择。在2个标准数据集上的实验表明,该算法既可以在不影响精度的情况下获得较小的特征子集,也可以在中等子集上获得最佳的排序精度。     

基于随机森林的高分辨率 PM2.5 遥感反演 ——以广东省为例

细颗粒物(PM2.5)监测是大气污染治理的重要手段,受限于地面观测点的数量,从遥感反演 PM2.5 是常规地面观测的有效补充,是当前的研究热点。通常遥感反演 PM2.5 的思路是先反演大气气溶胶光学厚度,然后基于统计关系由大气气溶胶光学厚度反演 PM2.5。该方法容易造成误差传递,从而 导致反演模型的不稳定。该文提出了一种基于随机森林算法(一种机器学习算法)的 PM2.5 遥感反演方法,直接建立中分辨率成像光谱仪(Moderate Resolution Imaging Spectroradiometer,MODIS)影像与地 面实测 PM2.5 的关系,可以避免传统反演 PM2.5 时先反演大气气溶胶光学厚度带来的误差,最终得到精度更高的 PM2.5 反演结果。该方法先用随机森林算法对 MODIS 影像和经过克里金插值后的地面监测站PM2.5 数据进行训练和测试;然后,根据测试的均方根误差从多个模型中选取最优(均方根误差最小)的模型;最后,将此模型用于整幅 MODIS 影像,得到整个区域的 PM2.5 反演结果。实验选取了广东省 四个季节多幅 MODIS 影像数据进行验证,并通过决定系数和均方根误差两个表现指标进行对比和分析,验证了所提算法的优越性。     

Selecting Weapon System Using Relative Distance Metric Method

This paper proposes a new fuzzy ranking method named relative distance metric method, which can overcome some of the shortcomings for previous ranking methods and select the best alternative in selecting weapon systems. There are two objectives in this paper. Firstly, we propose a new ranking method and compare our method with other methods by many examples. The second objective is applying the proposed method to rank the best self-propelled Howitzers and main battle tanks.