Affordable Access

Access to the full text

Subjectively interesting connecting trees and forests

Authors
  • Adriaens, Florian
  • Lijffijt, Jefrey
  • De Bie, Tijl
Publication Date
Jan 01, 2019
Identifiers
DOI: 10.1007/s10618-019-00627-1
OAI: oai:archive.ugent.be:8613039
Source
Ghent University Institutional Archive
Keywords
Language
English
License
Green
External links

Abstract

Consider a large graph or network, and a user-provided set of query vertices between which the user wishes to explore relations. For example, a researcher may want to connect research papers in a citation network, an analyst may wish to connect organized crime suspects in a communication network, or an internet user may want to organize their bookmarks given their location in the world wide web. A natural way to do this is to connect the vertices in the form of a tree structure that is present in the graph. However, in sufficiently dense graphs, most such trees will be large or somehow trivial (e.g. involving high degree vertices) and thus not insightful. Extending previous research, we define and investigate the new problem of mining subjectively interesting trees connecting a set of query vertices in a graph, i.e., trees that are highly surprising to the specific user at hand. Using information theoretic principles, we formalize the notion of interestingness of such trees mathematically, taking in account certain prior beliefs the user has specified about the graph. A remaining problem is efficiently fitting a prior belief model. We show how this can be done for a large class of prior beliefs. Given a specified prior belief model, we then propose heuristic algorithms to find the best trees efficiently. An empirical validation of our methods on a large real graphs evaluates the different heuristics and validates the interestingness of the given trees.

Report this publication

Statistics

Seen <100 times