Sciweavers

2100 search results - page 215 / 420
» Learning to rank on graphs
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 7 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
JITECH
2010
106views more  JITECH 2010»
15 years 5 months ago
Patterns and structures of intra-organizational learning networks within a knowledge-intensive organization
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
Miha Skerlavaj, Vlado Dimovski, Kevin C. Desouza
ICDM
2008
IEEE
142views Data Mining» more  ICDM 2008»
16 years 1 months ago
Unsupervised Face Annotation by Mining the Web
Searching for images of people is an essential task for image and video search engines. However, current search engines have limited capabilities for this task since they rely on ...
Duy-Dinh Le, Shin'ichi Satoh
NIPS
2004
15 years 8 months ago
Confidence Intervals for the Area Under the ROC Curve
In many applications, good ranking is a highly desirable performance for a classifier. The criterion commonly used to measure the ranking quality of a classification algorithm is ...
Corinna Cortes, Mehryar Mohri
MOBIHOC
2012
ACM
13 years 9 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang