Sciweavers

1859 search results - page 32 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
133
Voted
ACMSE
2010
ACM
14 years 9 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
127
Voted
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
15 years 7 months ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 3 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
121
Voted
ICCV
2009
IEEE
15 years 5 days ago
Learning image similarity from Flickr groups using Stochastic Intersection Kernel MAchines
Measuring image similarity is a central topic in computer vision. In this paper, we learn similarity from Flickr groups and use it to organize photos. Two images are similar if th...
Gang Wang, Derek Hoiem, David A. Forsyth
ICCV
2011
IEEE
14 years 2 months ago
Learning to Cluster Using High Order Graphical Models with Latent Variables
This paper proposes a very general max-margin learning framework for distance-based clustering. To this end, it formulates clustering as a high order energy minimization problem w...
Nikos Komodakis