Random Indexing K-tree
| Contribuinte(s) |
Kay, Judy Thomas, Paul Trotman, Andrew |
|---|---|
| Data(s) |
01/12/2009
|
| Resumo |
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. |
| Formato |
application/pdf |
| Identificador | |
| Publicador |
School of Information Technologies, University of Sydney |
| Relação |
http://eprints.qut.edu.au/29361/1/c29361.pdf http://es.csiro.au/adcs2009/proceedings/oral-presentation/06-devries.pdf 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. |
| Direitos |
Copyright 2009 The authors. |
| Fonte |
Faculty of Science and Technology; High Performance Computing and Research Support |
| Palavras-Chave | #080109 Pattern Recognition and Data Mining #080201 Analysis of Algorithms and Complexity #080704 Information Retrieval and Web Search #Random Indexing #K-tree #Dimensionality Reduction #B-tree #Search Tree #Clustering #Document Clustering #Vector Quantization #k-means |
| Tipo |
Conference Paper |
