Sciweavers

630 search results - page 48 / 126
» Optimized union of non-disjoint distributed data sets
Sort
View
MOR
2007
149views more  MOR 2007»
14 years 9 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
FLAIRS
2004
14 years 11 months ago
The Optimality of Naive Bayes
Naive Bayes is one of the most efficient and effective inductive learning algorithms for machine learning and data mining. Its competitive performance in classification is surpris...
Harry Zhang
JMLR
2010
128views more  JMLR 2010»
14 years 8 months ago
On the Rate of Convergence of the Bagged Nearest Neighbor Estimate
Bagging is a simple way to combine estimates in order to improve their performance. This method, suggested by Breiman in 1996, proceeds by resampling from the original data set, c...
Gérard Biau, Frédéric C&eacut...
CPHYSICS
2006
204views more  CPHYSICS 2006»
14 years 9 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris
ICDE
2011
IEEE
200views Database» more  ICDE 2011»
14 years 1 months ago
Deriving probabilistic databases with inference ensembles
— Many real-world applications deal with uncertain or missing data, prompting a surge of activity in the area of probabilistic databases. A shortcoming of prior work is the assum...
Julia Stoyanovich, Susan B. Davidson, Tova Milo, V...