155 search results - page 7 / 31 » An efficient algorithm for mining closed inter-transaction i... |
IDEAL
2004
Springer
15 years 2 months ago
2004
Springer
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...
KDD
2006
ACM
15 years 9 months ago
2006
ACM
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
109
click to vote
IDA
2002
Springer
14 years 9 months ago
2002
Springer
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
ML
2010
ACM
14 years 7 months ago
2010
ACM
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
PAKDD
2010
ACM
14 years 11 months ago
2010
ACM
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...