Random Indexing K-tree
De Vries, Christopher M., De Vine, Lance, & Geva, Shlomo (2009) Random Indexing K-tree. In Kay, Judy, Thomas, Paul, & Trotman, Andrew (Eds.) ADCS 2009 : Proceedings of the Fourteenth Australasian Document Computing Symposium, School of Information Technologies, University of Sydney, University of New South Wales, Sydney.
This is the latest version of this eprint.
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
Available Versions of this Item
Random Indexing K-tree. (deposited 05 Oct 2009 05:11)
- Random Indexing K-tree. (deposited 17 Dec 2009 01:04) [Currently Displayed]
Repository Staff Only: item control page