Automatic knowledge graph construction seeks to build a knowledge graph from unstructured text in a specific domain or cross multiple domains, without human intervention. IEEE ICDM 2019 and ICBK 2019 invited teams fro...
Automatic knowledge graph construction seeks to build a knowledge graph from unstructured text in a specific domain or cross multiple domains, without human intervention. IEEE ICDM 2019 and ICBK 2019 invited teams from both degree-granting institutions and industrial labs to compete in the 2019 knowledge Graph Contest by automatically constructing knowledge graphs in at least two different domains. This article reports the outcomes of the Contest. The participants were expected to build a model to extract knowledge represented as triplets from text data and develop a web application to visualize the triplets. Awards were given to five teams. Their models and key techniques used to construct knowledge graphs are summarized.
Various tools, softwares and systems are proposed and implemented to tackle the challenges in big data on different emphases, e.g., data analysis, data transaction, data query, data storage, data visualization, data p...
详细信息
The recent trend of research is to hybridize two or several numbers of variants to find out the better quality of solution in practical optimization applications. In this paper, a new approach hybrid Grey Wolf Optimiz...
详细信息
Visualization of ontology alignment and ontology entity is becoming a method to help Solve the problem of semantic heterogeneity. This paper first introduces the basic concepts of ontology and ontology matching, and t...
详细信息
Since different ontologies are mostly developed independently, establishing meaningful links between their entities, so-called ontology matching, is critical to ensure their communication. Due to the complexity of the...
详细信息
ISBN:
(数字)9781728160924
ISBN:
(纸本)9781728160931
Since different ontologies are mostly developed independently, establishing meaningful links between their entities, so-called ontology matching, is critical to ensure their communication. Due to the complexity of the ontology matching problem, Evolutionary Algorithm (EA) can present a good methodology for determining ontology alignments. However, since none of the similarity measure can distinguish all the identical ontology entities in any context, ontology alignments generated by the automatic matching tools should be validated by the users to ensure their qualities. To improve the quality of the ontology alignment, in this work, a similarity measure is first proposed to calculate the similarity value of two ontology entities; then, an optimal model for ontology matching problem is constructed; after that, an EA-based automatic matcher is presented to solve the ontology matching problem, which can also adaptively determine the timing of getting user involved; and finally, the ontology concept hierarchy graph based reasoning approaches are proposed to tradeoff the user's workload and his work's effect. The experiment is conducted on the Interactive track provided by the Ontology Alignment Evaluation Initiative (OAEI), and the comparisons with OAEI's participants show the effectiveness of our proposal.
This paper studies a simultaneous wireless information and power transfer (SWIPT)-aware fog computing network, where a multiple antenna fog function integrated hybrid access point (F-HAP) transfers information and ene...
详细信息
This paper studies a simultaneous wireless information and power transfer (SWIPT)-aware fog computing network, where a multiple antenna fog function integrated hybrid access point (F-HAP) transfers information and energy to multiple heterogeneous single-antenna sensors and also helps some of them fulfill computing tasks. By jointly optimizing energy and information beamforming designs at the F-HAP, the bandwidth allocation and the computation offloading distribution, an optimization problem is formulated to minimize the required energy under communication and computation requirements, as well as energy harvesting constraints. Two optimal designs, i.e., fixed offloading time (FOT) and optimized offloading time (OOT) designs, are proposed. As both designs get involved in solving non-convex problems, there are no known solutions to them. Therefore, for the FOT design, the semidefinite relaxation (SDR) is adopted to solve it. It is theoretically proved that the rank-one constraints are always satisfied, so the global optimal solution is guaranteed. For the OOT design, since its non-convexity is hard to deal with, a penalty dual decomposition (PDD)-based algorithm is proposed, which is able to achieve a suboptimal solution. The computational complexity for two designs are analyzed. Numerical results show that the partial offloading mode is superior to binary benchmark modes. It is also shown that if the system is with strong enough computing capability, the OOT design is suggested to achieve lower required energy; Otherwise, the FOT design is preferred to achieve a relatively low computation complexity.
We propose a novel and efficient technique to extract individual fingerprints from a slap-image and identify them into their corresponding indices i.e. index, middle, ring or little finger of left/right hand. We pose ...
详细信息
In the past decades, with the increase of universities enrollment in China, how to relieve the pressure of the employment of college graduates has become a hot issue for the whole *** then, entrepreneurship education ...
详细信息
In the past decades, with the increase of universities enrollment in China, how to relieve the pressure of the employment of college graduates has become a hot issue for the whole *** then, entrepreneurship education has been adopted and popularized by more and more colleges and ***, there is not a very unified understanding of the definition and the way in which entrepreneurship education is carried *** on the current employment situation and the development of entrepreneurship education in colleges and universities in China, this paper proposes some rational thinking on the development of university students' entrepreneurship education in China and reiterates the connotation and implementation of entrepreneurship education.
This paper studies a security-check system at the high-speed railway stations with two types of inspection channels, including Normal channels and Green channels. Here, general passengers go through the strict inspect...
详细信息
ISBN:
(纸本)9781510863064
This paper studies a security-check system at the high-speed railway stations with two types of inspection channels, including Normal channels and Green channels. Here, general passengers go through the strict inspections in the Normal channels with unlimited waiting space, whereas special passengers are offered a fast inspection in the Green channels with a finite capacity. To investigate the stationary behavior of the studied security-check system, a queueing model is developed through deriving the two-dimensional quasi-birth-and-death(QBD) process. In addition, a matrix-geometric solution is presented in the paper to determine the steady-state probability and evaluate the system performance of interest, such as the average queue length and average waiting time. A sensitivity analysis is also conducted in the numerical experiments to demonstrate the managerial impact of varying the finite capacity in Green channels on the overall system performance.
暂无评论