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.
Citation countsare sourced monthly fromand citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
Full-text downloadsdisplays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
Available Versions of this Item
- Random Indexing K-tree. (deposited 05 Oct 2009 15:11)
- Random Indexing K-tree. (deposited 17 Dec 2009 11:04)[Currently Displayed]
Repository Staff Only: item control page