Sciweavers

2712 search results - page 493 / 543
» On learning algorithm selection for classification
Sort
View
ECCV
2010
Springer
14 years 2 months ago
Reweighted Random Walks for Graph Matching
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
Minsu Cho (Seoul National University), Jungmin Lee...
ICAI
2004
13 years 10 months ago
A Comparison of Resampling Methods for Clustering Ensembles
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
Behrouz Minaei-Bidgoli, Alexander P. Topchy, Willi...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 9 months ago
Dendritic Cells for Anomaly Detection
Artificial immune systems, more specifically the negative selection algorithm, have previously been applied to intrusion detection. The aim of this research is to develop an intrus...
Julie Greensmith, Jamie Twycross, Uwe Aickelin
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
14 years 9 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 3 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang