1314 search results - page 148 / 263 » Approximate data mining in very large relational data |
119
click to vote
ISCI
2008
15 years 1 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
97
Voted
ALMOB
2007
15 years 2 months ago
2007
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...
117
Voted
EDBT
2006
ACM
16 years 2 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
105
Voted
NIPS
2003
15 years 3 months ago
2003
In models that define probabilities via energies, maximum likelihood learning typically involves using Markov Chain Monte Carlo to sample from the model’s distribution. If the ...
119
click to vote
PLDI
2012
ACM
13 years 4 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...