Sciweavers

49 search results - page 9 / 10
» Active Learning with Near Misses
Sort
View
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
14 years 11 months ago
Relational data pre-processing techniques for improved securities fraud detection
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
Andrew Fast, Lisa Friedland, Marc Maier, Brian Tay...
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
14 years 4 months ago
Exploiting Recurring Usage Patterns to Enhance Filesystem and Memory Subsystem Performance
In many cases, normal uses of a system form patterns that will repeat. The most common patterns can be collected into a prediction model which will essentially predict that usage p...
Benjamin Rutt, Srinivasan Parthasarathy
CEAS
2006
Springer
14 years 2 months ago
Fast Uncertainty Sampling for Labeling Large E-mail Corpora
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
Richard Segal, Ted Markowitz, William Arnold

Publication
173views
12 years 10 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...
ICCV
2011
IEEE
12 years 11 months ago
Complementary Hashing for Approximate Nearest Neighbor Search
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral...
Hao Xu, Jingdong Wang, Zhu Li, Gang Zeng, Shipeng ...