Sciweavers

1413 search results - page 33 / 283
» Mining Multiple Large Databases
Sort
View
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
15 years 6 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
1998
ACM
192views Database» more  VLDB 1998»
15 years 5 months ago
Algorithms for Mining Distance-Based Outliers in Large Datasets
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...
Edwin M. Knorr, Raymond T. Ng
124
Voted
ICDE
2010
IEEE
177views Database» more  ICDE 2010»
15 years 8 months ago
Optimal load shedding with aggregates and mining queries
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
Barzan Mozafari, Carlo Zaniolo
RCIS
2010
15 years 2 days ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
CVPR
2010
IEEE
15 years 10 months ago
Exploiting Hierarchical Context on a Large Database of Object Categories
There has been a growing interest in exploiting contextual information in addition to local features to detect and localize multiple object categories in an image. Context models ...
Myung Jin Choi, Joseph Lim, Antonio Torralba, Alan...