732 search results - page 27 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
ICTAI
2003
IEEE
14 years 29 days ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
FIMI
2004
13 years 9 months ago
2004
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
Operating systems engineers have developed tracing tools that log details about process execution at the kernel level. These tools make it easier to understand the actual executio...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
In frequent geographic pattern mining a large amount of patterns can be non-novel and non-interesting. This problem has been addressed recently, and background knowledge is used t...