155 search results - page 14 / 31 » An efficient algorithm for mining closed inter-transaction i... |
65
Voted
AUSDM
2007
Springer
15 years 3 months ago
2007
Springer
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
177
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
DMIN
2006
14 years 11 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
DAWAK
2005
Springer
15 years 3 months ago
2005
Springer
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining alg...
101
click to vote
ADBIS
2004
Springer
15 years 2 months ago
2004
Springer
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...