Sciweavers

3251 search results - page 493 / 651
» On a vector q-d algorithm
Sort
View
KDD
2008
ACM
199views Data Mining» more  KDD 2008»
14 years 10 months ago
Building semantic kernels for text classification using wikipedia
Document classification presents difficult challenges due to the sparsity and the high dimensionality of text data, and to the complex semantics of the natural language. The tradi...
Pu Wang, Carlotta Domeniconi
KDD
2008
ACM
182views Data Mining» more  KDD 2008»
14 years 10 months ago
Classification with partial labels
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...
Nam Nguyen, Rich Caruana
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 10 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
RECOMB
2006
Springer
14 years 10 months ago
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
Nicholas D. Pattengale, Bernard M. E. Moret
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
14 years 10 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai