1701 search results - page 54 / 341 » Providing k-anonymity in data mining |
154
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we propose a novel algorithm to discover the topk covering rule groups for each row of gene expression profiles. Several experiments on real bioinformatics datasets...
IJCAI
2007
14 years 11 months ago
2007
We investigate the problem of mining closed sets in multi-relational databases. Previous work introduced different semantics and associated algorithms for mining closed sets in mu...
PKDD
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Recent results on robust density-based clustering have indicated that the uncertainty associated with the actual measurements can be exploited to locate objects that are ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
ESWS
2008
Springer
14 years 11 months ago
2008
Springer
Exploiting the complex structure of relational data enables to build better models by taking into account the additional information provided by the links between objects. We exten...