Sciweavers

148 search results - page 10 / 30
» Frequent Itemsets Mining for Database Auto-Administration
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Mining frequent itemsets in time-varying data streams
Mining frequent itemsets in data streams is beneficial to many real-world applications but is also a challenging task since data streams are unbounded and have high arrival rates...
Yingying Tao, M. Tamer Özsu
FIMI
2004
161views Data Mining» more  FIMI 2004»
13 years 9 months ago
ABS: Adaptive Borders Search of frequent itemsets
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
Frédéric Flouvat, Fabien De Marchi, ...
ADBIS
1998
Springer
118views Database» more  ADBIS 1998»
14 years 21 days ago
Itemset Materializing for Fast Mining of Association Rules
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
Marek Wojciechowski, Maciej Zakrzewicz
LWA
2004
13 years 9 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
AUSDM
2007
Springer
131views Data Mining» more  AUSDM 2007»
14 years 2 months ago
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
Alva Erwin, Raj P. Gopalan, N. R. Achuthan