Sciweavers

221 search results - page 1 / 45
» Random Indexing K-tree
Sort
View
MICS
2010
134views more  MICS 2010»
13 years 2 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 3 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao
AIME
2011
Springer
12 years 3 months ago
Diagnosis Code Assignment Support Using Random Indexing of Patient Records - A Qualitative Feasibility Study
Abstract. The prediction of diagnosis codes is typically based on freetext entries in clinical documents. Previous attempts to tackle this problem range from strictly rule-based sy...
Aron Henriksson, Martin Hassel, Maria Kvist
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 3 months ago
Random Indexing K-tree
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...
LREC
2008
153views Education» more  LREC 2008»
13 years 5 months ago
Using Random Indexing to improve Singular Value Decomposition for Latent Semantic Analysis
We present results from using Random Indexing for Latent Semantic Analysis to handle Singular Value Decomposition tractability issues. We compare Latent Semantic Analysis, Random ...
Linus Sellberg, Arne Jönsson