1314 search results - page 25 / 263 » Approximate data mining in very large relational data |
SDM
2008
SIAM
13 years 8 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
VLDB
2004
ACM
14 years 23 days ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
KDD
2010
ACM
13 years 9 months ago
2010
ACM
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...