In this paper, we present LinkingPark, an automatic semantic annotation system for tabular data to knowledge graph matching. LinkingPark is designed as a modular framework which can handle Cell-Entity Annotation (CEA), Column-Type Annotation (CTA), and Columns-Property Annotation (CPA) altogether. It is built upon our previous SemTab 2020 system, which won the 2nd prize among 28 different teams after four rounds of evaluations. Moreover, the system is unsupervised, stand-alone, and flexible for multilingual support. Its backend offers an efficient RESTful API for programmatic access, as well as an Excel Add-in for ease of use. Users can interact with LinkingPark in near real-time, further demonstrating its efficiency. 相似文献
Journal of Computer Science and Technology - Entity linking (EL) is the task of determining the identity of textual entity mentions given a predefined knowledge base (KB). Plenty of existing... 相似文献
Heterogeneous information networks, which consist of multi-typed vertices representing objects and multi-typed edges representing relations between objects, are ubiquitous in the real world. In this paper, we study the problem of entity matching for heterogeneous information networks based on distributed network embedding and multi-layer perceptron with a highway network, and we propose a new method named DEM short for Deep Entity Matching. In contrast to the traditional entity matching methods, DEM utilizes the multi-layer perceptron with a highway network to explore the hidden relations to improve the performance of matching. Importantly, we incorporate DEM with the network embedding methodology, enabling highly efficient computing in a vectorized manner. DEM’s generic modeling of both the network structure and the entity attributes enables it to model various heterogeneous information networks flexibly. To illustrate its functionality, we apply the DEM algorithm to two real-world entity matching applications: user linkage under the social network analysis scenario that predicts the same or matched users in different social platforms and record linkage that predicts the same or matched records in different citation networks. Extensive experiments on real-world datasets demonstrate DEM’s effectiveness and rationality.
In the 19th and 20th centuries, social networks have been an important topic in a wide range of fields from sociology to education. However, with the advances in computer technology in the 21st century, significant changes have been observed in social networks, and conventional networks have evolved into online social networks. The size of these networks, along with the large amount of data they generate, has introduced new social networking problems and solutions. Social network analysis methods are used to understand social network data. Today, several methods are implemented to solve various social network analysis problems, albeit with limited success in certain problems. Thus, the researchers develop new methods or recommend solutions to improve the performance of the existing methods. In the present paper, a novel optimization method that aimed to classify social network analysis problems was proposed. The problem of stance detection, an online social network analysis problem, was first tackled as an optimization problem. Furthermore, a new hybrid metaheuristic optimization algorithm was proposed for the first time in the current study, and the algorithm was compared with various methods. The analysis of the findings obtained with accuracy, precision, recall, and F-measure classification metrics demonstrated that our method performed better than other methods. 相似文献