Document clustering using sequential pattern (SP): Maximal frequent sequences (MFS) as SP representation

This research proposes an idea to apply Feature Based Clustering (FBC) in document clustering. A huge number of existing documents will be easier to be used if they are clustered into several topics. FBC uses K-Means algorithm to cluster sequential data of features. Features of text document can be presented as sequence of word. In order to be processed as sequential data, features must be extracted from collection of unstructured text documents. Therefore, we need preprocessing tasks to deliver appropriate form of document features. There are two types of sequential pattern using simple form: Frequent Word Sequence (FWS) and Maximal Frequent Sequence (MFS). Both types are appropriate for text data. The difference is in applying the maximum principle in MFS. Therefore, MFS amount from a text document would be less than the amount of its FWS. In this research, we choose maximal frequent sequences (MFS) as feature representation. We proposes framework to conduct FBC using MFS as features. The framework is tested to cluster dataset that is subset of the Twenty News Group Text Data. The result shows that the accuracy of clustering result is affected by the parameter´s value, dataset, and the number of target cluster.