732 search results - page 28 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
SIGMOD
1998
ACM
13 years 12 months ago
1998
ACM
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In c...
IS
2008
13 years 7 months ago
2008
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
AUSDM
2007
Springer
14 years 1 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 ...
AMT
2006
Springer
13 years 9 months ago
2006
Springer
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
FIMI
2004
13 years 9 months ago
2004
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...