@inproceedings{113b5a9207264b5e971b690e7ca37130,
title = "MING: Mining informative entity relationship subgraphs",
abstract = "Many modern applications are faced with the task of knowledge discovery in entity-relationship graphs, such as domain-specific knowledge bases or social networks. Mining an {"}informative{"} subgraph that can explain the relations between k(≥ 2) given entities of interest is a frequent knowledge discovery scenario on such graphs. We present MING, a principled method for extracting an informative subgraph for given query nodes. MING builds on a new notion of informativeness of nodes. This is used in a random-walk-with-restarts process to compute the informativeness of entire subgraphs.",
keywords = "Entity, Graph, Informative, Mining, Random, Relationship, Walk",
author = "Gjergji Kasneci and Shady Elbassuoni and Gerhard Weikum",
year = "2009",
doi = "10.1145/1645953.1646196",
language = "English",
isbn = "9781605585123",
series = "International Conference on Information and Knowledge Management, Proceedings",
pages = "1653--1656",
booktitle = "ACM 18th International Conference on Information and Knowledge Management, CIKM 2009",
note = "ACM 18th International Conference on Information and Knowledge Management, CIKM 2009 ; Conference date: 02-11-2009 Through 06-11-2009",
}