𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Learning to rank on graphs

✍ Scribed by Shivani Agarwal

Publisher
Springer
Year
2010
Tongue
English
Weight
844 KB
Volume
81
Category
Article
ISSN
0885-6125

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Preference-based learning to rank
Preference-based learning to rank
✍ Nir Ailon; Mehryar Mohri πŸ“‚ Article πŸ“… 2010 πŸ› Springer 🌐 English βš– 547 KB
On thep-ranks of net graphs
On thep-ranks of net graphs
✍ RenΓ© Peeters πŸ“‚ Article πŸ“… 1995 πŸ› Springer 🌐 English βš– 669 KB
An efficient algorithm for learning to r
An efficient algorithm for learning to rank from
✍ Tapio Pahikkala; Evgeni Tsivtsivadze; Antti Airola; Jouni JΓ€rvinen; Jorma Boberg πŸ“‚ Article πŸ“… 2009 πŸ› Springer 🌐 English βš– 770 KB
On the intersection rank of a graph
On the intersection rank of a graph
✍ James A. Wiseman πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 748 KB

Wiseman, J.A., On the intersection rank of a graph, Discrete Mathematics 104 293-305.