Learning to rank networked entities
cited 1 time -
details
Alekh Agarwal
Loading Google Thumbnails...
from Google Images |
- Sorted by Year/Conf, Year/Citation, Citation
| 2009 | ||
|---|---|---|
| 6 | A Stochastic View of Optimal Regret through Minimax Duality. Jacob Abernethy, Alekh Agarwal, Peter L. Bartlett, Alexander Rakhlin. CoRR (abs/0903.5328) (2009). Web SearchBibTeXDownload | |
| 2008 | ||
| 5 | Message-passing for graph-structured linear programs: proximal projections, convergence and rounding schemes. Pradeep D. Ravikumar, Alekh Agarwal, Martin J. Wainwright. ICML 2008, 800-807. Web SearchBibTeXDownload | |
| 2007 | ||
| 4 | Learning random walks to rank nodes in graphs. Alekh Agarwal, Soumen Chakrabarti. ICML 2007, 9-16. Web SearchBibTeXDownload | |
| 3 | An Analysis of Inference with the Universum. Fabian H. Sinz, Olivier Chapelle, Alekh Agarwal, Bernhard Schölkopf. NIPS 2007. Web SearchBibTeXDownload | |
| 2006 | ||
| 2 | Learning to rank networked entities. Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal. KDD 2006, 14-23. Web SearchBibTeXDownload | |
| 1 | Learning Parameters in Entity Relationship Graphs from Ranking Preferences. Soumen Chakrabarti, Alekh Agarwal. PKDD 2006, 91-102. Web SearchBibTeXDownload | |
from DBLP and Google Scholar