منابع مشابه
Maverick: Discovering Exceptional Facts from Knowledge Graphs
We presentMaverick, a general, extensible framework that discovers exceptional facts about entities in knowledge graphs. To the best of our knowledge, there was no previous study of the problem. We model an exceptional fact about an entity of interest as a context-subspace pair, in which a subspace is a set of attributes and a context is defined by a graph query pattern of which the entity is a...
متن کاملDiscovering Pairwise Compatibility Graphs
Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T , and let dmin and dmax be two nonnegative real numbers such that dmin ≤ dmax. Then a pairwise compatibility graph of T for dmin and dmax is a graph G = (V,E), where each vertex u′ ∈ V corresponds to a leaf u of T and there is an edge (u′, v′) ∈ E if and only if dmin ≤ dT (u, v) ≤ d...
متن کاملDiscovering Near Symmetry in Graphs
Symmetry is a widespread phenomenon that can offer opportunities for powerful exploitation in areas as diverse as molecular chemistry, pure mathematics, circuit design, biology and architecture. Graphs are an abstract way to represent relational structures. The search for symmetry in many contexts can thus be reduced to the attempt to find graph automorphisms. Brendan McKay’s NAUTY system (McKa...
متن کاملDiscovering Structure by Learning Sparse Graphs
Systems of concepts such as colors, animals, cities, and artifacts are richly structured, and people discover the structure of these domains throughout a lifetime of experience. Discovering structure can be formalized as probabilistic inference about the organization of entities, and previous work has operationalized learning as selection amongst specific candidate hypotheses such as rings, tre...
متن کاملDiscovering Inter-Dimensional Rules in Dynamic Graphs
Data mining methods that exploit graph/network have become quite popular and a timely challenge is to consider the discovery of dynamic properties in evolving graphs or networks. In this paper, we consider the dynamic oriented graphs that can be encoded as n-ary relations with n ≥ 3 such that we have a least 3 dimensions: the dimensions of departure (tail) and arrival (head) vertices plus the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Mining and Knowledge Discovery
سال: 2014
ISSN: 1384-5810,1573-756X
DOI: 10.1007/s10618-014-0359-9