23 August 2018 in IEEE Transactions on Knowledge and Data Engineering
After entering the big data era, a new term of ‘big knowledge’ has been coined to deal with challenges in mining a mass of knowledge from big data. While researchers used to explore the basic characteristics of big data, we have not seen any studies on the general and essential properties of big knowledge. To fill this gap, this paper studies the concepts of big knowledge, big-knowledge system and big-knowledge engineering. Ten massiveness characteristics for big knowledge and big-knowledge systems, including massive concepts, connectedness, clean data resources, cases, confidence, capabilities, cumulativeness, concerns, consistency and completeness, are defined and explored. Based on these characteristics, a comprehensive investigation is conducted on some large-scale knowledge engineering projects. We also investigate the recent research efforts on knowledge graphs, where they are analyzed to determine which ones can be considered as big knowledge and big-knowledge system. Further, a definition of big-knowledge engineering and its life cycle paradigm is presented. All these projects are accordingly checked to determine whether they belong to big-knowledge engineering projects. Finally, the perspectives of big knowledge research are discussed.
9 June 2022 in IEEE Transactions on Knowledge and Data Engineering
Besides entity-centric knowledge, usually organized as Knowledge Graph (KG), events are also an essential kind of knowledge in the world, which trigger the spring up of event-centric knowledge representation form like Event KG (EKG). It plays an increasingly important role in many downstream applications, such as search, question-answering, recommendation, financial quantitative investments, and text generation. This paper provides a comprehensive survey of EKG from history, ontology, instance, and application views. Specifically, to characterize EKG thoroughly, we focus on its history, definitions, schema induction, acquisition, related representative graphs/systems, and applications. The development processes and trends are studied therein. We further summarize prospective directions to facilitate future research on EKG.
24 May 2013 in Physical Review E
Percolation describes the sudden emergence of large-scale connectivity as edges are added to a lattice or random network. In the Bohman-Frieze-Wormald model (BFW) of percolation, edges sampled from a random graph are considered individually and either added to the graph or rejected provided that the fraction of accepted edges is never smaller than a decreasing function with asymptotic value of , a constant. The BFW process has been studied as a model system for investigating the underlying mechanisms leading to discontinuous phase transitions in percolation. Here we focus on the regime where it is known that only one giant component, denoted , initially appears at the discontinuous phase transition. We show that at some point in the supercritical regime stops growing and eventually a second giant component, denoted , emerges in a continuous percolation transition. The delay between the emergence of and and their asymptotic sizes both depend on the value of and we establish by several techniques that there exists a bifurcation point . For , stops growing the instant it emerges and the delay between the emergence of and decreases with increasing . For , in contrast, continues growing into the supercritical regime and the delay between the emergence of and increases with increasing . As we show, marks the minimal delay possible between the emergence of and (i.e., the smallest edge density for which can exist). We also establish many features of the continuous percolation of including scaling exponents and relations. DOI: http://dx.doi.org/10.1103/PhysRevE.87.052130 ©2013 American Physical Society
15 April 2021 in IEEE Transactions on Knowledge and Data Engineering
With the overwhelming popularity of Knowledge Graphs (KGs), researchers have poured attention to link prediction to fill in missing facts for a long time. However, they mainly focus on link prediction on binary relational data, where facts are usually represented as triples in the form of (head entity, relation, tail entity). In practice, n-ary relational facts are also ubiquitous. When encountering such facts, existing studies usually decompose them into triples by introducing a multitude of auxiliary virtual entities and additional triples. These conversions result in the complexity of carrying out link prediction on n-ary relational data. It has even proven that they may cause loss of structure information. To overcome these problems, in this paper, we represent each n-ary relational fact as a set of its role and role-value pairs. We then propose a method called NaLP to conduct link prediction on n-ary relational data, which explicitly models the relatedness of all the role and role-value pairs in an n-ary relational fact. We further extend NaLP by introducing type constraints of roles and role-values without any external type-specific supervision, and proposing a more reasonable negative sampling mechanism. Experimental results validate the effectiveness and merits of the proposed methods.