2010
DOI: 10.1007/978-3-642-16687-7_37
|View full text |Cite
|
Sign up to set email alerts
|

Text Segmentation by Clustering Cohesion

Abstract: An automatic linear text segmentation in order to detect the best topic boundaries is a difficult and very useful task in many text processing systems. Some methods have tried to solve this problem with reasonable results, but they present some drawbacks as well. In this work, we propose a new method, called ClustSeg, based on a predefined window and a clustering algorithm to decide the topic cohesion. We compare our proposal against the best known methods, with a better performance against these algorithms.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Usually, they obtain linear segmentations, where the output is a document divided into sequences of adjacent segments [6], [7]. Another approach is a hierarchical segmentation; the outputs of these methods try to identify the document structure, usually chapters and multiple levels of sub-chapters [8].…”
Section: Related Workmentioning
confidence: 99%
“…Usually, they obtain linear segmentations, where the output is a document divided into sequences of adjacent segments [6], [7]. Another approach is a hierarchical segmentation; the outputs of these methods try to identify the document structure, usually chapters and multiple levels of sub-chapters [8].…”
Section: Related Workmentioning
confidence: 99%