7,691 research outputs found
LexRank: Graph-based Lexical Centrality as Salience in Text Summarization
We introduce a stochastic graph-based method for computing relative
importance of textual units for Natural Language Processing. We test the
technique on the problem of Text Summarization (TS). Extractive TS relies on
the concept of sentence salience to identify the most important sentences in a
document or set of documents. Salience is typically defined in terms of the
presence of particular important words or in terms of similarity to a centroid
pseudo-sentence. We consider a new approach, LexRank, for computing sentence
importance based on the concept of eigenvector centrality in a graph
representation of sentences. In this model, a connectivity matrix based on
intra-sentence cosine similarity is used as the adjacency matrix of the graph
representation of sentences. Our system, based on LexRank ranked in first place
in more than one task in the recent DUC 2004 evaluation. In this paper we
present a detailed analysis of our approach and apply it to a larger data set
including data from earlier DUC evaluations. We discuss several methods to
compute centrality using the similarity graph. The results show that
degree-based methods (including LexRank) outperform both centroid-based methods
and other systems participating in DUC in most of the cases. Furthermore, the
LexRank with threshold method outperforms the other degree-based techniques
including continuous LexRank. We also show that our approach is quite
insensitive to the noise in the data that may result from an imperfect topical
clustering of documents
Experimental study of energy-minimizing point configurations on spheres
In this paper we report on massive computer experiments aimed at finding
spherical point configurations that minimize potential energy. We present
experimental evidence for two new universal optima (consisting of 40 points in
10 dimensions and 64 points in 14 dimensions), as well as evidence that there
are no others with at most 64 points. We also describe several other new
polytopes, and we present new geometrical descriptions of some of the known
universal optima.Comment: 41 pages, 12 figures, to appear in Experimental Mathematic
Categorification of Hopf algebras of rooted trees
We exhibit a monoidal structure on the category of finite sets indexed by
P-trees for a finitary polynomial endofunctor P. This structure categorifies
the monoid scheme (over Spec N) whose semiring of functions is (a P-version of)
the Connes--Kreimer bialgebra H of rooted trees (a Hopf algebra after base
change to Z and collapsing H_0). The monoidal structure is itself given by a
polynomial functor, represented by three easily described set maps; we show
that these maps are the same as those occurring in the polynomial
representation of the free monad on P.Comment: 29 pages. Does not compile with pdflatex due to dependency on the
texdraw package. v2: expository improvements, following suggestions from the
referees; final version to appear in Centr. Eur. J. Mat
- …