1411 search results - page 209 / 283 » Link Prediction in Relational Data |
PKDD
1999
Springer
14 years 1 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
JPDC
2006
13 years 9 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
DMIN
2009
13 years 7 months ago
2009
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...