Sciweavers

2705 search results - page 312 / 541
» Privacy in Data Mining Using Formal Methods
Sort
View
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
16 years 7 months ago
Robust boosting and its relation to bagging
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
Saharon Rosset
PAKDD
2007
ACM
143views Data Mining» more  PAKDD 2007»
16 years 24 days ago
Clustering Ensembles Based on Normalized Edges
The co-association (CA) matrix was previously introduced to combine multiple partitions. In this paper, we analyze the CA matrix, and address its difference from the similarity ma...
Yan Li, Jian Yu, Pengwei Hao, Zhulin Li
ICDM
2006
IEEE
183views Data Mining» more  ICDM 2006»
16 years 22 days ago
Accelerating Newton Optimization for Log-Linear Models through Feature Redundancy
— Log-linear models are widely used for labeling feature vectors and graphical models, typically to estimate robust conditional distributions in presence of a large number of pot...
Arpit Mathur, Soumen Chakrabarti
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
15 years 11 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
VG
2001
15 years 8 months ago
A Study of Transfer Function Generation for Time-Varying Volume Data
The proper usage and creation of transfer functions for time-varying data sets is an often ignored problem in volume visualization. Although methods and guidelines exist for time-i...
T. J. Jankun-Kelly, Kwan-Liu Ma