284 search results - page 10 / 57 » Mining Frequent Itemsets in Distributed and Dynamic Database... |
AUSDM
2007
Springer
15 years 3 months ago
2007
Springer
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 ...
DKE
2008
14 years 9 months ago
2008
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...
IDEAS
2003
IEEE
15 years 2 months ago
2003
IEEE
With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The a...
101
click to vote
KDD
2012
ACM
13 years 2 days ago
2012
ACM
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
74
Voted
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...