Sciweavers

645 search results - page 82 / 129
» Mining specifications
Sort
View
ICDM
2010
IEEE
105views Data Mining» more  ICDM 2010»
13 years 8 months ago
On the Vulnerability of Large Graphs
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
Hanghang Tong, B. Aditya Prakash, Charalampos E. T...
ICDM
2010
IEEE
178views Data Mining» more  ICDM 2010»
13 years 8 months ago
Exploiting Unlabeled Data to Enhance Ensemble Diversity
Ensemble learning aims to improve generalization ability by using multiple base learners. It is well-known that to construct a good ensemble, the base learners should be accurate a...
Min-Ling Zhang, Zhi-Hua Zhou
IPPS
2010
IEEE
13 years 7 months ago
Attack-resistant frequency counting
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
Bo Wu, Jared Saia, Valerie King
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
13 years 7 months ago
Gaussian Processes for Sample Efficient Reinforcement Learning with RMAX-Like Exploration
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
Tobias Jung, Peter Stone
DMIN
2009
136views Data Mining» more  DMIN 2009»
13 years 7 months ago
Evaluating Algorithms for Concept Description
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...
Cecilia Sönströd, Ulf Johansson, Tuve L&...