1313 search results - page 89 / 263 » Data Discretization Unification |
KDD
2001
ACM
14 years 10 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
IDA
2002
Springer
13 years 10 months ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
EDBT
2006
ACM
14 years 10 months ago
2006
ACM
The aim of this paper is to demonstrate Hermes, a robust framework capable of aiding a spatio-temporal database developer in modeling, constructing and querying a database with dyn...
GI
1998
Springer
14 years 2 months ago
1998
Springer
Computing aggregates over selected categories of multidimensional discrete data (MDD) cubes is the core operation of many on-line analytical processing (OLAP) systems. In order to...
NIPS
2001
13 years 11 months ago
2001
Estimating insurance premia from data is a difficult regression problem for several reasons: the large number of variables, many of which are discrete, and the very peculiar shape...