On a reflexivity-preserving family of cardinality-based fuzzy comparison measures

In this paper, we generalize and extend previous work on a triparametric family of cardinality-based fuzzy similarity measures. More specifically, we (i) generalize this family to a broader family of fuzzy comparison measures, (ii) summarize previously obtained results regarding this family and fill up a few gaps by adding some novel results, (iii) compare our parametric family with an already existing one, and (iv) elaborate on the ranking invariance between certain members of the presented triparametric family of cardinality-based fuzzy comparison measures.     

Distance browsing in distributed multimedia databases

The state of the art of searching for non-text data (e.g., images) is to use extracted metadata annotations or text, which might be available as a related information. However, supporting real content-based audiovisual search, based on similarity search on features, is significantly more expensive than searching for text. Moreover, such search exhibits linear scalability with respect to the dataset size, so parallel query execution is needed.In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DINN) for finding closest objects in an incremental fashion over data distributed among computer nodes, each able to perform its local Incremental Nearest Neighbor (local-INN) algorithm. We prove that our algorithm is optimum with respect to both the number of involved nodes and the number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN, was used for conducting an extensive experimental evaluation on a real-life dataset.The proposed algorithm is being used in two running projects: SAPIR and NeP4B.     

An enhanced Web page change detection approach based on limiting similarity computations to elements of same type

This paper describes an efficient Web page detection approach based on restricting the similarity computations between two versions of a given Web page to the nodes with the same HTML tag type. Before performing the similarity computations, the HTML Web page is transformed into an XML-like structure in which a node corresponds to an open-closed HTML tag. Analytical expressions and supporting experimental results are used to quantify the improvements that are made when comparing the proposed approach to the traditional one, which computes the similarities across all nodes of both pages. It is shown that the improvements are highly dependent on the diversity of tags in the page. That is, the more diverse the page is (i.e., contains mixed content of text, images, links, etc.), the greater the improvements are, while the more uniform it is, the lesser they are.     

Entropy of interval-valued fuzzy sets based on distance and its relationship with similarity measure

This article proposes a new axiomatic definition of entropy of interval-valued fuzzy sets (IVFSs) and discusses its relation with similarity measure. First, we propose an axiomatic definition of entropy for IVFS based on distance which is consistent with the axiomatic definition of entropy of a fuzzy set introduced by De Luca, Termini and Liu. Next, some formulae are derived to calculate this kind of entropy. Furthermore we investigate the relationship between entropy and similarity measure of IVFSs and prove that similarity measure can be transformed by entropy. Finally, a numerical example is given to show that the proposed entropy measures are more reasonable and reliable for representing the degree of fuzziness of an IVFS.     

基于特征向量匹配的舞蹈实时姿态分析方法

针对人体运动姿态可自由编辑的特性,提取人体骨架模型,建立人体运动姿态模型库,分析了运动捕捉系统在舞蹈训练中的应用,提出基于特征平面间相似性匹配的方法来计算模型各部件间运动数据参数。经过验证,该方法对于人体姿态的分析具有较高的准确性、鲁棒性,使得舞蹈演员能够准确的对比出与标准舞蹈动作的差异,为舞蹈者进行科学舞蹈训练提供了理论支持。     

多维度的安卓应用相似度分析

基于安卓的智能设备的普及和移动互联网的发展带来了安卓应用的繁荣,但同时也带来了移动应用的开发、维护、安全等方面的问题。采取了多种技术,提取了安卓应用的功能描述、权限声明及源代码,并基于这些信息对1173个安卓应用进行了统计分析、相似度计算、聚类以及交叉对比;利用多个维度的安卓应用特征相似度分析,初步得到了安卓应用多个维度的相关规律,其可辅助不同的安卓应用的开发和管理任务,如权限过度声明检测、重打包检测、应用描述完善、领域内的公共类库的发现和提取等,从而帮助改善安卓市场的生态并提高安卓应用的开发效率。     

基于相似度的多粒度不确定语言群决策方法

针对具有多粒度不确定语言评价信息的多属性群决策问题,提出了一种基于区间二元语义信息处理和矢量相似度的群决策方法,弥补了基于距离测度的决策方法易造成信息混淆的不足。该方法首先使用二元语义转换函数对多粒度区间语言评价信息进行一致化处理;然后通过建立使备选方案对正理想解相似度最大、负理想解相似度最小的最优化模型来获得相应的属性权重;最后利用区间二元语义的集结算子对评价信息进行加权集成,并通过优序数排序法实现对各方案的排序。实例分析说明了该方法的可行性和有效性。     

基于相似度传播的二分网络链接预测

链接预测是复杂网络分析中的重要研究问题。提出了一个基于链接相似度传播的二部图链路预测算法。该算法将链接相似度得分通过随机游走在网络中进行传播和更新。在该算法中,网络里的每一条边都被分配一个基于相似度的传播概率。不同部分的节点之间的链接相似性得分根据它们的边的传播概率来传播。在不同大小的真实社交网络上的实验结果证明,该算法可以取得比其他算法更精确的预测结果。     

基于标签相似度计算的学术圈构建方法

为面向学者的社交网络系统中的用户构建学术圈,对促进学者之间的交流具有重要的应用价值。根据学者之间的共同属性进行相似度计算,形成学术领域相似和研究课题相近的学术圈,能让学者们更加紧密和频繁地协同合作。提出了利用学者的学术信息提取代表个人特征的学术标签,并对不同类别标签的权重进行衡量,再通过相似度计算和聚类算法构建学术圈的方法。通过抓取学者社交网络平台SCHOLAT公开的学者信息进行实验,进而验证所提方法的可靠性和实用性。     

Similarity/dissimilarity calculation methods of DNA sequences: A survey

DNA sequence similarity/dissimilarity analysis is a fundamental task in computational biology, which is used to analyze the similarity of different DNA sequences for learning their evolutionary relationships. In past decades, a large number of similarity analysis methods for DNA sequence have been proposed due to the ever-growing demands. In order to learn the advances of DNA sequence similarity analysis, we make a survey and try to promote the development of this field. In this paper, we first introduce the related knowledge of DNA similarities analysis, including the data sets, similarities distance and output data. Then, we review recent algorithmic developments for DNA similarity analysis to represent a survey of the art in this field. At last, we summarize the corresponding tendencies and challenges in this research field. This survey concludes that although various DNA similarity analysis methods have been proposed, there still exist several further improvements or potential research directions in this field.