Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Light Gated Recurrent Units for Speech Recognition
2018267 citationsMirco Ravanelli, Philémon Brakel et al.IEEE Transactions on Emerging Topics in Computational Intelligenceprofile →
Citations per year, relative to Philémon Brakel Philémon Brakel (= 1×)
peers
Tianmeng Yang
Countries citing papers authored by Philémon Brakel
Since
Specialization
Citations
This map shows the geographic impact of Philémon Brakel's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Philémon Brakel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Philémon Brakel more than expected).
This network shows the impact of papers produced by Philémon Brakel. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Philémon Brakel. The network helps show where Philémon Brakel may publish in the future.
Co-authorship network of co-authors of Philémon Brakel
This figure shows the co-authorship network connecting the top 25 collaborators of Philémon Brakel.
A scholar is included among the top collaborators of Philémon Brakel based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Philémon Brakel. Philémon Brakel is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Verstraeten, David, et al.. (2012). Oger: modular learning architectures for large-scale sequential processing. Journal of Machine Learning Research. 13(1). 2995–2998.19 indexed citations
11.
Brakel, Philémon & Stefan L. Frank. (2009). Strong systematicity in sentence processing by simple recurrent networks. UvA-DARE (University of Amsterdam). 31(31). 1599–1604.11 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.