Relsim: relation similarity search in schema-rich heterogeneous information networks
Recent studies have demonstrated the power of modeling real world data as heterogeneous
information networks (HINs) consisting of multiple types of entities and relations …
information networks (HINs) consisting of multiple types of entities and relations …
Random walk with restart on large graphs using block elimination
Given a large graph, how can we calculate the relevance between nodes fast and
accurately? Random walk with restart (RWR) provides a good measure for this purpose and …
accurately? Random walk with restart (RWR) provides a good measure for this purpose and …
Earec: leveraging expertise and authority for pull-request reviewer recommendation in github
Pull-Request (PR) is a primary way of code contribution from developers to improve quality
of software projects in GitHub. For a popular GitHub project, tens of PR are submitted daily …
of software projects in GitHub. For a popular GitHub project, tens of PR are submitted daily …
QTL mapping for nitrogen use efficiency and related physiological and agronomical traits during the vegetative phase in rice under hydroponics
Breeding crops for better nitrogen use efficiency (NUE) is one of the primary objectives in
modern agriculture to decrease nitrogen (N) fertiliser application. However, genetic …
modern agriculture to decrease nitrogen (N) fertiliser application. However, genetic …
Bump hunting in the dark: Local discrepancy maximization on graphs
A Gionis, M Mathioudakis… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
We study the problem of discrepancy maximization on graphs: given a set of nodes Q of an
underlying graph G, we aim to identify a connected subgraph of G that contains many more …
underlying graph G, we aim to identify a connected subgraph of G that contains many more …
Quint: on query-specific optimal networks
Measuring node proximity on large scale networks is a fundamental building block in many
application domains, ranging from computer vision, e-commerce, social networks, software …
application domains, ranging from computer vision, e-commerce, social networks, software …
Efficient pattern matching on big uncertain graphs
A significant amount of research has been devoted to seeking efficient solutions to the
problem of pattern matching over graphs. This interest is largely due to the many …
problem of pattern matching over graphs. This interest is largely due to the many …
What links alice and bob? matching and ranking semantic patterns in heterogeneous networks
An increasing number of applications are modeled and analyzed in network form, where
nodes represent entities of interest and edges represent interactions or relationships …
nodes represent entities of interest and edges represent interactions or relationships …
ESPRESSO: explaining relationships between entity sets
S Seufert, K Berberich, SJ Bedathur… - Proceedings of the 25th …, 2016 - dl.acm.org
Analyzing and explaining relationships between entities in a knowledge graph is a
fundamental problem with many applications. Prior work has been limited to extracting the …
fundamental problem with many applications. Prior work has been limited to extracting the …
Instant espresso: interactive analysis of relationships in knowledge graphs
S Seufert, P Ernst, SJ Bedathur, SK Kondreddi… - Proceedings of the 25th …, 2016 - dl.acm.org
We demonstrate InstantEspresso, a system to explain the relationship between two sets of
entities in knowledge graphs. Instant-Espresso answers questions of the form. Which …
entities in knowledge graphs. Instant-Espresso answers questions of the form. Which …