基于多层特征的字符串相似度计算模型

针对计算字符串相似度传统方法的不足之处,提出以相似元作为字符串的基本处理单元,综合考虑相似元的字面、语义及统计关联等多层特征的字符串相似度计算方法.对常规计算方法中存在的,由相似元排序引起的相似元位置信息丢失问题进行了修正.实验结果表明该算法的有效性,并且对句子间、段落间的相似度计算有启发意义.

Task-oriented web service discovery algorithm using semantic similarity for adaptive service composition

In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition （TWC） graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.

Clustering analysis algorithm for security supervising data based on semantic description in coal mines

In order to mine production and security information from security supervising data and to ensure security and safety involved in production and decision-making,a clustering analysis algorithm for security supervising data based on a semantic description in coal mines is studied.First,the semantic and numerical-based hybrid description method of security supervising data in coal mines is described.Secondly,the similarity measurement method of semantic and numerical data are separately given and a weight-based hybrid similarity measurement method for the security supervising data based on a semantic description in coal mines is presented.Thirdly,taking the hybrid similarity measurement method as the distance criteria and using a grid methodology for reference,an improved CURE clustering algorithm based on the grid is presented.Finally,the simulation results of a security supervising data set in coal mines validate the efficiency of the algorithm.

Reducing semantic bias of annotations for semantic web service discovery

In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the description context and generating refined semantic annotations, and then the semantics of the web service is refined. These restrictions are dynamically extracted from the parsing tree of the description text, with the guide of the restriction template extracted from the ontology definition. New semantic annotations are then generated by combining the original concept with the restrictions and represented via refined concept expressions. In addition, a novel semantic similarity measure for refined concept expressions is proposed for semantic web service discovery. Experimental results show that the matchmaker based on this method can improve the average precision of discovery and exhibit low computational complexity. Reducing the semantic bias by utilizing restriction information of annotations can refine the semantics of the web service and improve the discovery effectiveness.

Enabling weakened hedges in linguistic multi-criteria decision making

A semantics-based model is proposed to enable weakened hedges, such as ＂more or less＂ and ＂roughly＂ in the context of linguistic multi-criteria decision making. First, the resemblance relations are defined based on the semantics of terms on the domain. Then, the hedges can be represented after the upper and loose upper approximations of a linguistic term are derived. Accordingly, some compact formulae can be derived for the semantics of linguistic expressions with hedges. Parameters in these formulae are objectively determined according to the semantics of original terms. The proposed model presents a more natural way to express the decision information under uncertainties and its semantics is clear. The proposed model is clarified by solving the problem of evaluation and selection of sustainable innovative energy technologies. Computational results demonstrate that the model can deal with various uncertainties of the problem. Finally, the model is compared with existing techniques and extended to the case when the semantics of terms are represented by trapezoidal fuzzy numbers.

Service composition algorithm using semantic constraint to implement user personality

In order to improve the efficiency and quality of service composition,a service composition algorithm based on semantic constraint is proposed.First, a user’s requirements and services from a service repository are compared with the help of a matching algorithm.The algorithm has two levels and filters out the services which do not match the user’s constraint personality requirements.The mechanism can reduce the searching scope at the beginning of the service composition algorithm.Secondly,satisfactions of those selected services for the user’s personality requirements are computed and those services,which have the greatest satisfaction value to make up the service composition,are used.The algorithm is evaluated analytically and experimentally based on the efficiency of service composition and satisfaction for the user’s personality requirements.

An Alternative-Service Recommending Algorithm Based on Semantic Similarity

With the development of the Internet of Things(Io T), people's lives have become increasingly convenient. It is desirable for smart home(SH) systems to integrate and leverage the enormous information available from IoT. Information can be analyzed to learn user intentions and automatically provide the appropriate services. However, existing service recommendation models typically do not consider the services that are unavailable in a user's living environment. In order to address this problem, we propose a series of semantic models for SH devices. These semantic models can be used to infer user intentions. Based on the models, we proposed a service recommendation probability model and an alternative-service recommending algorithm. The algorithm is devoted to providing appropriate alternative services when the desired service is unavailable. The algorithm has been implemented and achieves accuracy higher than traditional Hidden Markov Model(HMM). The maximum accuracy achieved is 68.3%.

SERVICE COMMUNITY CONSTRUCTION METHOD OF INTERNET OF THINGS BASED ON SEMANTIC SIMILARITY

Internet of Things (IoT) as an important and ubiquitous service paradigm is one of the most important issues in IoT applications to provide terminal users with effective and efficient services based on service community. This paper presents a semantic-based similarity algorithm to build the IoT service community. Firstly, the algorithm reflects that the nodes of IoT contain a wealth of semantic information and makes them to build into the concept tree. Then tap the similarity of the semantic information based on the concept tree. Finally, we achieve the optimization of the service community through greedy algorithm and control the size of the service community by adjusting the threshold. Simulation results show the effectiveness and feasibility of this algorithm.

Vari-gram language model based on word clustering

Category-based statistic language model is an important method to solve the problem of sparse data.But there are two bottlenecks:1) The problem of word clustering.It is hard to find a suitable clustering method with good performance and less computation.2) Class-based method always loses the prediction ability to adapt the text in different domains.In order to solve above problems,a definition of word similarity by utilizing mutual information was presented.Based on word similarity,the definition of word set similarity was given.Experiments show that word clustering algorithm based on similarity is better than conventional greedy clustering method in speed and performance,and the perplexity is reduced from 283 to 218.At the same time,an absolute weighted difference method was presented and was used to construct vari-gram language model which has good prediction ability.The perplexity of vari-gram model is reduced from 234.65 to 219.14 on Chinese corpora,and is reduced from 195.56 to 184.25 on English corpora compared with category-based model.

Research on Semantic and Cache Model of Relational Database

The paper firstly analyze cache replacement strategies at present, and proposed the ideas of the semantic query cache replacement based on user access features, and describe the semantic similarity calculation and realize the algorithm of replacement strategy. The strategy use semantic to match information in the query cache, through dynamic analysis and tracking three characteristics of user access time, user access to content and Business Association, give out the similarity minimum of the cache item, to improve the hit ratio of the cache and the response time and throughput of the server is improved.

Prioritization of orphan disease-causing genes using topological feature and GO similarity between proteins in interaction networks

Identification of disease-causing genes among a large number of candidates is a fundamental challenge in human disease studies.However,it is still time-consuming and laborious to determine the real disease-causing genes by biological experiments.With the advances of the high-throughput techniques,a large number of protein-protein interactions have been produced.Therefore,to address this issue,several methods based on protein interaction network have been proposed.In this paper,we propose a shortest path-based algorithm,named SPranker,to prioritize disease-causing genes in protein interaction networks.Considering the fact that diseases with similar phenotypes are generally caused by functionally related genes,we further propose an improved algorithm SPGOranker by integrating the semantic similarity of gene ontology(GO)annotations.SPGOranker not only considers the topological similarity between protein pairs in a protein interaction network but also takes their functional similarity into account.The proposed algorithms SPranker and SPGOranker were applied to 1598 known orphan disease-causing genes from 172 orphan diseases and compared with three state-of-the-art approaches,ICN,VS and RWR.The experimental results show that SPranker and SPGOranker outperform ICN,VS,and RWR for the prioritization of orphan disease-causing genes.Importantly,for the case study of severe combined immunodeficiency,SPranker and SPGOranker predict several novel causal genes.