A model for automatic generation of multi-partite graphs from arbitrary data

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we propose a generic model to generate basic multi-partite graphs obtained by associations found in arbitrary data. The interest of such a model is to be the formal basis behind a tool for automatic graph generation that we are developing. This tool will automatically generate the basic multi-partite graphs that represents the arbitrary data provided as input. We consider input data as collections of complex objects composed by a set or a list of heterogeneous elements. Our tool will provide an interface for the user to specify the kind of nodes that are relevant for the application domain in each case. Those nodes will be obtained from the complex input objects by simple extraction rules. The objective of this paper is to present the model to represent basic multi-partite graphs and the way to define the nodes of the graph using simple derivation rules defined by the user. In order to validate our model we give three examples of radically different data sets. Those examples come from the Web log queries, processing text collections, and bibliographic databases. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Baeza-Yates, R., Brisaboa, N., & Larriba-Pey, J. (2010). A model for automatic generation of multi-partite graphs from arbitrary data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6185 LNCS, pp. 49–60). https://doi.org/10.1007/978-3-642-16720-1_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free