A compression algorithm for compressing an inverted file with longest common subsequence (LCS) is presented. The compression algorithm comprises of clustering and indexing modules. The algorithm discovers all the vertices at distance k from the starting vertex after finding out all the vertices at distance k-1. Analysis shows that through the bipartite model, both term graph and document graph of an information system can be generated.
Relation:
Proceedings - International Computer Software and Applications Conference 2 , pp. 60-61
