Sciweavers

796 search results - page 60 / 160
» Effective Use of the KDD Process and Data Mining for Compute...
Sort
View
ICCV
2009
IEEE
13 years 6 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden
CCGRID
2010
IEEE
13 years 10 months ago
The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets
Markets of computing resources typically consist of a cluster (or a multi-cluster) and jobs that arrive over time and request computing resources in exchange for payment. In this p...
Sergei Shudler, Lior Amar, Amnon Barak, Ahuva Mu'a...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 9 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
14 years 9 months ago
Empirical comparisons of various voting methods in bagging
Finding effective methods for developing an ensemble of models has been an active research area of large-scale data mining in recent years. Models learned from data are often subj...
Kelvin T. Leung, Douglas Stott Parker Jr.
CISSE
2008
Springer
13 years 11 months ago
Sentiment Mining Using Ensemble Classification Models
We live in the information age, where the amount of data readily available already overwhelms our capacity to analyze and absorb it without help from our machines. In particular, ...
Matthew Whitehead, Larry Yaeger