Sciweavers

3780 search results - page 112 / 756
» Algorithms for Game Metrics
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 1 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
120
Voted
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 29 days ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
CORR
2006
Springer
172views Education» more  CORR 2006»
15 years 18 days ago
Approximate Convex Optimization by Online Game Playing
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
Elad Hazan
ESORICS
2010
Springer
15 years 1 months ago
k-Zero Day Safety: Measuring the Security Risk of Networks against Unknown Attacks
The security risk of a network against unknown zero day attacks has been considered as something unmeasurable since software flaws are less predictable than hardware faults and the...
Lingyu Wang, Sushil Jajodia, Anoop Singhal, Steven...
115
Voted
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
16 years 26 days ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...