分布式检测系统的一种软决策融合算法

在分布式检测系统中,为了进一步提高系统的性能,各传感器可以向融合中心发送多位二进制判决信息.对于这种发送多位判决信息的软决策融合系统,提出了一种对各传感器观测空间进行再划分的方法,它将各传感器的观测空间按照其检测概率和虚警概率进行再划分.这种划分方法能够简化融合中心的计算,且计算机仿真结果表明,应用该方法后融合系统的检测性能有明显的提高.     

A measurement fusion method for nonlinear system identification using a cooperative learning algorithm

Identification of a general nonlinear noisy system viewed as an estimation of a predictor function is studied in this article. A measurement fusion method for the predictor function estimate is proposed. In the proposed scheme, observed data are first fused by using an optimal fusion technique, and then the optimal fused data are incorporated in a nonlinear function estimator based on a robust least squares support vector machine (LS-SVM). A cooperative learning algorithm is proposed to implement the proposed measurement fusion method. Compared with related identification methods, the proposed method can minimize both the approximation error and the noise error. The performance analysis shows that the proposed optimal measurement fusion function estimate has a smaller mean square error than the LS-SVM function estimate. Moreover, the proposed cooperative learning algorithm can converge globally to the optimal measurement fusion function estimate. Finally, the proposed measurement fusion method is applied to ARMA signal and spatial temporal signal modeling. Experimental results show that the proposed measurement fusion method can provide a more accurate model.     

基于LMS算法的多传感器数据加权融合方法

针对目前多传感器数据融合过程中,传感器观测噪声不易确定,提出了一种基于LMS算法的多传感器自适应加权数据融合方法。该方法将传感器最优加权系数的求解,转化为估计值的均方误差性能表面的最优解搜索,通过加入自适应阶段,采用自适应最小均方误差（LMS）算法调整传感器加权系数。仿真结果表明该方法的有效性。     

Urban expansion modeling using an enhanced decision tree algorithm

Decision tree (DT) algorithms have been applied for classification and change detection in various geospatial studies and more recently, for urban expansion and land use/land cover (LULC) change modeling. However, these studies have not elaborated on specification of DT algorithms regarding data sampling, predictor variables, model configuration, and model evaluation. The focus of this study is to explore several balanced and unbalanced sampling methods, various predictor variables, different configurations of stopping rules, and reliable evaluation metrics to enhance the performance of classification and regression tree (CART), one of the most efficacious DT algorithms, for urban expansion modeling. The implementation of the model in the Triangle Region, North Carolina (NC) State, over the period of 2001 to 2011 demonstrates a striking performance with the training accuracy of 97%, the testing accuracy of 94%, and the Kappa value of 0.80. This performance was achieved using a training dataset containing all changed land cells and three times of that randomly selected from unchanged land cells and regulating the minimum number of records in a leaf node equal to 1, the minimum number of records in a parent node equal to 2, and the value of 10,000 for the maximum number of splits. The CART DT algorithm indicates that proximity to built areas, proximity to highways, current LULC type, elevation, and distance to water bodies are the most significant predictor variables for the urban expansion prediction in the study area.

     

A successive approximation algorithm for an undiscounted Markov decision process

In this paper we consider a completely ergodic Markov decision process with finite state and decision spaces using the average return per unit time criterion. An algorithm is derived which approximates the optimal solution. It will be shown that this algorithm is finite and supplies upper and lower bounds for the maximal average return and a nearly optimal policy with average return between these bounds.     

A decision tree using ID3 algorithm for English semantic analysis

Natural language processing has been studied for many years, and it has been applied to many researches and commercial applications. A new model is proposed in this paper, and is used in the English document-level emotional classification. In this survey, we proposed a new model by using an ID3 algorithm of a decision tree to classify semantics (positive, negative, and neutral) for the English documents. The semantic classification of our model is based on many rules which are generated by applying the ID3 algorithm to 115,000 English sentences of our English training data set. We test our new model on the English testing data set including 25,000 English documents, and achieve 63.6% accuracy of sentiment classification results.     

一种基于灰色关联度的决策树改进算法

在构造决策树的过程中,分裂属性选择的标准直接影响分类的效果。分析了现有改进的ID3算法不同程度地存在学习效率偏低和对多值属性重要性的主观评测等问题,提出一种高效而且可靠的基于灰色关联度的决策树改进算法。该算法通过灰色关联分析建立各特征属性与类别属性之间的关系,进而利用灰色关联度来修正取值较多但非重要属性的信息增益。通过实验与其它ID3改进算法进行了比较,验证了改进后的算法是有效的。     

Nonlinear fusion method for multistage product design decision-making using plant growth simulation algorithm

Design decision-making is a vital activity for selecting an optimal scheme for product development. Owing to the uncertainty and ambiguity of design requirements and constraints, several product design phases are often deployed for concept refinement, which makes multistage product design decision-making (MPDDM) and the effective fusion of MPDDM data indispensable. However, few existing methods have considered the nonlinear relationships among the MPDDM information. Therefore, a nonlinear fusion method for MPDDM was proposed in this study. This method applies a three-parameter interval grey number to depict decision-makers’ judgement about product design schemes. Based on converting linguistic judgements into interval scales, an interval analytic hierarchy process (AHP) method was employed to calculate the weights of the design criteria, decision-makers, and decision-making stages. Considering the advantage of integrating multiple matrices without requiring external control parameters, a multistage decision-making fusion process using a plant growth simulation algorithm (PGSA) was proposed to aggregate multistage decision-making data for product design. A case study was conducted to collect multistage decision-making data, and the PGSA was developed. Through comparison with the extant method, the effectiveness and feasibility of the fusion of MPDDM was verified. The results indicate that (1) uncertainty perceived by decision-makers at three stages accounted for 96.7%, 95%, and 97.2%, respectively. The “center of gravity” of a three-parameter interval grey number, which reflects the largest possibility of decision-makers’ preferences, is not always equally distant from its maximum or minimum value (73.9%). (2) The optimization model using interval AHP to calculate the weights of decision-making indicators and stages is conducive to reducing the decision-maker’s uncertainty. (3) The global search mechanism of the PGSA can effectively realize the nonlinear fusion of MPDDM.     

A query-by-example music retrieval system using feature and decision fusion

Multimedia Tools and Applications - An attractive topic of Music Information Retrieval (MIR) is focused on query-by-example (QBE), which receives a user-provided query and aims to find the target...     

不相容决策表中一种新的属性约简算法

针对不相容决策表中一些属性约简算法的不足,结合粗糙集的代数观与信息观的优点,对差别矩阵加以改进,提出了一种新的属性约简算法,该算法在保证约简后决策表的正域和条件信息熵不变的情况下,降低了时间复杂度。通过实例说明了该算法的有效性和可行性。     

Multi sensor image fusion for surveillance applications using hybrid image fusion algorithm

Multimedia Tools and Applications - Image fusion is the process of integrating several source images into a single image that provides more reliable information along with reduced redundancy. In...     

基于类决策树分类的特征层融合识别算法

针对雷达组网量测数据不确定性大、信息不完备等特点, 基于决策树分类算法的思想, 创建类决策树的概念, 提出一种基于类决策树分类的特征层融合识别算法. 所给出的算法无需训练样本, 采用边构造边分类的方式, 选取信 息增益最大的属性作为分类属性对量测数据进行分类, 实现了对目标的识别. 该算法能够处理含有空缺值的量测数据, 充分利用量测数据的特征信息. 仿真实验结果表明, 类决策树分类算法是一种简单有效的特征层融合识别算法.

     

基于序贯检测的无线传感器网络决策融合算法

数据融合是能源有限的无线传感器网络应用中必不可少的信息处理手段.目前的数据融合方法多着眼于固定参与节点数目下的数据融合,由于融合时数据传输量与参与节点数目呈正比,所以,最佳的节能策略应是满足一定性能条件下参与节点数目可变.将序贯检测理论应用于无线传感器网络数据融合问题上,并建立其数学模型.考虑无线信道的衰减和物理层调制解调特性,进一步提出基于序贯检测的无线传感器网络数据融合判决(WDASD)方法,并通过仿真实验验证了WDASD算法的性能.     

基于特征融合与决策树技术的表情识别方法

针对复杂状况下传统表情识别方法存在的问题,提出一种新的非特定人表情识别方法。该算法首先提取每张表情图像的HOG特征和Haar小波特征,然后将两种不同的特征串行融合得到整幅图像的特征,最后通过SVM多分类器完成各层人脸表情的分类识别。在JAFFE人脸表情库上的仿真实验中,该方法的分类准确率达到87.9%,平均时耗达到10.296 6s。对比实验结果表明,所提算法具有更高的识别率、更好的实时性和更强的鲁棒性。     

A multilevel decision fusion approach for urban mapping using very high-resolution multi/hyperspectral imagery

A novel multilevel decision fusion approach is proposed for urban mapping using very-high-resolution (VHR) multi/hyperspectral imagery. The proposed framework consists of three levels: (1) at level I, we first propose a self-dual filter for extracting structural features from the VHR imagery–subsequently, the spectral and structural features are integrated based on a weighted probability fusion; (2) level II extends level I by implementing the spectral–structural fusion in an object-based framework; and (3) at level III, the object-based probabilistic outputs at level II are used to identify unreliable objects, and shape attributes of these unreliable objects are then considered for refinement of classification. At this level, a decision-level object merging is used to improve the initial segmentation, since shape feature extraction is highly dependent on the quality of segmentation. Experiments were conducted on a Hyperspectral Digital Imagery Collection Experiment (HYDICE) DC Mall image and a QuickBird Beijing data set. The results revealed that the proposed approach provided progressively increasing accuracies when the multilevel features were gradually considered in the processing chain.     

无线传感网络中的分簇融合决策方法

无线传感网络的簇划分和簇内节点访问顺序对数据融合决策能耗和耗时具有重要影响．对此,提出一种分簇融合方法,采用最大熵聚类法和蚁群算法实现分簇和节点访问顺序规划,在簇内由移动代理以渐近方式完成局部融合,中心服务节点通过二次融合得到最终结果．仿真实验以能耗×耗时为评价指标,分析了簇数目对数据融合效率和准确性的影响．验证了分簇融合决策方法能有效降低网络能耗和耗时．提高融合准确性和执行效率．     

A trend based investment decision approach using clustering and heuristic algorithm

This paper proposes a stock price trend clustering and trend investment decision model by using a genetic algorithm to search for optimal solutions and the best investment strategies for different stock price trends.The new price trend clustering model identifies three types of stock price movements:uptrends,sideways trends,and downtrends.Unfortunately,trends discovered through stock price movements or technical indicator graphs are typically subjective and unquantifiable.This paper takes daily stock prices and trading volume data from the China Shanghai Stock Exchange Composite Index(SSECI)from January 2,1997 to August31,2012,to examine the performance of the proposed trend clustering model.The proposed model is also compared to other popular stock market investment strategies to verify its validity.Research result shows that the proposed trend clustering model correctly identifies three different trends in the stock market.Furthermore,the trend investment strategy model developed by using genetic algorithm methodology performs better than other investment strategies,namely,Granville’s rule,the KD indicator strategy,the buys and holds strategy,and GMA rules,in both bull and bear market periods.Research results prove the proposed new model to be a stable and valid investment strategy.     

A hybrid decision tree training method using data streams

Classical classification methods usually assume that pattern recognition models do not depend on the timing of the data. However, this assumption is not valid in cases where new data frequently become available. Such situations are common in practice, for example, spam filtering or fraud detection, where dependencies between feature values and class numbers are continually changing. Unfortunately, most classical machine learning methods (such as decision trees) do not take into consideration the possibility of the model changing, as a result of so-called concept drift and they cannot adapt to a new classification model. This paper focuses on the problem of concept drift, which is a very important issue, especially in data mining methods that use complex structures (such as decision trees) for making decisions. We propose an algorithm that is able to co-train decision trees using a modified NGE (Nested Generalized Exemplar) algorithm. The potential for adaptation of the proposed algorithm and the quality thereof are evaluated through computer experiments, carried out on benchmark datasets from the UCI Machine Learning Repository.     

双色红外图像目标多特征决策级融合识别算法

针对双色红外成像系统中的自动目标识别问题,提出了一种采用多特征多分类器决策级融合的目标识别算法。该算法首先提取目标的形状特征和面貌特征;接着基于各种不同特征设计多个分类器对目标进行分类;然后采用所设计的多分类器决策级融合策略对多个分类器的目标分类结果进行融合处理;最后采用所提出的决策规则对多分类器融合分类结果进行处理得到最终的目标识别结果。该算法充分利用了目标在多传感器图像中的多种分类特征信息,在较大程度上提高了系统的目标识别效率和精确性。实验结果证实了该算法的有效性。     

A PSO-based intelligent decision algorithm for VLSI floorplanning

Floorplanning is an important issue in the very large-scale integrated (VLSI) circuit design automation as it determines the performance, size, yield and reliability of VLSI chips. This paper proposes a novel intelligent decision algorithm based on the particle swarm optimization (PSO) technique to obtain a feasible floorplanning in VLSI circuit physical placement. The PSO was applied with integer coding based on module number and a new recommended value of acceleration coefficients for optimal placement solution. Inspired by the physics of genetic algorithm (GA), the principles of mutation and crossover operator in GA are incorporated into the proposed PSO algorithm to make this algorithm to break away from local optima and achieve a better diversity. Experiments employing MCNC and GSRC benchmarks show that the proposed algorithm is effective. The proposed algorithm can avoid local minimum and performs well in convergence. The experimental results of the proposed method in this paper can also greatly help floorplanning decision making in VLSI circuit design automation.