不完备序值决策系统中的拓展粗集模型及集对分析

在不完备序值决策系统中,根据容差优势关系进行分类过于宽松,而相似优势关系过于严格,根据这样的解释,提出了基于限制容差优势关系的粗糙集模型.进一步地,在不完备序值决策系统中,引入集对分析方法,提出了基于联系度的优势关系粗糙集模型,并进行了实例分析以说明新提出优势关系的有效性.     

基于共同邻居惩罚的复杂网络链路预测方法

链接预测是确定用户间关系的基本工具。通过相似性度量进行链路预测是一种常见的方法,提出一种基于相似度的链路预测算法,根据网络结构及拓扑特性来确定相似度,引入优化链路预测度量方法,将聚类系数作为网络结构性质。此外,并考虑共享邻域,得到较其他同类链路预测方法更好的性能。实验结果表明,提出的算法性能优于经典算法。结合在Facebook、Twitter与新浪微博等社交网络环境中的实验结果可知,SLP-CNP法较其他算法具有更优精度与效率。在未来的工作中,还可尝试在所提方法的基础上,提升在加权网络、有向网络和二部网络中的适用性。     

Multi-view spectral clustering via constrained nonnegative embedding

Multi-view clustering has attracted much attention recently. Among all clustering approaches, spectral ones have gained much popularity thanks to an elaborated and solid theoretical foundation. A major limitation of spectral clustering based methods is that these methods only provide a non-linear projection of the data, to which an additional step of clustering is required. This can degrade the quality of the final clustering due to various factors such as the initialization process or outliers. To overcome these challenges, this paper presents a constrained version of a recent method called Multiview Spectral Clustering via integrating Nonnegative Embedding and Spectral Embedding. Besides retaining the advantages of this method, our proposed model integrates two types of constraints: (i) a consistent smoothness of the nonnegative embedding over all views and (ii) an orthogonality constraint over the columns of the nonnegative embedding. Experimental results on several real datasets show the superiority of the proposed approach.     

Cross-domain representation learning by domain-migration generative adversarial network for sketch based image retrieval

Sketch based image retrieval (SBIR), which uses free-hand sketches to search the images containing similar objects/scenes, is attracting more and more attentions as sketches could be got more easily with the development of touch devices. However, this task is difficult as the huge differences between sketches and images. In this paper, we propose a cross-domain representation learning framework to reduce these differences for SBIR. This framework aims to transfer sketches to images with the information learned both in the sketch domain and image domain by the proposed domain migration generative adversarial network (DMGAN). Furthermore, to reduce the representation gap between the generated images and natural images, a similarity learning network (SLN) is also proposed with the new designed loss function incorporating semantic information. Extensive experiments have been done from different aspects, including comparison with state-of-the-art methods. The results show that the proposed DMGAN and SLN really work for SBIR.     

基于数据压缩的文本相似性计算

利用数据压缩原理，对文本文档进行压缩，由压缩比公式得到相似值．与基于统计的传统方法相比，它具有简便快速的特点．     

结合颜色和空间信息的图像检索方法

本文采用了结合空间信息和图像颜色特征的颜色关联图方法。在特征度量时，依据所设计的评价试验，对四种距离度量方法进行了比较。将所选方法应用于西北大学可视化研究所开发的医学影像数据库系统中。实验表明，所述的图像检索方法具有较好的查全率与查准率。     

基于小波模糊聚类的均质纹理和非均质纹理图象检索

基于内容的图象检索是近年来的研究热点 ,为此提出了一种自动区分均质纹理和非均质纹理图象 ,并对这两类图象分别进行检索的算法 .算法首先从图象离散小波变换的低频子带提取一定的颜色和纹理特征用于模糊聚类 ,将图象的低频子带分割为一定的区域 ;然后根据分割的结果将图象自动语义分类为均质纹理或者非均质纹理图象 ;最后对均质纹理和非均质纹理图象分别提取不同的特征矢量 ,并按照一定的相似度准则检索图象 .实验结果表明 ,该算法具有良好的均质纹理和非均质纹理图象分类和检索性能 .     

Pedestrian registration in static images with unconstrained background

This paper introduces a human body contour registration method for static pedestrian images with unconstrained backgrounds. By using a statistical compound model to impose structural and textural constraints on valid pedestrian appearances, the matching process is robust to image clutter. Experimental results show that the proposed method register pedestrian contours in complex backgrounds effectively.     

联想的空间模型

本文讨论了联想的认知概念,归纳出了联想的一般性原理。通过开放对象之间的相似方式,构造了它的度量空间模型,并进一步诱导出更一般的拓扑空间模型,定义了距离、邻域等空间模型,同时得出一些重要的结论。     

建模与仿真过程及模型VV＆A

首先概括了建模与仿真的一般过程 ,给出了有关VV&A的几个基本概念。然后简要地分析了同构、同态与建模及模型VV&A之间的关系 ,最后对现有VV&A技术进行了综述。有关置信度评估方法还很不成熟 ,从概念到理论都有待于统一 ,文章对此做了一点探索