Sciweavers

1215 search results - page 149 / 243
» Numbers in Multi-relational Data Mining
Sort
View
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
15 years 11 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
165
Voted
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 8 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
16 years 5 months ago
Outlier detection by sampling with accuracy guarantees
An effective approach to detect anomalous points in a data set is distance-based outlier detection. This paper describes a simple sampling algorithm to efficiently detect distance...
Mingxi Wu, Chris Jermaine
KDD
2006
ACM
163views Data Mining» more  KDD 2006»
16 years 5 months ago
New EM derived from Kullback-Leibler divergence
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
Longin Jan Latecki, Marc Sobel, Rolf Lakämper
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 5 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney