基于改进模糊核聚类的室内定位方法研究

针对室内定位中,WiFi位置指纹法存在的定位实时性和精度的问题,提出一种基于改进模糊核聚类(KFCM)和加权K近邻(WKNN)结合的室内定位方法,旨在降低定位时间和改善定位精度.首先利用快速搜索和发现峰值聚类(CFSFDP)确定聚类数目和初始聚类中心,克服KFCM算法对初始聚类中心选取的依赖性而导致聚类结果不稳定的缺点,在此基础上,采用WKNN进行定位匹配,提高定位精度.实验表明,所提出方法相较于无聚类的室内定位方法,能在保证一定精度的前提下,减少定位计算量和时间.此外,将所提出方法与基于K均值、KFCM和CFSFDP的方法进行实验对比,结果显示,该方法具有更好的聚类效果和定位精度.     

基于支撑向量置换核函数的一种领域知识与模型融合的技术

提出了一种修正撑向量核函数的理论与方法，与传统的方法相比，置换核函数的引入为领域知识与学习模型的融合提供了理论基础与方法。该文借助于置换的概念，对关于事物模式组成的不变性常识进行了形式化，求取了可以定量表述事物模式扰动的置换变换矩阵；在分类不变性的约束下，运用置换变换矩阵对核函数进行修正，获得了改进的学习模型，文本分类的实验表明，学习算法将文本领域内的知识有效地融合到了学习模型中，获得了更高的分辨率与泛化能力。     

基于小波KPCA与IQGA-ELM的煤与瓦斯突出预测研究

为有效预防煤与瓦斯突出灾害,针对煤与瓦斯突出预测精度和效率不高问题,提出基于小波核主成分分析(KPCA)和改进的极限学习机(IQGA-ELM)的煤与瓦斯突出预测方法.通过小波核主成分分析法对原始致突指标进行非线性降维处理,提取出致突指标主成分序列,将其作为极限学习机(ELM)网络神经的输入,利用改进量子遗传算法(IQGA)对ELM的输入层权值和隐含层阈值进行优化,建立小波KPCA-IQGA-ELM预测模型,模型的输出为煤与瓦斯突出强度的预测结果.研究结果表明,该模型泛化能力强,可以对煤与瓦斯突出强度进行有效预测.     

集成先验知识的多核线性规划支持向量回归

为了解决工程中数据样本较少情况下的准确建模问题, 提出了一种集成先验知识的多核线性规划支持向量回归算法. 该算法首先通过修改优化目标和不等式约束条件, 把来自仿真模型具有偏差的先验知识数据集成到现有的线性规划支持向量回归的学习框架中. 然后, 引入多核到集成先验知识的线性规划支持向量回归中以实现复杂规律的准确建模. 最后, 将算法推广到多输入多输出的数据建模中. 仿真案例以及在天线和滤波器的实际应用表明: 该算法求解简单, 具有较好的模型稀疏和准确性.     

基于暗通道先验和核回归的图像去雾研究

在雾霾天气条件下,由于大气粒子的散射作用导致观察到的图像质量在一定程度上有所下降。本文提出一种基于暗通道先验知识和局部多项式核回归的图像去雾方法。首先,根据暗原色先验原理估计出大气光强度和初始透射率。其次,采用局部多项式核回归对透射率进行平滑和细化。最后,利用细化后的透射率和估计的大气光强度恢复雾天图像。实验结果表明,采用该方法可以有效地实现去雾。与目前最先进的方法相比,处理后的图像保留了更多的细节信息,且提高了图像清晰度。     

Incorporating Prior Knowledge in the Form of Production Rules into Neural Networks Using Boolean-Like Neurons

At present, nearly all neural networks are formulated by learning only from examples or patterns. For a real-word problem, some forms of prior knowledge in a non-example form always exist. Incorporation of prior knowledge will benefit the formulation of neural networks. Prior knowledge could be in several forms. Production rule is one form in which the prior knowledge is frequently represented. This paper proposes an approach to incorporate production rules into neural networks. A newly defined neuron architecture, Boolean-like neuron, is proposed. With this Boolean-like neuron, production rules can be encoded into the neural network during the network initialization period. Experiments are described in this paper. The results show that the incorporation of this prior knowledge can not only increase the training speed, but also the explainability of the neural networks.     

结合类标签关联度的有序核判别回归学习

有序离散类标号通常由原始连续标号按一定规则映射得到,因此它们彼此间是存在关联信息的,现有有序回归方法对此类关联信息的考虑仍然较少。首先提出一类有序标号间关联度的量化表示,进而将其与典型有序回归方法(Kernel discriminant learning for ordinal regression, KDLOR)相结合,设计出了一种结合类标号关联度的有序核判别回归学习方法(Kernel discriminant learning for ordinal regression using label membership,LM KDLOR),最后通过在多个标准有序回归数据集上的对比实验验证了所提方法的有效性。     

一种先验知识引导的基于二阶段渐进网络的自主抓取策略

针对未知不规则物体在堆叠场景下的抓取任务,提出一种基于二阶段渐进网络(two-stage progressive network,TSPN)的自主抓取方法.首先利用端对端策略获取全局可抓性分布,然后基于采样评估策略确定最优抓取配置.将以上2种策略融合,使得TSPN的结构更加精简,显著减少了需评估样本的数量,能够在保证泛化能力的同时提升抓取效率.为了加快抓取模型学习进程,引入一种先验知识引导的自监督学习策略,并利用220种不规则物体进行抓取学习.在仿真和真实环境下分别进行实验,结果表明该抓取模型适用于多物体、堆叠物体、未知不规则物体、物体位姿随机等多种抓取场景,其抓取准确率和探测速度较其他基准方法有明显提升.整个学习过程历时10天,结果表明使用先验知识引导的学习策略能显著加快学习进程.     

A Fast Dual Algorithm for Kernel Logistic Regression

This paper gives a new iterative algorithm for kernel logistic regression. It is based on the solution of a dual problem using ideas similar to those of the Sequential Minimal Optimization algorithm for Support Vector Machines. Asymptotic convergence of the algorithm is proved. Computational experiments show that the algorithm is robust and fast. The algorithmic ideas can also be used to give a fast dual algorithm for solving the optimization problem arising in the inner loop of Gaussian Process classifiers. Editor: Shai Ben-David     

基于先验知识的自适应多叉树防碰撞算法

为提高无线射频识别(RFID)系统快速识别大量标签的能力,提出一种基于先验知识的自适应多叉树防碰撞算法。利用标签访问的规律性和标签分布的随机性,在不同的搜索深度,根据已有的先验知识和碰撞比特信息估计待识别的标签数量,从而动态地自适应选择搜索叉树。通过有效减少碰撞和空闲时隙数,大幅提高读写器搜索和识别标签的能力。理论分析与仿真实验结果表明,该算法能克服传统自适应多叉树防碰撞算法的缺点,合理选择初始搜索叉树,尤其在待识别标签数量较多的场合,可有效提高RFID系统的吞吐率。     

Quantifying Prior Determination Knowledge Using the PAC Learning Model

Prior knowledge, or bias, regarding a concept can reduce the number of examples needed to learn it. Probably Approximately Correct (PAC) learning is a mathematical model of concept learning that can be used to quantify the reduction in the number of examples due to different forms of bias. Thus far, PAC learning has mostly been used to analyzesyntactic bias, such as limiting concepts to conjunctions of boolean prepositions. This paper demonstrates that PAC learning can also be used to analyzesemantic bias, such as a domain theory about the concept being learned. The key idea is to view the hypothesis space in PAC learning as that consistent withall prior knowledge, syntactic and semantic. In particular, the paper presents an analysis ofdeterminations, a type of relevance knowledge. The results of the analysis reveal crisp distinctions and relations among different determinations, and illustrate the usefulness of an analysis based on the PAC learning model.     

基于线性规划支持向量回归的混沌系统预测

支持向量机是一种基于统计学习理论的新颖的机器学习方法,该方法已经广泛用于解决分类与回归问题。标准的支持向量机算法需要解一个二次规划问题,当训练样本较多时,其运算速度一般很慢。为了提高运算速度,介绍了一种基于线性规划的支持向量回归算法,并由此提出几种新的回归模型,同时将它们应用到混沌时间序列预测中,并比较了它们的预测性能。在实际应用中,可以根据具体情况灵活地选择所需模型。     

A Structure Learning Algorithm for Bayesian Network Using Prior Knowledge

Learning structure from data is one of the most important fundamental tasks of Bayesian network research. Particularly, learning optional structure of Bayesian network is a non-deterministic polynomial...