Sciweavers

1403 search results - page 181 / 281
» Set cover algorithms for very large datasets
Sort
View
156
Voted
AUSAI
2003
Springer
15 years 11 months ago
Association Rule Discovery with Unbalanced Class Distributions
There are many methods for finding association rules in very large data. However it is well known that most general association rule discovery methods find too many rules, which...
Lifang Gu, Jiuyong Li, Hongxing He, Graham J. Will...
ECCV
2010
Springer
15 years 11 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
167
Voted
BMCBI
2008
117views more  BMCBI 2008»
15 years 6 months ago
New resampling method for evaluating stability of clusters
Background: Hierarchical clustering is a widely applied tool in the analysis of microarray gene expression data. The assessment of cluster stability is a major challenge in cluste...
Irina Gana Dresen, Tanja Boes, Johannes Hüsin...
213
Voted
ECCV
2010
Springer
15 years 7 months ago
Location Recognition Using Prioritized Feature Matching
We present a fast, simple location recognition and image localization method that leverages feature correspondence and geometry estimated from large Internet photo collections. Suc...
Yunpeng Li, Noah Snavely, Daniel P. Huttenlocher
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
16 years 6 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano