14704 search results - page 2489 / 2941 » computing 2007 |
196
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
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...
149
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
It is often thought that learning algorithms that track the best solution, as opposed to converging to it, are important only on nonstationary problems. We present three results s...
170
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
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...
173
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
180
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
The aggregation and comparison of behavioral patterns on the WWW represent a tremendous opportunity for understanding past behaviors and predicting future behaviors. In this paper...