基于像元与对象分类的景观指数差异性分析

景观指数分析是进行遥感监测土地利用及变化空间格局的重要方法之一,而因为遥感分类方法的不同,所计算出的同一景观指数所揭示的土地变化模式可能出现较大差异。以北京市密云县为研究区,对影像分别进行了面向对象分类与基于像元的监督分类,并对两种分类进行景观指数计算,利用配对样本t检验方法对各景观指数进行了差异显著性分析。分析结果显示地类面积比例(PLAND)和最大斑块指数(LPI)在两种分类方法之间差异不显著;边缘密度(ED)略有显著差异性;而斑块数量(NP)、斑块面积平均值(AREA_MN)、聚合度(AI)与周长面积分维数(PAFRAC)在两种分类方法之间差异显著。     

基于改进LVQ算法的肺结节识别与分类

目前,肺癌的是发病率最高的肿瘤,若能在早期发现癌变并进行相应治疗,将极大的提高患者的生存率。肺癌的症状在早期表现为肺结节。以提高肺结节检测识别率并进行良恶性分类为目的,提出了一种改进的LVQ分类器算法。首先使用C-V算法对原始图像进行肺实质分割,再使用最优阈值法进行感兴趣区域提取,并进行特征提取和特征归一化。使用多次聚类算法检测肺结节。使用基于改进的LVQ分类器进行肺结节的良恶性进行分类。利用改进后的LVQ分类器在LIDC数据集上进行实验,得到了对良性结节的确诊率为87.3%,对恶性结节的确诊率为80.8%。实验结果表明,改进后的算法在良恶性结节分类上具有较高的确诊率,有助于提高医生的工作效率,实现肺结节的辅助发现。     

Neural Network and Classification Approach in Identifying Customer Behavior in the Banking Sector: A Case Study of an International Bank

The customer relationship focus for banks is in development of main competencies and strategies of building strong profitable customer relationships through considering and managing the customer impression, influence on the culture of the bank, satisfactory treatment, and assessment of valued relationship building. Artificial neural networks (ANNs) are used after data segmentation and classification, where the designed model register records into two class sets, that is, the training and testing sets. ANN predicts new customer behavior from previously observed customer behavior after executing the process of learning from existing data. This article proposes an ANN model, which is developed using a six‐step procedure. The back‐propagation algorithm is used to train the ANN by adjusting its weights to minimize the difference between the current ANN output and the desired output. An evaluation process is conducted to determine whether the ANN has learned how to perform. The training process is halted periodically, and its performance is tested until an acceptable result is obtained. The principles underlying detection software are grounded in classical statistical decision theory.     

Optimization of neural network model using modified bat-inspired algorithm

The success of an artificial neural network (ANN) strongly depends on the variety of the connection weights and the network structure. Among many methods used in the literature to accurately select the network weights or structure in isolate; a few researchers have attempted to select both the weights and structure of ANN automatically by using metaheuristic algorithms. This paper proposes modified bat algorithm with a new solution representation for both optimizing the weights and structure of ANNs. The algorithm, which is based on the echolocation behaviour of bats, combines the advantages of population-based and local search algorithms. In this work, ability of the basic bat algorithm and some modified versions which are based on the consideration of the personal best solution in the velocity adjustment, the mean of personal best and global best solutions through velocity adjustment and the employment of three chaotic maps are investigated. These modifications are aimed to improve the exploration and exploitation capability of bat algorithm. Different versions of the proposed bat algorithm are incorporated to handle the selection of the structure as well as weights and biases of the ANN during the training process. We then use the Taguchi method to tune the parameters of the algorithm that demonstrates the best ability compared to the other versions. Six classifications and two time series benchmark datasets are used to test the performance of the proposed approach in terms of classification and prediction accuracy. Statistical tests demonstrate that the proposed method generates some of the best results in comparison with the latest methods in the literature. Finally, our best method is applied to a real-world problem, namely to predict the future values of rainfall data and the results show satisfactory of the method.     

基于GMM与改进MCE训练的说话人识别研究

在应用最小分类错误（MCE）准则对识别说话人的高斯混合模型（GMM）训练中,采用一个权重函数来确定说话人模型参数调整量的权值,使得比较近的竞争说话人模型的权值大,比较远的竞争说话人模型的权值小。并采用梯度概率递减算法来实现损失函数的最小化,有效提高了说话人识别的速度和精度。     

基于粗糙度的近似概念格动态分类集成学习模型研究与应用

概念格(Galois格)是一种进行数据分类学习的有效工具,然而建格规模庞大使分类效率和准确率受到较大影响.将粗糙度理论应用到概念格分类问题研究中,提出一种新型的近似概念格动态建格和分类挖掘集成学习模型(CACLR).该模型在粗糙度区间根据样本空间分布构建多个相对独立分布且比较精确的近似概念格分类器,能及时消除建格过程中大量与分类知识无关的节点,有效缩减原格规模,融合得到的分类挖掘集成学习模型,具有较好的粗糙分类精度和知识预测学习能力.最后进行CACLR分类集成学习模型在标准UCI数据集中的对比实验,有效验证了该模型的实用价值.     

一个文本分类构件的设计与实现

在文本分类构件设计和实现过程中,贯彻面向对象的思想,主要使用设计模式,实现构件内部的高内聚、低耦合。在构件描述方面,使用XML这一直观的手段对构件各方面的信息进行描述,在对构件文本分类功能的测试中取得较好的效果。     

基于模板匹配的手写数字决策分类器设计

针对手写数字识别提出一种基于模板匹配决策分类器设计方法。就该方法下的模式识别分类器设计进行详细论述,给出该分类器算法实现。该算法在对手写的数字图像进行预处理的基础上从待识别的手写数字图像中提取若干特征量与事先建立的标准模板库中模板对应的特征量进行比较,计算待识别图像和标准模板特征量之间的距离,用最小距离法判定其所属类。实验结果表明,该决策分类器算法实现容易,匹配速度快,保证字符识别的正确率。     

基于后验概率SVM决策树多类的分类算法

后验概率支持向量机方法对孤立点和噪声具有鲁棒性,并且可以减少支持向量的数量,从而降低计算复杂度。因此,针对最近提出的快速分类算法c-BTS,引入样本的后验概率,提出了一种基于后验概率的SVM决策树算法P2BTS。实验结果证明,基于后验概率的支持向量机决策树P2BTS比c-BTS的分类精度更高,且所需的二类分类器个数减少,在一定程度上降低了P2BTS分类决策的时间和比较的次数,提高了分类效率。     

一种基于改进支持向量机的文本倾向性分类算法

文本的倾向性分类器是文本倾向性分类的核心部分,它用于将待分类的文本映射到某一倾向性类别中去。传统支持向量机的核函数学习能力和泛化推广能力的平衡性有待提高,而且参数选择不易。对目前文本倾向性分类算法使用的传统的支持向量机进行了改进,一是构造了多核函数;二是使用粒子群算法对支持向量机的参数进行优化,平衡了核函数的全局性和局部性,更有利于对样本数据的学习和推广;最后利用改进的支持向量机构造文本倾向性分类算法。