一种基于节点行为模式的相似性指标

手持设备网络（PSN）是一种利用节点移动和机会性相遇进行数据交互的延迟容忍网络（DTN）.由于PSN具有网络拓扑不断变化、节点间链接时变性等特点,导致常用的节点间相似性评价方法不能很好地被应用于PSN的链路预测.针对PSN网络节点的行为特点,分析节点间产生连接次数、连接持续时间以及节点访问区域的规律,将PSN网络中节点的相似性分为节点社交行为相似性和移动行为相似性.结合社交行为相似性以及节点移动行为相似性,比较其在不同加权系数下的AUC和Precision,提出基于节点行为模式的相似性指标（SNBP）.在MIT Reality以及Dartmouth Campus数据集上的结果表明：与CN、AA和Katz相似性指标相比,所提出的相似性指标具有更好的预测准确率.     

基于知网与搜索引擎的词汇语义相似度计算

提出一种基于知网与搜索引擎的词汇语义相似度计算方法。利用义原在层次体系树的深度、密度、信息量优化义原的相似性计算。将逐点共有信息（PMI）算法与归一化谷歌距离（NGD）算法结合优化基于搜索引擎的词汇语义相似度计算。将词汇的词性作为权重因子融合知网与搜索引擎的词汇相似度计算结果。实验结果表明,与基于知网和基于搜索引擎的语义相似度计算方法相比,所提出的方法在NLPCC测试集上的平均相似度更接近于测试集的评测标准,在汽车票务领域的词汇相似度计算中具有较好的应用效果。     

A new similarity computing method based on concept similarity in Chinese text processing

The paper proposes a new text similarity computing method based on concept similarity in Chinese text processing. The new method converts text to words vector space model at first, and then splits words into a set of concepts. Through computing the inner products between concepts, it obtains the similarity between words. The new method computes the similarity of text based on the similarity of words at last. The contributions of the paper include： 1） propose a new computing formula between words; 2） propose a new text similarity computing method based on words similarity; 3） successfully use the method in the application of similarity computing of WEB news; and 4） prove the validity of the method through extensive experiments.     

Using Fuzzy Ontology to Improve Similarity Assessment: Method and Evaluation

Assessing semantic similarity is a fundamental requirement for many AI applications. Crisp ontology (CO) is one of the knowledge representation tools that can be used for this purpose. Thanks to the development of semantic web, CO‐based similarity assessment has become a popular approach in recent years. However, in the presence of vague information, CO cannot consider uncertainty of relations between concepts. On the other hand, fuzzy ontology (FO) can effectively process uncertainty of concepts and their relations. This paper aims at proposing an approach for assessing concept similarity based on FO. The proposed approach incorporates fuzzy relation composition in combination with an edge counting approach to assess the similarity. Accordingly, proposed measure relies on taxonomical features of an ontology in combination with statistical features of concepts. Furthermore, an evaluation approach for the FO‐based similarity measure named as FOSE is proposed. Considering social network data, proposed similarity measure is evaluated using FOSE. The evaluation results prove the dominance of proposed approach over its respective CO‐based measure.     

基于《知网》的词语相似度算法研究

基于《知网》的词语(句子)相似度计算通常是把义原(词语)之间的最优匹配做为运算的基本单位的,最终的整体相似度数值可由每一部分的相似度值通过适当的加权计算合成而来,这样的做法往往会造成一些匹配对的信息重复和结构不合理。针对这个问题,该文通过统计出两个直接义原集合间的共有信息(共性)和差异信息(个性)来计算集合的相似度,并把此方法引入到词语(句子)的相似度计算中去。最终的实验比对结果表明该文所采用的方法更为稳定和有效。     

Similarity-margin based feature selection for symbolic interval data

In this paper we propose a feature selection method for symbolic interval data based on similarity margin. In this method, classes are parameterized by an interval prototype based on an appropriate learning process. A similarity measure is defined in order to estimate the similarity between the interval feature value and each class prototype. Then, a similarity margin concept has been introduced. The heuristic search is avoided by optimizing an objective function to evaluate the importance (weight) of each interval feature in a similarity margin framework. The experimental results show that the proposed method selects meaningful features for interval data. In particular, the method we propose yields a significant improvement on classification task of three real-world datasets.     

汉语句子相似度计算在FAQ中的应用

通过对传统的汉语句子相似度模型进行改进,提出一种基于关键词加权的汉语句子相似度计算方法,在此基础上实现一个基于常问问题库的中文问答系统。该系统通过将用户输入的自然语言问句与常问问题库中的候选问题集进行相似度计算,自动返回最匹配的答案给用户,自动更新和维护常问问题库。实验结果表明该方法在问旬匹配上比传统方法具有更高的准确率。     

An algorithm for distorted fingerprint matching based on local triangle feature set

Coping with nonlinear distortions in fingerprint matching is a challenging task. This paper proposes a novel method, a fuzzy feature match (FFM) based on a local triangle feature set to match the deformed fingerprints. The fingerprint is represented by the fuzzy feature set: the local triangle feature set. The similarity between the fuzzy feature set is used to characterize the similarity between fingerprints. A fuzzy similarity measure for two triangles is introduced and extended to construct a similarity vector including the triangle-level similarities for all triangles in two fingerprints. Accordingly, a similarity vector pair is defined to illustrate the similarities between two fingerprints. The FFM method maps the similarity vector pair to a normalized value which quantifies the overall image to image similarity. The proposed algorithm has been evaluated with NIST 24 and FVC2004 fingerprint databases. Experimental results confirm that the proposed FFM based on the local triangle feature set is a reliable and effective algorithm for fingerprint matching with nonlinear distortions.     

恶意代码的函数调用图相似性分析

恶意代码的相似性分析是当前恶意代码自动分析的重要部分。提出了一种基于函数调用图的恶意代码相似性分析方法,通过函数调用图的相似性距离ＳＤＭＦＧ来度量两个恶意代码函数调用图的相似性,进而分析得到恶意代码的相似性,提高了恶意代码相似性分析的准确性,为恶意代码的同源及演化特性分析研究与恶意代码的检测和防范提供了有力支持。     

Adaptive self-organized maps based on bidirectional approximate reasoning and its applications to information filtering

Similarity measuring is one substantial part in self-organizing maps (SOM) for its direct influence on the mapping results. The common used similarity measuring method – Euclidean distance cannot always express the exact similarity. In this paper, a novel adaptive self-organized maps based on bidirectional approximate reasoning (ASOMBAR) is proposed to improve the competitive and cooperative process based on the similarity measuring. Unlike the SOM, the proposed ASOMBAR employs the novel fuzzy similarity distance and fuzzy matching criterion to replace the Euclidean distance and original matching criterion, respectively. The fuzzy similarity distance describes the similarity relation more precisely than the Euclidean distance does. The fuzzy matching criterion pays more attention on the large weighted elements and less emphasis on the small weighted elements. Moreover, the new compatible topological neighborhood is also modified basing on the new fuzzy similarity distance and fuzzy matching criterion. Since the ASOMBAR network is self-organizing, the weights of the networks change adaptively according to the input changes. Compared with the well-known growing neural gas (GNG) and SOM, ASOMBAR (when λ  0.5) converges quicker to a smaller distortion error. An information filtering example is used to show the effectiveness of ASOMBAR.     

基于扩散距离和MDS的非刚性模型相似性分析

在非刚性模型相似性分析方法中, 基于测地距离的等距嵌入方法对模型拓扑变化非常敏感, 对于有局部拓扑变化的完全相似的模型也无法得到正确结果。为了弥补这一不足, 提高非刚性模型相似性分析的准确性, 将扩散距离与多维尺度分析(MDS)相结合, 计算非刚性模型的等距嵌入模型, 再利用迭代最近点(ICP)算法通过计算嵌入模型的相似性来实现原始非刚性模型的相似性分析。实例证明该方法对含有拓扑变化的非刚性模型可以得到理想的相似性分析结果。     

不确定集值数据的高效相似查询

基于可能世界的不确定集合的相似查询,从语义上或者从计算方法的角度来看,都有别于传统的确定型集合上的技术.由于集合中的项存在不确定性,即一个项出现在集合中是有一定概率的,使得传统处理集合的技术不再适用.提出了一个基于可能世界的集合期望相似度的度量公式.在期望的度量公式中,如果一对集合(X,Y)的期望相似度大于给定的阈值τ∈(0,1),则被称为相似集合对.一般的算法,在基于可能世界的情况下计算不确定集合的期望相似度,其复杂度是指数级的.提出了利用动态规划来计算集合期望相似度的算法,该算法的复杂度是多项式级别,极大地减少了计算时间.实验结果表明了基于该算法查询的可用性和高性能.     

一种基于知网的概念相似度计算方法

概念相似度计算是句子相似度计算的基础,以知网中的义原关系为依据,认为两个概念,其独立义原对相似度大小起着决定性作用;独立义原越相近,描述的信息差越小,它们的相似度也就越大.提出了一种基于知网的概念相似度的计算方法,定义了概念相似度公式.实验表明,据此计算概念相似度,在一定程度上和人的直观更加符合的结果.     

多维空间中基于模式的移动对象轨迹预测

本文在分析了现有轨迹模型基础上,提出了轨迹相似度计算模型以及基于移动对象加速度和轨迹偏转角的移动对象轨迹预测模型,综合计算和预测模型提出了移动对象轨迹预测方法. 该方法包括：1）对历史轨迹基于轨迹相似度进行聚类分析,形成训练集聚类,并基于各训练集聚类对目标移动对象的轨迹数据进行轨迹相似度并行计算,找出最大相似度的历史轨迹;2）结合历史轨迹以及移动对象加速度和轨迹偏转角的预测模型进行轨迹预测. 经过对测试轨迹集进行实验的结果表明,本方法在误差为500 m以内的预测准确率能达到90%以上,而且预测时间相对较短,具有较高的实用价值.     

基于潜在语义索引和句子聚类的中文自动文摘

自动文摘是自然语言处理领域的一项重要的研究课题.提出一种基于潜在语义索引和句子聚类的中文自动文摘方法.该方法的特色在于：使用潜在语义索引计算句子的相似度,并将层次聚类算法和K-中心聚类算法相结合进行句子聚类,这样提高了句子相似度计算和主题划分的准确性,有利于生成的文摘在全面覆盖文档主题的同时减少自身的冗余.实验结果验证了该文提出的方法的有效性,对比传统的基于聚类的自动文摘方法,该方法生成的文摘质量获得了显著的提高.     

基于概念间双向语义和多重关系的Web服务发现

如何提高Web服务的发现效果是面向服务计算领域需要解决的关键问题.针对这一问题,文中提出基于概念间双向语义和多重关系的Web服务发现方法.在计算概念相似度时,考虑语义的双向性及连接路径上的多重关系.不同于以往的服务发现方法,不仅计算服务描述中的名词和动词,还计算形容词.在名词和动词相似度计算中,涵盖继承关系(ISA)、部分整体关系(HASA)和反义关系(ANT).在形容词相似度计算中,涉及相似关系(Similar-to)和ANT.Web服务相似度的计算综合I/O和功能描述两方面内容,提高Web服务发现的准确性.通过综合数据实验充分验证文中方法的有效性,该方法具有较优的查准率、查全率及F-measure.     

Multiresolution similarity search in image databases

Typically searching image collections is based on features of the images. In most cases the features are based on the color histogram of the images. Similarity search based on color histograms is very efficient, but the quality of the search results is often rather poor. One of the reasons is that histogram-based systems only support a specific form of global similarity using the whole histogram as one vector. But there is more information in a histogram than the distribution of colors. This paper has two contributions: (1) a new generalized similarity search method based on a wavelet transformation of the color histograms and (2) a new effectiveness measure for image similarity search. Our generalized similarity search method has been developed to allow the user to search for images with similarities on arbitrary detail levels of the color histogram. We show that our new approach is more general and more effective than previous approaches while retaining a competitive performance.     

一种基于SA_LDA模型的文本相似度计算方法

计算文本的相似度是许多文本信息处理技术的基础。然而,常用的基于向量空间模型(VSM)的相似度计算方法存在着高维稀疏和语义敏感度较差等问题,因此相似度计算的效果 并不理想。在传统的LDA(Latent Dirichlet Allocation)模型的基础上,针对其需要人工确定主题数目的问题,提出了一种能通过模型自身迭代确定主题个数的自适应LDA(SA_LDA)模型。然后,将其引入文本的相似度计算中,在一定程度上解决了高维稀疏等问题。通过实验表明,该方法能自动确定模型主题的个数,并且利用该模型计算文本相似度时取得了比VSM模型更高的准确度。     

基于代表性答案选择与注意力机制的短答案自动评分

短答案自动评分是智慧教学中的一个关键问题。目前自动评分不准确的主要原因是: (1)预先给定的参考答案不能覆盖多样化的学生答题情况; (2)不能准确刻画学生答案与参考答案匹配情况。针对上述问题,该文采用基于聚类与最大相似度方法选择代表性学生答案构建更完备的参考答案,尽可能覆盖学生不同的答题情况;在此基础上,利用基于注意力机制的深度神经网络模型来提升系统对学生答案与参考答案匹配情况的刻画。相关数据集上的实验结果表明: 该文模型有效提升了自动评分的准确率。