Generalized minimum dominating set and application in automatic text summarization

For a graph formed by vertices and weighted edges, a generalized minimum dominating set (MDS) is a vertex set of smallest cardinality such that the summed weight of edges from each outside vertex to vertices in this set is equal to or larger than certain threshold value. This generalized MDS problem reduces to the conventional MDS problem in the limiting case of all the edge weights being equal to the threshold value. We treat the generalized MDS problem in the present paper by a replica-symmetric spin glass theory and derive a set of belief-propagation equations. As a practical application we consider the problem of extracting a set of sentences that best summarize a given input text document. We carry out a preliminary test of the statistical physics-inspired method to this automatic text summarization problem.

[1]  Yang-Yu Liu,et al.  Control principles of metabolic networks , 2015, 1509.01211.

[2]  Mark T. Maybury,et al.  Advances in Automatic Text Summarization , 1999 .

[3]  Yamir Moreno,et al.  Distance-d covering problems in scale-free networks with degree correlations. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Chin-Yew Lin,et al.  ROUGE: A Package for Automatic Evaluation of Summaries , 2004, ACL 2004.

[5]  Adilson E Motter,et al.  Network observability transitions. , 2012, Physical review letters.

[6]  Tao Li,et al.  Multi-Document Summarization via the Minimum Dominating Set , 2010, COLING.

[7]  Rada Mihalcea,et al.  TextRank: Bringing Order into Text , 2004, EMNLP.

[8]  Stefan Wuchty,et al.  Controllability in protein interaction networks , 2014, Proceedings of the National Academy of Sciences.

[9]  Haijun Zhou,et al.  Region Graph Partition Function Expansion and Approximate Free Energy Landscapes: Theory and Some Numerical Results , 2012, 1204.1818.

[10]  Christiane Fellbaum,et al.  Book Reviews: WordNet: An Electronic Lexical Database , 1999, CL.

[11]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[12]  Tatsuya Akutsu,et al.  Analysis on critical nodes in controlling complex networks using dominating sets , 2013, 2013 International Conference on Signal-Image Technology & Internet-Based Systems.

[13]  Hai-Jun Zhou,et al.  The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation , 2015, FAW.

[14]  Albert-László Barabási,et al.  Control Principles of Complex Networks , 2015, ArXiv.

[15]  Boleslaw K. Szymanski,et al.  Minimum Dominating Sets in Scale-Free Network Ensembles , 2013, Scientific Reports.

[16]  Yuichi Yoshida,et al.  Suppressing epidemics on networks by exploiting observer nodes , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[18]  Dragomir R. Radev,et al.  LexRank: Graph-based Lexical Centrality as Salience in Text Summarization , 2004, J. Artif. Intell. Res..

[19]  S. Kak.  Information, physics, and computation , 1996 .

[20]  Hai-Jun Zhou,et al.  Statistical Mechanics of the Minimum Dominating Set Problem , 2014, ArXiv.

[21]  P. Pin,et al.  Statistical mechanics of maximal independent sets. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  M. Mézard,et al.  The Bethe lattice spin glass revisited , 2000, cond-mat/0009418.

[23]  Peter Oram.  WordNet: An electronic lexical database. Christiane Fellbaum (Ed.). Cambridge, MA: MIT Press, 1998. Pp. 423. , 2001, Applied Psycholinguistics.

[24]  L. Dall'Asta,et al.  Optimal Equilibria of the Best Shot Game , 2009, 1002.3572.

[25]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[26]  Huiru Zheng,et al.  Minimum dominating sets in cell cycle specific protein interaction networks , 2014, 2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM).