2135 search results - page 376 / 427 » Database Paper - The IRI Marketing Data Set |
170
click to vote
SIGMOD
2005
ACM
16 years 21 days ago
2005
ACM
Relational DBMS typically execute concurrent queries independently by invoking a set of operator instances for each query. To exploit common data retrievals and computation in con...
134
Voted
KDD
2010
ACM
15 years 4 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
109
click to vote
PODS
2002
ACM
16 years 21 days ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
100
click to vote
VLDB
2001
ACM
15 years 5 months ago
2001
ACM
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
101
click to vote
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Learning a sequence classifier means learning to predict a sequence of output tags based on a set of input data items. For example, recognizing that a handwritten word is "ca...