Sciweavers

628 search results - page 92 / 126
» The minimum shift design problem
Sort
View
KDD
2006
ACM
129views Data Mining» more  KDD 2006»
14 years 9 months ago
Suppressing model overfitting in mining concept-drifting data streams
Mining data streams of changing class distributions is important for real-time business decision support. The stream classifier must evolve to reflect the current class distributi...
Haixun Wang, Jian Yin, Jian Pei, Philip S. Yu, Jef...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 3 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
NN
2008
Springer
143views Neural Networks» more  NN 2008»
13 years 8 months ago
A batch ensemble approach to active learning with model selection
Optimally designing the location of training input points (active learning) and choosing the best model (model selection) are two important components of supervised learning and h...
Masashi Sugiyama, Neil Rubens
FOCS
2002
IEEE
14 years 1 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
GLOBECOM
2008
IEEE
14 years 2 months ago
Topology-Transparent Distributed Scheduling in Multi-Hop Wireless Networks
— Transmission scheduling is a key design problem in wireless multi-hop networks and many scheduling algorithms have been proposed to maximize the spatial reuse and minimize the ...
Qiong Sun, Victor O. K. Li, Ka-Cheong Leung