155 search results - page 5 / 31 » An efficient algorithm for mining closed inter-transaction i... |
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folksonomies. ...
CLA
2007
14 years 11 months ago
2007
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
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 ...
177
click to vote
ICDE
2003
IEEE
15 years 10 months ago
2003
IEEE
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
APWEB
2005
Springer
15 years 3 months ago
2005
Springer
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...