98 search results - page 14 / 20 » Parallel Mining of Maximal Frequent Itemsets from Databases |
AUSAI
2003
Springer
14 years 25 days ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
IJFCS
2008
13 years 7 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
ICDE
2006
IEEE
14 years 1 months ago
2006
IEEE
It has been well recognized that data mining is an interactive and iterative process. In order to support this process, one of the long-term goals of data mining research has been...
ICDM
2003
IEEE
14 years 27 days ago
2003
IEEE
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...