Sciweavers

960 search results - page 9 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
79
Voted
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
15 years 3 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
VLDB
1997
ACM
141views Database» more  VLDB 1997»
15 years 3 months ago
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
Thomas Seidl, Hans-Peter Kriegel
CORR
2006
Springer
178views Education» more  CORR 2006»
14 years 11 months ago
A tool set for the quick and efficient exploration of large document collections
: We are presenting a set of multilingual text analysis tools that can help analysts in any field to explore large document collections quickly in order to determine whether the do...
Camelia Ignat, Bruno Pouliquen, Ralf Steinberger, ...
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
15 years 3 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 3 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