44 search results - page 6 / 9 » Distributed mining of maximal frequent itemsets from databas... |
IDA
2007
Springer
14 years 1 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...
CIKM
2009
Springer
14 years 7 days ago
2009
Springer
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
KDD
1999
ACM
13 years 12 months ago
1999
ACM
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
CIB
2004
13 years 7 months ago
2004
In multi-database mining, there can be many local patterns (frequent itemsets or association rules) in each database. At the end of multi-database mining, it is necessary to analyz...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...