Bag-Of-Words Graph-Vizualizer

The purpose of the program is to vizualize the set of documents. It uses graphical interface. Main parameters are input file in the Bag-Of-Words ".Bow" format, number of documents to consider, number of clusters (for K-means clustering algorithms) and treshold which determines the minimal  level of similarity of clusters, for which the graph nodes (clusters) are connected in the drawing of graph. The algorithm first clusters documents into flat clusters, converts clusters into graph (more similar clusters are connected with a stronger tie) and draws a graph with relaxation procedure.


The program uses graphical user interface, the parameters are chosen via interface.