Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Minimum Edit Arborescence Problem and Its Use in Compressing Graph
  Collections [Extended Version]   The inference of minimum spanning arborescences within a set of objects is a
general problem which translates into numerous application-specific
unsupervised learning tasks. We introduce a unified and generic structure
called edit arborescence that relies on edit paths between data in a
collection, as well as the Min Edit Arborescence Problem, which asks for an
edit arborescence that minimizes the sum of costs of its inner edit paths.
Through the use of suitable cost functions, this generic framework allows to
model a variety of problems. In particular, we show that by introducing
encoding size preserving edit costs, it can be used as an efficient method for
compressing collections of labeled graphs. Experiments on various graph
datasets, with comparisons to standard compression tools, show the potential of
our method.

26
The categories of this paper are: bayes-an
12
The categories of this paper are: nucl-th
14
The categories of this paper are: math-ph
15
The categories of this paper are: nucl-ex
27
The categories of this paper are: comp-gas
6
The categories of this paper are: astro-ph
30
The categories of this paper are: q-alg
20
The categories of this paper are: acc-phys
2
The categories of this paper are: math
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
16
The categories of this paper are: stat
17
The categories of this paper are: q-fin
4
The categories of this paper are: cond-mat
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph