USING FREQUENT PATTERN MINING ALGORITHMS IN TEXT ANALYSIS

In text mining, effectiveness of methods depends on d cument representations. The ones based on frequent word sequences are used in uch tasks as categorization, clustering and topic modelling. In the paper a comp arison of different algorithms for finding frequent word sequences is presented. There are considered techniques dedicated for market basket analysis such as GSP an d PrefixSpan as well as a method based on a suffix array. The investigated te chniques are compared with the new approach of searching maximum frequent word seq uences in document sets. Performance of the algorithms is examined taking in to account execution times for the considered test collections.