81 search results - page 3 / 17 » Feasible itemset distributions in data mining: theory and ap... |
KDD
2007
ACM
14 years 6 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
KDD
2008
ACM
14 years 6 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
KDD
2002
ACM
14 years 6 months ago
2002
ACM
Privacy considerations often constrain data mining projects. This paper addresses the problem of association rule mining where transactions are distributed across sources. Each si...
CIKM
2009
Springer
13 years 10 months 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...
SDM
2007
SIAM
13 years 7 months ago
2007
SIAM
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. Increasing security concerns have led to a surge in w...