Mining all maximal frequent word sequences in a set of sentences

Authors:
Helena Ahonen-Myka
Affiliations:
University of Helsinki, Finland
Venue:
Proceedings of the 14th ACM international conference on Information and knowledge management
Year:
2005

Citing 1
Cited 2

Retrieving collocations from text: Xtract

Computational Linguistics - Special issue on using large corpora: I

An empirical study of malware evolution

COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Comparative study of text clustering techniques in virtual worlds

Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient algorithm for finding all maximal frequent word sequences in a set of sentences. A word sequence s is considered frequent, if all its words occur in at least σ sentences and the words occur in each of these sentences in the same order as in s, given a frequency threshold σ. Hence, the words of a sequence s do not have to occur consecutively in the sentences.