This map shows the geographic impact of Chi-Jen Lu'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 Chi-Jen Lu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chi-Jen Lu more than expected).
This network shows the impact of papers produced by Chi-Jen Lu. 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 Chi-Jen Lu. The network helps show where Chi-Jen Lu may publish in the future.
Co-authorship network of co-authors of Chi-Jen Lu
This figure shows the co-authorship network connecting the top 25 collaborators of Chi-Jen Lu.
A scholar is included among the top collaborators of Chi-Jen Lu 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 Chi-Jen Lu. Chi-Jen Lu is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Lu, Chi-Jen, et al.. (2018). Efficient Mechanisms for Peer Grading and Dueling Bandits. Asian Conference on Machine Learning. 740–755.1 indexed citations
5.
Lu, Chi-Jen, et al.. (2017). Tensor Decomposition via Simultaneous Power Iteration. KTH Publication Database DiVA (KTH Royal Institute of Technology). 3665–3673.4 indexed citations
6.
Wei, Chen-Yu, et al.. (2016). Tracking the Best Expert in Non-stationary Stochastic Environments. Neural Information Processing Systems. 29. 3972–3980.1 indexed citations
Chen, Shang-Tse, Hsuan-Tien Lin, & Chi-Jen Lu. (2014). Boosting with Online Binary Learners for the Multiclass Bandit Problem. International Conference on Machine Learning. 342–350.5 indexed citations
9.
Lin, Hsuan-Tien, et al.. (2014). Pseudo-reward Algorithms for Contextual Bandits with Linear Payoff Functions. Asian Conference on Machine Learning. 344–359.1 indexed citations
10.
Chiang, Chao-Kai, et al.. (2013). Beating bandits in gradually evolving worlds. Conference on Learning Theory. 210–227.3 indexed citations
Chang, Fu, et al.. (2010). Tree Decomposition for Large-Scale SVM Problems. Journal of Machine Learning Research. 11(98). 2935–2972.46 indexed citations
Lu, Chi-Jen. (1999). A deterministic approximation algorithm for a minmax integer programming problem. Symposium on Discrete Algorithms. 663–668.5 indexed citations
20.
Wang, Biing-Feng, Chi-Jen Lu, & Gen-Huey Chen. (1990). Constant Time Algorithms for the Transitive Closure Problem and Its Applications.. Proceedings of the International Conference on Parallel Processing. 52–59.9 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.