We present an approach to document clustering based on winnowing fingerprints that achieved good values of effectiveness with considerable save in memory space and computation tim...
The constantly increasing flood of available textual information demands for the devlopment of powerful tools to organize, search, and explore these document libraries. Within the...
This paper briefly presents the ISA project that addresses the issue of how argumentation processes can be supported by providing textual information from document databases. The ...
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
Christopher M. De Vries, Lance De Vine, Shlomo Gev...
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...