Sciweavers

1950 search results - page 70 / 390
» Informative sampling for large unbalanced data sets
Sort
View
107
Voted
SSD
2009
Springer
149views Database» more  SSD 2009»
15 years 8 months ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...
KDD
1999
ACM
199views Data Mining» more  KDD 1999»
15 years 5 months ago
The Application of AdaBoost for Distributed, Scalable and On-Line Learning
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang
CHI
2003
ACM
16 years 1 months ago
Efficient user interest estimation in fisheye views
We present a new technique for efficiently computing Degree-of-Interest distributions to inform the visualization of graph-structured data. The technique is independent of the int...
Jeffrey Heer, Stuart K. Card
DSS
2007
74views more  DSS 2007»
15 years 1 months ago
Novel information discovery for intelligence and counterterrorism
Intelligence analysts construct hypotheses from large volumes of data, but are often limited by social and organizational norms and their own preconceptions and biases. The use of...
David B. Skillicorn, Nikhil Vats
APCCM
2008
15 years 2 months ago
Constraint Acquisition - You Can Chase but You Cannot Find
We identify established tableaux techniques as an invaluable tool for semantic knowledge acquisition in the design process of relational databases. Sample databases allow users an...
Sven Hartmann, Sebastian Link, Thu Trinh