Sciweavers

620 search results - page 114 / 124
» Learning with Temporary Memory
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 7 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 7 months ago
On-board analysis of uncalibrated data for a spacecraft at mars
Analyzing data on-board a spacecraft as it is collected enables several advanced spacecraft capabilities, such as prioritizing observations to make the best use of limited bandwid...
Benyang Tang, Kiri Wagstaff, Rebecca Castañ...
ICS
2010
Tsinghua U.
14 years 4 months ago
Space-Efficient Estimation of Robust Statistics and Distribution Testing
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
Steve Chien, Katrina Ligett, Andrew McGregor
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
14 years 28 days ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
13 years 11 months ago
Ensemble pruning via individual contribution ordering
An ensemble is a set of learned models that make decisions collectively. Although an ensemble is usually more accurate than a single learner, existing ensemble methods often tend ...
Zhenyu Lu, Xindong Wu, Xingquan Zhu, Josh Bongard