57 search results - page 2 / 12 » Probabilistic frameworks for privacy-aware data mining |
KDD
2005
ACM
13 years 9 months ago
2005
ACM
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
PAKDD
2007
ACM
13 years 10 months ago
2007
ACM
Abstract. We study the problem of mining frequent itemsets from uncertain data under a probabilistic framework. We consider transactions whose items are associated with existential...
KDD
2004
ACM
14 years 4 months ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
KDD
2007
ACM
14 years 4 months ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Mining association rules is an important technique for discovering meaningful patterns in transaction databases. Many different measures of interestingness have been proposed for ...