4886 search results - page 750 / 978 » Approximate Data Exchange |
178
click to vote
KDD
2003
ACM
16 years 4 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
175
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
133
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
To provide users with only relevant data from the huge amount of available information, personalization systems utilize preferences to allow users to express their interest on spe...
121
click to vote
DCC
2004
IEEE
16 years 4 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
135
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...