2421 search results - page 81 / 485 » Measuring independence of datasets |
152
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
K-anonymisation is an approach to protecting privacy contained within a dataset. A good k-anonymisation algorithm should anonymise a dataset in such a way that private information...
129
click to vote
AAAI
2006
15 years 6 months ago
2006
Wikipedia provides a knowledge base for computing word relatedness in a more structured fashion than a search engine and with more coverage than WordNet. In this work we present e...
141
click to vote
ICN
2009
Springer
15 years 11 months ago
2009
Springer
Recent works on modeling the Internet topology [8, 9] have highlighted how the complexity of relationships between Autonomous Systems (ASes) can not be oversimplified without sac...
157
click to vote
IQ
2007
15 years 6 months ago
2007
: Sufficiently high data quality is crucial for almost every application. Nonetheless, data quality issues are nearly omnipresent. The reasons for poor quality cannot simply be bla...
147
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Random forests (RF) have been increasingly used in applications such as genome-wide association and microarray studies where predictor correlation is frequently observ...