51 search results - page 6 / 11 » MAFIA: A Performance Study of Mining Maximal Frequent Itemse... |
ACTA
2007
14 years 9 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
ISCIS
2004
Springer
15 years 2 months ago
2004
Springer
One of the classic data mining problems is discovery of frequent itemsets. This problem particularly attracts database community as it resembles traditional database querying. In t...
CINQ
2004
Springer
15 years 1 months ago
2004
Springer
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
104
click to vote
SDM
2011
SIAM
14 years 9 days 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...
DKE
2007
14 years 9 months ago
2007
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...