a person in the record
Ruslan Salakhutdinov
Computer scientist
Supervised 3 doctoral students; doctorate in 2010 under Geoffrey Hinton; Wikidata lists 4 doctoral students. Linked to Wikidata, ORCID, and 5 other registers.
How to read the markscited by a repository's recordstated by Wikidata or indexed by OpenAlexclaimed on an ORCID list, or inferred
Advisors1
- cited by a thesis recordstated by Wikidata
Geoffrey Hinton“Learning Deep Generative Models”
2010 · doctoral
Students3
- cited by a thesis record
- cited by a thesis record
- cited by a thesis record
Students on Wikidata4
From Wikidata, shown separately from the thesis records.
- stated by Wikidataborn 1992
- stated by Wikidata
- stated by Wikidata
- stated by Wikidata
The line above and below4 steps
The advisors of their advisors, four steps up at most, in the thesis records and on Wikidata, each kind marked; a person in both is listed once.
- 1 step up
cited by a thesis recordstated by WikidataGeoffrey Hinton
- 2 steps up
stated by WikidataH. Christopher Longuet-Higgins
- 3 steps up
stated by WikidataCharles Coulson
- 4 steps up
stated by WikidataJohn Lennard-Jonesstated by WikidataRalph H. Fowler
Below them, within 3 steps, the record reaches 7 people: 3 cited by thesis records, 4 stated by Wikidata.
Theses2
- cited by a thesis record
Efficient optimization algorithms for learning
2003 · master's · the thesis's own page › - cited by a thesis record
Learning Deep Generative Models
2010 · doctoral · Computer Science · in en_ca · the thesis's own page ›
Education and career7
From Wikidata, shown separately from the thesis records. Each place opens its Wikidata item.
- 1998 to 2001studied
- 2001 to 2003studied
- 2005 to 2009studied
- 2009 to 2011
- 2011 to 2016worked
- from 2016worked
- from 2016
Works2
2003most in 2003: 12010
2003 to 2010 · held from 1 repository · a work missing?
- cited by University of Toronto TSpace's record
Learning Deep Generative Models
2010 · doctoral thesis · University of Toronto TSpace - cited by University of Toronto TSpace's record
Efficient optimization algorithms for learning
2003 · master's thesis · University of Toronto TSpace
What their ORCID record lists
The works their own ORCID record lists, as they claim them: shown apart from the record's works, never checked or counted with them.
ORCID is asked for the list when this part is opened.