1314 search results - page 68 / 263 » Approximate data mining in very large relational data |
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...
115
click to vote
PKDD
2009
Springer
15 years 8 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
132
click to vote
DMIN
2009
14 years 11 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...
124
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
DAWAK
2000
Springer
15 years 6 months ago
2000
Springer
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...