820 search results - page 54 / 164 » Finding low-utility data structures |
PKDD
2000
Springer
14 years 9 days ago
2000
Springer
Previous algoritms for the construction of belief networks structures from data are mainly based either on independence criteria or on scoring metrics. The aim of this paper is to ...
ALT
2003
Springer
14 years 12 days ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
UAI
2008
13 years 10 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...