Sciweavers

279 search results - page 31 / 56
» Methods for finding frequent items in data streams
Sort
View
ALMOB
2006
138views more  ALMOB 2006»
13 years 7 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
DAWAK
2006
Springer
13 years 11 months ago
Two New Techniques for Hiding Sensitive Itemsets and Their Empirical Evaluation
Many privacy preserving data mining algorithms attempt to selectively hide what database owners consider as sensitive. Specifically, in the association-rules domain, many of these ...
Ahmed HajYasien, Vladimir Estivill-Castro
PAKDD
2005
ACM
161views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Online Algorithms for Mining Inter-stream Associations from Large Sensor Networks
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...
K. K. Loo, Ivy Tong, Ben Kao
DAGSTUHL
2007
13 years 9 months ago
Multi-Aspect Tagging for Collaborative Structuring
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...
Katharina Morik, Michael Wurst
ICCS
2004
Springer
14 years 1 months ago
A Note on Data-Driven Contaminant Simulation
Abstract. In this paper we introduce a numerical procedure for performing dynamic data driven simulations (DDDAS). The main ingredient of our simulation is the multiscale interpola...
Craig C. Douglas, Chad E. Shannon, Yalchin Efendie...