Sciweavers

8381 search results - page 1150 / 1677
» The security of machine learning
Sort
View
ICML
2007
IEEE
16 years 8 months ago
Asymmetric boosting
A cost-sensitive extension of boosting, denoted as asymmetric boosting, is presented. Unlike previous proposals, the new algorithm is derived from sound decision-theoretic princip...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
ICML
2007
IEEE
16 years 8 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
ICML
2007
IEEE
16 years 8 months ago
Piecewise pseudolikelihood for efficient training of conditional random fields
Discriminative training of graphical models can be expensive if the variables have large cardinality, even if the graphical structure is tractable. In such cases, pseudolikelihood...
Charles A. Sutton, Andrew McCallum
ICML
2007
IEEE
16 years 8 months ago
Transductive regression piloted by inter-manifold relations
In this paper, we present a novel semisupervised regression algorithm working on multiclass data that may lie on multiple manifolds. Unlike conventional manifold regression algori...
Huan Wang, Shuicheng Yan, Thomas S. Huang, Jianzhu...
ICML
2007
IEEE
16 years 8 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
« Prev « First page 1150 / 1677 Last » Next »