Sciweavers

7648 search results - page 237 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
CG
2004
Springer
15 years 7 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li
134
Voted
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
15 years 1 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
15 years 8 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu
CN
2006
145views more  CN 2006»
15 years 3 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
ICDM
2009
IEEE
111views Data Mining» more  ICDM 2009»
15 years 10 months ago
A Game Theoretical Model for Adversarial Learning
Abstract—It is now widely accepted that in many situations where classifiers are deployed, adversaries deliberately manipulate data in order to reduce the classifier’s accura...
Wei Liu, Sanjay Chawla