288 search results - page 18 / 58 » Estimating the number of frequent itemsets in a large databa... |
259
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the exist...
158
click to vote
IDA
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
185
click to vote
JCP
2008
15 years 6 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
177
click to vote
DIS
2004
Springer
15 years 9 months ago
2004
Springer
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
166
click to vote
ICCS
2007
Springer
16 years 7 days ago
2007
Springer
Traditional association rules mining (ARM) only concerns the frequency of itemsets, which may not bring large amount of profit. Utility mining only focuses on itemsets with high ut...