Compressing an inverted file with LCS??

Tunghai University Institutional Repository > 工學院 > 資訊工程學系所 > 會議論文 > Item 310901/22030

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://140.128.103.80:8080/handle/310901/22030

题名:	Compressing an inverted file with LCS??
作者:	Leu, F.-Y., Fan, Y.-C.
贡献者:	Department of Computer Science, Tunghai University
关键词:	Compression algorithm;Compression techniques;Inverted files;Minimum Spanning Tree (MST)
日期:	2004-09-28
上传时间:	2013-05-15T09:09:33Z (UTC)
出版者:	Hong Kong, China
摘要:	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.
關聯:	Proceedings - International Computer Software and Applications Conference 2 , pp. 60-61
显示于类别:	[資訊工程學系所] 會議論文

文件中的档案:

档案	大小	格式	浏览次数
index.html	0Kb	HTML	210	检视/开启

在THUIR中所有的数据项都受到原著作权保护.