74 search results - page 10 / 15 » The complexity of mining maximal frequent itemsets and maxim... |
IDA
2007
Springer
14 years 2 months 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...
SDM
2011
SIAM
12 years 10 months ago
2011
SIAM
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
IS
2010
13 years 6 months ago
2010
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
IJFCS
2008
13 years 7 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...