Sciweavers

6095 search results - page 438 / 1219
» Learning in Local Search
Sort
View
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 7 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
ML
2000
ACM
154views Machine Learning» more  ML 2000»
15 years 6 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
15 years 4 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
AGENTS
2001
Springer
15 years 11 months ago
Terrain coverage with ant robots: a simulation study
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
Sven Koenig, Yaxin Liu
ANOR
2011
117views more  ANOR 2011»
14 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover