The community-search problem and how to plan a successful cocktail party

M Sozio, A Gionis - Proceedings of the 16th ACM SIGKDD international …, 2010 - dl.acm.org
A lot of research in graph mining has been devoted in the discovery of communities. Most of
the work has focused in the scenario where communities need to be discovered with only …

Querying knowledge graphs by example entity tuples

N Jayaram, A Khan, C Li, X Yan… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
We witness an unprecedented proliferation of knowledge graphs that record millions of
entities and their relationships. While knowledge graphs are structure-flexible and content …

Rex: explaining relationships between entity pairs

L Fang, AD Sarma, C Yu, P Bohannon - arXiv preprint arXiv:1111.7170, 2011 - arxiv.org
Knowledge bases of entities and relations (either constructed manually or automatically) are
behind many real world search engines, including those at Yahoo!, Microsoft, and Google …

Bear: Block elimination approach for random walk with restart on large graphs

K Shin, J Jung, S Lee, U Kang - Proceedings of the 2015 ACM SIGMOD …, 2015 - dl.acm.org
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 …

Explaining and suggesting relatedness in knowledge graphs

G Pirrò - The Semantic Web-ISWC 2015: 14th International …, 2015 - Springer
Abstract Knowledge graphs (KGs) are a key ingredient for searching, browsing and
knowledge discovery activities. Motivated by the need to harness knowledge available in a …

Mining semantic association rules from RDF data

M Barati, Q Bai, Q Liu - Knowledge-Based Systems, 2017 - Elsevier
Abstract The Semantic Web opens up new opportunities for the data mining research.
Semantic Web data is usually represented in the RDF triple format (subject, predicate …

Generating natural language summaries for crosscutting source code concerns

S Rastkar, GC Murphy… - 2011 27th IEEE …, 2011 - ieeexplore.ieee.org
When performing a software change task, programmers expend substantial effort
investigating a system's code base to find and understand just the code that is pertinent to a …

Explass: Exploring Associations between Entities via Top-K Ontological Patterns and Facets

G Cheng, Y Zhang, Y Qu - The Semantic Web–ISWC 2014: 13th …, 2014 - Springer
Searching for associations between entities is needed in many areas. On the Semantic Web,
it usually boils down to finding paths that connect two entities in an entity-relation graph …

Random walk with restart on large graphs using block elimination

J Jung, K Shin, L Sael, U Kang - ACM Transactions on Database …, 2016 - dl.acm.org
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 …

An empirical evaluation of techniques for ranking semantic associations

G Cheng, F Shao, Y Qu - IEEE Transactions on Knowledge …, 2017 - ieeexplore.ieee.org
Searching for associations between entities is needed in many domains like national
security and bioinformatics. In recent years, it has been facilitated by the emergence of …