446 search results - page 59 / 90 » Randomization in Privacy-Preserving Data Mining |
PAKDD
2010
ACM
14 years 2 months ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
COMPGEOM
1997
ACM
14 years 2 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
RCIS
2010
13 years 8 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
CVPR
2008
IEEE
14 years 12 months ago
2008
IEEE
The selection of weak classifiers is critical to the success of boosting techniques. Poor weak classifiers do not perform better than random guess, thus cannot help decrease the t...
KDD
2012
ACM
12 years 11 days ago
2012
ACM
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...