Combining BOW representation and Appriori algorithm for text mining

The field of text mining seeks to extract useful information from unstructured textual data through the identification and exploration of interesting patterns. The techniques employed usually do not involve deep linguistic analysis or parsing, but rely on simple "Bag-Of-Words" (BPW) text representations based on vector space. In this paper we combine the BOW representation and Appriori algorithm to detect clusters of similar documents and associated rules.