Sciweavers

1813 search results - page 35 / 363
» Instance Pruning Techniques
Sort
View
ICTAI
2006
IEEE
15 years 5 months ago
MI-Winnow: A New Multiple-Instance Learning Algorithm
We present MI-Winnow, a new multiple-instance learning (MIL) algorithm that provides a new technique to convert MIL data into standard supervised data. In MIL each example is a co...
Sharath R. Cholleti, Sally A. Goldman, Rouhollah R...
PVLDB
2010
126views more  PVLDB 2010»
14 years 10 months ago
Set Similarity Join on Probabilistic Data
Set similarity join has played an important role in many real-world applications such as data cleaning, near duplication detection, data integration, and so on. In these applicati...
Xiang Lian, Lei Chen 0002
AUSAI
2010
Springer
14 years 9 months ago
A Heuristic on Effective and Efficient Clustering on Uncertain Objects
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
Edward Hung, Lei Xu, Chi-Cheong Szeto
ICASSP
2010
IEEE
15 years 14 hour ago
Fixed-budget kernel recursive least-squares
We present a kernel-based recursive least-squares (KRLS) algorithm on a fixed memory budget, capable of recursively learning a nonlinear mapping and tracking changes over time. I...
Steven Van Vaerenbergh, Ignacio Santamaría,...
DAC
2002
ACM
16 years 24 days ago
Solving difficult SAT instances in the presence of symmetry
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...