214 search results - page 30 / 43 » New Parallel Algorithms for Frequent Itemset Mining in Very ... |
SIGMOD
1997
ACM
13 years 11 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
ICDM
2003
IEEE
14 years 11 hour ago
2003
IEEE
We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...
ECML
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
AIIA
2005
Springer
14 years 8 days ago
2005
Springer
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
ICDE
2012
IEEE
11 years 9 months ago
2012
IEEE
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...