Sciweavers

1950 search results - page 19 / 390
» Informative sampling for large unbalanced data sets
Sort
View
JPDC
2007
138views more  JPDC 2007»
13 years 7 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
CIVR
2009
Springer
583views Image Analysis» more  CIVR 2009»
14 years 7 months ago
Mining from Large Image Sets
So far, most image mining was based on interactive querying. Although such querying will remain important in the future, several applications need image mining at such wide scale...
Luc J. Van Gool, Michael D. Breitenstein, Stephan ...
ICDE
2007
IEEE
155views Database» more  ICDE 2007»
14 years 1 months ago
Query-Aware Sampling for Data Streams
Data Stream Management Systems are useful when large volumes of data need to be processed in real time. Examples include monitoring network traffic, monitoring financial transacti...
Theodore Johnson, S. Muthukrishnan, Vladislav Shka...
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
13 years 11 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
ICDT
2007
ACM
121views Database» more  ICDT 2007»
14 years 1 months ago
Compact Samples for Data Dissemination
We consider data dissemination in a peer-to-peer network, where each user wishes to obtain some subset of the available information objects. In most of the modern algorithms for su...
Tova Milo, Assaf Sagi, Elad Verbin