Sciweavers

PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
13 years 11 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
PKDD
2000
Springer
113views Data Mining» more  PKDD 2000»
13 years 11 months ago
CEM-Visualisation and Discovery in Email
Abstract. This paper presents a lattice-based visual metaphor for knowledge discovery in electronic mail. It allow a user to navigate email using a visual lattice metaphor rather t...
Richard J. Cole II, Peter W. Eklund, Gerd Stumme
PKDD
2000
Springer
134views Data Mining» more  PKDD 2000»
13 years 11 months ago
Induction of Multivariate Decision Trees by Using Dipolar Criteria
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
Leon Bobrowski, Marek Kretowski
PKDD
2000
Springer
83views Data Mining» more  PKDD 2000»
13 years 11 months ago
Discovering Task Neighbourhoods Through Landmark Learning Performances
Hilan Bensusan, Christophe G. Giraud-Carrier
PKDD
2000
Springer
100views Data Mining» more  PKDD 2000»
13 years 11 months ago
Learning Right Sized Belief Networks by Means of a Hybrid Methodology
Previous algoritms for the construction of belief networks structures from data are mainly based either on independence criteria or on scoring metrics. The aim of this paper is to ...
Silvia Acid, Luis M. de Campos