SSPR
1998
Springer
13 years 8 months ago
1998
Springer
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...
DOLAP
1998
ACM
13 years 8 months ago
1998
ACM
Star schema has been a typical model for both online transaction processing in traditional databases and online analytical processing in large data warehouses. In the star schema,...
KDD
1999
ACM
13 years 8 months ago
1999
ACM
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
IDEAS
1999
IEEE
13 years 8 months ago
1999
IEEE
Data-warehousing applications cope with enormous data sets in the range of Gigabytes and Terabytes. Queries usually either select a very small set of this data or perform aggregat...
VISUALIZATION
2000
IEEE
13 years 9 months ago
2000
IEEE
We present a new algorithm for material boundary interface reconstruction from data sets containing volume fractions. We transform the reconstruction problem to a problem that ana...
ICPR
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper we introduce a novel way of modeling distributions with a low latent dimensionality. Our method allows for a strict control of the properties of the mapping between ...
ICDT
2001
ACM
13 years 9 months ago
2001
ACM
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
EPIA
2001
Springer
13 years 9 months ago
2001
Springer
The goal of this paper is to further investigate the extreme behaviour of the proportional membership model (FCPM) in contrast to the central tendency of fuzzy c-means (FCM). A dat...
ECML
2001
Springer
13 years 9 months ago
2001
Springer
Labeled data for classification could often be obtained by sampling that restricts or favors choice of certain classes. A classifier trained using such data will be biased, resulti...
COLT
2001
Springer
13 years 9 months ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...