Evolutionary approach for semantic-based query sampling in large-scale information sources

Metadata about information sources (e.g., databases and repositories) can be collected by Query Sampling (QS). Such metadata can include topics and statistics (e.g., term frequencies) about the information sources. This provides important evidence for determining which sources in the distributed information space should be selected for a given user query. The aim of this paper is to find out the semantic relationships between the information sources in order to distribute user queries to a large number of sources. Thereby, we propose an evolutionary approach for automatically conducting QS using multiple crawlers and obtaining the optimized semantic network from the sources. The aim of combining QS and evolutionary methods is to collaboratively extract metadata about target sources and optimally integrate the metadata, respectively. For evaluating the performance of contextualized QS on 122 information sources, we have compared the ranking lists recommended by the proposed method with user feedback (i.e., ideal ranks), and also computed the precision of the discovered subsumptions in terms of the semantic relationships between the target sources.     

Identifying Extract Class refactoring opportunities using structural and semantic cohesion measures

Approaches for improving class cohesion identify refactoring opportunities using metrics that capture structural relationships between the methods of a class, e.g., attribute references. Semantic metrics, e.g., C3 metric, have also been proposed to measure class cohesion, as they seem to complement structural metrics. However, until now semantic relationships between methods have not been used to identify refactoring opportunities. In this paper we propose an Extract Class refactoring method based on graph theory that exploits structural and semantic relationships between methods. The empirical evaluation of the proposed approach highlighted the benefits provided by the combination of semantic and structural measures and the potential usefulness of the proposed method as a feature for software development environments.     

Semantic business process integration based on ontology alignment

Innovation and agility should be provided to businesses by efficient collaboration (i.e., communication and sharing) between them. However, semantic heterogeneity between business processes is a serious problem for automatically supporting cooperation processes (e.g., knowledge sharing and querying-based interactions) between businesses. In order to overcome this problem, we propose a novel framework based on aligning business ontologies for integrating heterogeneous business processes. We can consider two types of alignment processes; (i) manual alignment for building a whole business process ontology in a business process management (BPM) system and (ii) automated alignment between business processes of different BPM systems. Thereby, the optimal integration between two business processes has to be discovered to maximize the summation of a set of partial similarities between semantic components consisting of the business processes. In particular, the semantic component are extracted from semantic annotations of business processes. For evaluating the proposed system, we have conducted experimentations by using 22 business process management systems, which are organized as six business alliances. We have assumed that business processes in a same BPM system should be built with a common ontologies. The proposed alignment method has shown about 71.3% of precision (65.4% of recall). In addition, we found out that alignment results are dependent on some characteristics of ontologies (e.g., depth and number of classes).     

一种融合关系路径与实体描述信息的知识图谱表示学习方法

知识图谱表示学习旨在通过学习的方法将知识图谱中的实体和关系映射到一个连续的低维向量空间而获得其向量表示.已有的知识图谱表示学习方法大多仅从三元组角度考虑实体间的单步关系,未能有效利用多步关系路径及其实体描述等重要信息,从而影响性能.针对上述问题,提出了一种融合关系路径与实体描述的知识图谱表示学习模型.首先,对知识图谱中的多步关系路径进行联合表示,将路径上的所有关系和实体相加,得到关系路径信息的表示;其次,使用BERT(bidirectional encoder representations from transformers)模型对实体描述信息进行编码,得到相对应的语义表示;最后,对知识图谱中的三元组表示、实体描述的语义表示以及关系路径的表示进行融合训练,得到融合向量表示.在FB15K,WN18,FB15K-237,WN18RR数据集上,对提出的模型和基准模型进行链接预测和三元组分类任务,实验结果表明,与现有的基准模型相比,该模型在2项任务中均具有更高的准确性,证明了方法的有效性和优越性.     

Semantic conflict resolution ontology (SCROL): an ontology for detecting and resolving data and schema-level semantic conflicts

Establishing semantic interoperability among heterogeneous information sources has been a critical issue in the database community for the past two decades. Despite the critical importance, current approaches to semantic interoperability of heterogeneous databases have not been sufficiently effective. We propose a common ontology called semantic conflict resolution ontology (SCROL) that addresses the inherent difficulties in the conventional approaches, i.e., federated schema and domain ontology approaches. SCROL provides a systematic method for automatically detecting and resolving various semantic conflicts in heterogeneous databases. SCROL provides a dynamic mechanism of comparing and manipulating contextual knowledge of each information source, which is useful in achieving semantic interoperability among heterogeneous databases. We show how SCROL is used for detecting and resolving semantic conflicts between semantically equivalent schema and data elements. In addition, we present evaluation results to show that SCROL can be successfully used to automate the process of identifying and resolving semantic conflicts.     

P2P网络中基于本体的语义信息交互机制*

摘要：为提高P2P信息共享系统中的语义信息交互能力,提出了节点资源元数据本体模型,对资源元数据的共性进行建模,增加了资源元数据描述的清晰度和资源元数据间的语义联系。在此基础上,考虑丰富的语义和上下文信息,提出了一种基于本体匹配的语义信息交互机制,节点通过自主处理、理解和解释语义层次的信息,支持语义丰富的分布式信息共享。     

语言结构引导的可解释视频语义描述

视频描述技术旨在为视频自动生成包含丰富内容的文字描述,近年来吸引了广泛的研究兴趣.一个准确而精细的视频描述生成方法,不仅需要对视频有全局上的理解,更离不开具体显著目标的局部空间和时序特征.如何建模一个更优的视频特征表达,一直是视频描述工作的研究重点和难点.另一方面,大多数现有工作都将句子视为一个链状结构,并将视频描述任务视为一个生成单词序列的过程,而忽略了句子的语义结构,这使得算法难以应对和优化复杂的句子描述及长句子中易引起的逻辑错误.为了解决上述问题,提出一种新颖的语言结构引导的可解释视频语义描述生成方法,通过设计一个基于注意力的结构化小管定位机制,充分考虑局部对象信息和句子语义结构.结合句子的语法分析树,所提方法能够自适应地加入具有文本内容的相应时空特征,进一步提升视频描述的生成效果.在主流的视频描述任务基准数据集MSVD和MSR-VTT上的实验结果表明,所提出方法在大多数评价指标上都达到了最先进的水平.     

基于本体和语义文法的上下文相关问答

在问答系统中,用户的提问通常不是孤立的,而是使用连续的多个相关的问题来获取信息,用户在与这样的系统进行交互时,才会感觉更自然。在已构建的非上下文相关问答系统的基础上,该文提出了一种可以处理上下文相关问题的方法并开发了系统OSG-IQAs。方法首先识别当前问题是否是一个从问题(follow-up),并判别其与前面问题的具体的相关类别,然后根据相关类别,利用话语结构中的信息对当前的follow-up问题进行重构,并提交到非上下文相关问答系统中。最后,将方法在两个不同规模的领域进行测试,并与相关系统或方法进行比较,测试结果表明,该方法具有较好的可扩展性。在总体测试中,该方法比基线系统获得了更好地效果,同时利用手工将所有上下文相关问题进行上下文消解,系统与此也进行了比较,并获得了相近的性能。     

面向虚拟组织资源发现的语义模糊匹配

资源发现是虚拟组织提供资源共享和协同工作的前提。本文首先提出一种支持资源动态匹配的资源发现结构;然后针对传统资源匹配技术的不足,在资源元数据本体描述的基础上,结合概念的语言特征和语义特征,提出一种语义模糊匹配算法。通过语义相似度的计算,进而对语义关联进行分类,实现了一定程度的资源模糊匹配,为资源发现提供了新的解决方法。     

Measuring semantic similarity between words by removing noise and redundancy in web snippets

Semantic similarity measures play important roles in many Web‐related tasks such as Web browsing and query suggestion. Because taxonomy‐based methods can not deal with continually emerging words, recently Web‐based methods have been proposed to solve this problem. Because of the noise and redundancy hidden in the Web data, robustness and accuracy are still challenges. In this paper, we propose a method integrating page counts and snippets returned by Web search engines. Then, the semantic snippets and the number of search results are used to remove noise and redundancy in the Web snippets (‘Web‐snippet’ includes the title, summary, and URL of a Web page returned by a search engine). After that, a method integrating page counts, semantics snippets, and the number of already displayed search results are proposed. The proposed method does not need any human annotated knowledge (e.g., ontologies), and can be applied Web‐related tasks (e.g., query suggestion) easily. A correlation coefficient of 0.851 against Rubenstein–Goodenough benchmark dataset shows that the proposed method outperforms the existing Web‐based methods by a wide margin. Moreover, the proposed semantic similarity measure significantly improves the quality of query suggestion against some page counts based methods. Copyright © 2011 John Wiley & Sons, Ltd.     

Image retrieval based on incremental subspace learning

Many problems in information processing involve some form of dimensionality reduction, such as face recognition, image/text retrieval, data visualization, etc. The typical linear dimensionality reduction algorithms include principal component analysis (PCA), random projection, locality-preserving projection (LPP), etc. These techniques are generally unsupervised which allows them to model data in the absence of labels or categories. In this paper, we propose a semi-supervised subspace learning algorithm for image retrieval. In relevance feedback-driven image retrieval system, the user-provided information can be used to better describe the intrinsic semantic relationships between images. Our algorithm is fundamentally based on LPP which can incorporate user's relevance feedbacks. As the user's feedbacks are accumulated, we can ultimately obtain a semantic subspace in which different semantic classes can be best separated and the retrieval performance can be enhanced. We compared our proposed algorithm to PCA and the standard LPP. Experimental results on a large collection of images have shown the effectiveness and efficiency of our proposed algorithm.     

Community-Aware Resource Profiling for Personalized Search in Folksonomy

In recent years,there is a fast proliferation of collaborative tagging(a.k.a.folksonomy) systems in Web 2.0 communities.With the increasingly large amount of data,how to assist users in searching their interested resources by utilizing these semantic tags becomes a crucial problem.Collaborative tagging systems provide an environment for users to annotate resources,and most users give annotations according to their perspectives or feelings.However,users may have different perspectives or feelings on resources,e.g.,some of them may share similar perspectives yet have a conflict with others.Thus,modeling the profile of a resource based on tags given by all users who have annotated the resource is neither suitable nor reasonable.We propose,to tackle this problem in this paper,a community-aware approach to constructing resource profiles via social filtering.In order to discover user communities,three different strategies are devised and discussed.Moreover,we present a personalized search approach by combining a switching fusion method and a revised needs-relevance function,to optimize personalized resources ranking based on user preferences and user issued query.We conduct experiments on a collected real life dataset by comparing the performance of our proposed approach and baseline methods.The experimental results verify our observations and effectiveness of proposed method.     

Rumor detection with self-supervised learning on texts and social graph

Rumor detection has become an emerging and active research field in recent years. At the core is to model the rumor characteristics inherent in rich information, such as propagation patterns in social network and semantic patterns in post content, and differentiate them from the truth. However, existing works on rumor detection fall short in modeling heterogeneous information, either using one single information source only (e.g., social network, or post content) or ignoring the relations among multiple sources (e.g., fusing social and content features via simple concatenation).Therefore, they possibly have drawbacks in comprehensively understanding the rumors, and detecting them accurately. In this work, we explore contrastive self-supervised learning on heterogeneous information sources, so as to reveal their relations and characterize rumors better. Technically, we supplement the main supervised task of detection with an auxiliary self-supervised task, which enriches post representations via post self-discrimination.Specifically, given two heterogeneous views of a post (i.e., representations encoding social patterns and semantic patterns), the discrimination is done by maximizing the mutual information between different views of the same post compared to that of other posts. We devise cluster-wise and instance-wise approaches to generate the views and conduct the discrimination, considering different relations of information sources. We term this framework as self-supervised rumor detection (SRD). Extensive experiments on three real-world datasets validate the effectiveness of SRD for automatic rumor detection on social media.     

一种基于XML的信息搜索技术

以XML形式组织的数据结构层次清晰,语义明确。本文利用XML技术的这一特点,提出了一种基于XML的信息搜索方法：以用户需求信息的结构为基准,根据拓扑匹配原则,以倒向路径（L-R）的拓扑匹配为出发点,给出了信息搜索时有关用户需求在某一数据源中的匹配度Tmd计算方法。