4908 search results - page 640 / 982 » On the Complexity of Optimal K-Anonymity |
176
click to vote
DAGM
2004
Springer
16 years 7 days ago
2004
Springer
We present an approach to discretizing multivariate continuous data while learning the structure of a graphical model. We derive the joint scoring function from the principle of p...
190
click to vote
DIS
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...
199
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. Training neural networks is a complex task of great importance in the supervised learning field of research. In this work we tackle this problem with five algorithms, a...
153
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
It has been shown empirically that the XCS classifier system solves typical classification problems in a machine learning competitive way. However, until now, no learning time es...
168
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...