165 search results - page 5 / 33 » Algorithms for Sparse Linear Classifiers in the Massive Data... |
137
click to vote
SIGMOD
1999
ACM
15 years 7 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
138
click to vote
TSP
2008
15 years 3 months ago
2008
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
157
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
163
click to vote
JMIV
2011
14 years 10 months ago
2011
In this paper, we first present a new implementation of the 3-D fast curvelet transform, which is nearly 2.5 less redundant than the Curvelab (wrapping-based) implementation as o...
140
Voted
KDD
2005
ACM
16 years 3 months ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...