Sciweavers

3190 search results - page 311 / 638
» cans 2011
Sort
View
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
14 years 9 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
SDM
2011
SIAM
233views Data Mining» more  SDM 2011»
14 years 9 months ago
Multi-Instance Mixture Models
Multi-instance (MI) learning is a variant of supervised learning where labeled examples consist of bags (i.e. multi-sets) of feature vectors instead of just a single feature vecto...
James R. Foulds, Padhraic Smyth
SIGIR
2011
ACM
14 years 9 months ago
No free lunch: brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity
This work explores the problem of cross-lingual pairwise similarity, where the task is to extract similar pairs of documents across two different languages. Solutions to this pro...
Ferhan Ture, Tamer Elsayed, Jimmy J. Lin
SIGMOD
2011
ACM
152views Database» more  SIGMOD 2011»
14 years 9 months ago
Tracing data errors with view-conditioned causality
A surprising query result is often an indication of errors in the query or the underlying data. Recent work suggests using causal reasoning to find explanations for the surprisin...
Alexandra Meliou, Wolfgang Gatterbauer, Suman Nath...
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
14 years 9 months ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li