Text segmentation by product partition models and dynamic programming

  • Authors:
  • A. Kehagias;A. Nicolaou;V. Petridis;P. Fragkou

  • Affiliations:
  • Department of Math., Phys. and Comp. Sciences Faculty of Engineering, Aristotle University of Thessaloniki Thessaloniki, Greece;Department of Business Administration University of Macedonia, Thessaloniki, Greece;Department of Electrical and Computer Engineering Faculty of Engineering, Aristotle University of Thessaloniki Thessaloniki, Greece;Department of Electrical and Computer Engineering Faculty of Engineering, Aristotle University of Thessaloniki Thessaloniki, Greece

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 2004

Quantified Score

Hi-index 0.98

Visualization

Abstract

In this paper, we use Barry and Hartigan's Product Partition Models to formulate text segmentation as an optimization problem, which we solve by a fast dynamic programming algorithm. We test the algorithm on Choi's segmentation benchmark and achieve the best segmentation results so far reported in the literature.