Sciweavers

1146 search results - page 141 / 230
» Optimizing Frequency Queries for Data Mining Applications
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 23 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 8 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 years 10 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
14 years 8 months ago
Applying syntactic similarity algorithms for enterprise information management
: ? Applying Syntactic Similarity Algorithms for Enterprise Information Management Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey III, Joseph Tucek, Alistair Veitch HP Laborato...
Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey...
VLDB
2008
ACM
110views Database» more  VLDB 2008»
14 years 8 months ago
Enhancing histograms by tree-like bucket indices
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
Francesco Buccafurri, Gianluca Lax, Domenico SaccÃ...