Sciweavers

SSPR
1998
Springer
14 years 3 months ago
Distribution Free Decomposition of Multivariate Data
: 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...
Dorin Comaniciu, Peter Meer
DOLAP
1998
ACM
14 years 3 months ago
Dynamic Maintenance of Multidimensional Range Data Partitioning for Parallel Data Processing
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,...
Junping Sun, William I. Grosky
KDD
1999
ACM
199views Data Mining» more  KDD 1999»
14 years 3 months ago
The Application of AdaBoost for Distributed, Scalable and On-Line Learning
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...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang
IDEAS
1999
IEEE
123views Database» more  IDEAS 1999»
14 years 3 months ago
Improving OLAP Performance by Multidimensional Hierarchical Clustering
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...
Volker Markl, Frank Ramsak, Rudolf Bayer
VISUALIZATION
2000
IEEE
14 years 3 months ago
Constructing material interfaces from data sets with volume-fraction information
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...
Kathleen S. Bonnell, Kenneth I. Joy, Bernd Hamann,...
ICPR
2000
IEEE
14 years 3 months ago
Constrained Mixture Modeling of Intrinsically Low-Dimensional Distributions
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 ...
Joris Portegies Zwart, Ben J. A. Kröse
ICDT
2001
ACM
124views Database» more  ICDT 2001»
14 years 4 months ago
Mining for Empty Rectangles in Large Data Sets
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...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
EPIA
2001
Springer
14 years 4 months ago
Proportional Membership in Fuzzy Clustering as a Model of Ideal Types
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...
Susana Nascimento, Boris Mirkin, Fernando Moura-Pi...
ECML
2001
Springer
14 years 4 months ago
Classification on Data with Biased Class Distribution
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...
Slobodan Vucetic, Zoran Obradovic
COLT
2001
Springer
14 years 4 months ago
Geometric Bounds for Generalization in Boosting
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 ...
Shie Mannor, Ron Meir