Sciweavers

2988 search results - page 221 / 598
» Experiments with a New Boosting Algorithm
Sort
View
AAAI
2011
14 years 4 months ago
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...
CVPR
2010
IEEE
16 years 9 days ago
Online Multiple Instance Learning with No Regret
Multiple instance (MI) learning is a recent learning paradigm that is more flexible than standard supervised learning algorithms in the handling of label ambiguity. It has been u...
Li Mu, James Kwok, Lu Bao-liang
CEC
2008
IEEE
15 years 11 months ago
Hyper-selection in dynamic environments
— In recent years, several approaches have been developed for genetic algorithms to enhance their performance in dynamic environments. Among these approaches, one kind of methods...
Shengxiang Yang, Renato Tinós
DEXA
2008
Springer
117views Database» more  DEXA 2008»
15 years 6 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...
130
Voted
WWIC
2010
Springer
193views Communications» more  WWIC 2010»
15 years 8 months ago
0day Anomaly Detection Made Possible Thanks to Machine Learning
Abstract. This paper proposes new cognitive algorithms and mechanisms for detecting 0day attacks targeting the Internet and its communication performances and behavior. For this pu...
Philippe Owezarski, Johan Mazel, Yann Labit