World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
6803
World Ranking
6612
National Ranking
2919

Overview

Ruoming Jin is affiliated with Kent State University in the United States and focuses primarily on the field of Computer Science. Their research spans a broad range of topics including Artificial Intelligence, Information Systems, Social Psychology, Clinical Psychology, and Computer Vision and Pattern Recognition.

The main areas of study for Ruoming Jin include:

  • Artificial Intelligence
  • Information Systems
  • Social Psychology
  • Clinical Psychology
  • Computer Vision and Pattern Recognition

The scientist has contributed extensively to several core topics within these fields. Their research topics often address:

  • Privacy-Preserving Technologies in Data
  • Recommender Systems and Techniques
  • Mental Health via Writing
  • Advanced Graph Neural Networks
  • Advanced Bandit Algorithms Research
  • Digital Mental Health Interventions
  • Stochastic Gradient Optimization Techniques

Ruoming Jin has published numerous papers in various prestigious venues. Significant recent publications include:

  • "Identifying the Edges of the Optic Cup and the Optic Disc in Glaucoma Patients by Segmentation" (2023) in Sensors
  • "Unsupervised Adversarial Network Alignment with Reinforcement Learning" (2021) in ACM Transactions on Knowledge Discovery from Data
  • "Investigating COVID-19's Impact on Mental Health: Trend and Thematic Analysis of Reddit Users' Discourse" (2023) in Journal of Medical Internet Research
  • "Federated Fingerprint Learning with Heterogeneous Architectures" (2022) in 2022 IEEE International Conference on Data Mining (ICDM)
  • "User Dynamics and Thematic Exploration in r/Depression During the COVID-19 Pandemic: Insights From Overlapping r/SuicideWatch Users" (2024) in Journal of Medical Internet Research

The scientist frequently publishes in venues such as arXiv (Cornell University), Journal of Medical Internet Research, Proceedings of the AAAI Conference on Artificial Intelligence, ACM Transactions on Knowledge Discovery from Data, and JMIR Infodemiology.

Collaborations form an important aspect of Ruoming Jin's research activities. Frequent coauthors include:

  • Deric R. Kenne
  • NhatHai Phan
  • Jianfeng Zhu
  • Dejing Dou
  • Dong Li

In addition to journal and conference papers, Ruoming Jin has contributed to book publications. A notable work is "Computational Data and Social Networks," published in 2021 by Springer Science+Business Media.

Best Publications

  • 3-HOP: a high-compression indexing scheme for reachability query

    Ruoming Jin;Yang Xiang;Ning Ruan;David Fuhry

  • A Survey of Algorithms for Dense Subgraph Discovery

    Victor E. Lee;Ning Ruan;Ruoming Jin;Charu C. Aggarwal

  • Efficient decision tree construction on streaming data

    Ruoming Jin;Gagan Agrawal

  • Efficiently answering reachability queries on very large directed graphs

    Ruoming Jin;Yang Xiang;Ning Ruan;Haixun Wang

  • Shared Memory Paraellization of Data Mining Algorithms: Techniques, Programming Interface, and Performance.

    Ruoming Jin;Gagan Agrawal

  • Shared memory parallelization of data mining algorithms: techniques, programming interface, and performance

    Ruoming Jin;Ge Yang;G. Agrawal

  • A Topic Modeling Approach and Its Integration into the Random Walk Framework for Academic Search

    Jie Tang;Ruoming Jin;Jing Zhang

  • Distance-constraint reachability computation in uncertain graphs

    Ruoming Jin;Lin Liu;Bolin Ding;Haixun Wang

  • Large scale real-time ridesharing with service guarantee on road networks

    Yan Huang;Favyen Bastani;Ruoming Jin;Xiaoyang Sean Wang

  • Robust local community detection: on free rider effect and its elimination

    Yubao Wu;Ruoming Jin;Jing Li;Xiang Zhang

  • An algorithm for in-core frequent itemset mining on streaming data

    Ruoming Jin;G. Agrawal

  • Fast and exact out-of-core and distributed k -means clustering

    Ruoming Jin;Anjan Goswami;Gagan Agrawal

  • Computing label-constraint reachability in graph databases

    Ruoming Jin;Hui Hong;Haixun Wang;Ning Ruan

  • Communication and Memory Efficient Parallel Decision Tree Construction.

    Ruoming Jin;Gagan Agrawal

  • Shared memory parallelization of data mining algorithms: techniques, programming interface, and performance

    Unknown

  • A highway-centric labeling approach for answering distance queries on large sparse graphs

    Ruoming Jin;Ning Ruan;Yang Xiang;Victor Lee

  • Data discretization unification

    Ruoming Jin;Yuri Breitbart;Chibuike Muoh

  • Learning personal + social latent factor model for social recommendation

    Yelong Shen;Ruoming Jin

  • Topic level expertise search over heterogeneous networks

    Jie Tang;Jing Zhang;Ruoming Jin;Zi Yang

  • Axiomatic ranking of network role similarity

    Ruoming Jin;Victor E. Lee;Hui Hong

  • Discovering highly reliable subgraphs in uncertain graphs

    Ruoming Jin;Lin Liu;Charu C. Aggarwal

  • 3-HOP:AHigh-CompressionIndexingSchemefor ReachabilityQuery

    Ruoming Jin;Yang Xiang;Ning Ruan;David Fuhry

Frequent Co-Authors

Gagan Agrawal
Gagan Agrawal Augusta University
Haixun Wang
Haixun Wang Instacart
Jeffrey Xu Yu
Jeffrey Xu Yu Chinese University of Hong Kong
My T. Thai
My T. Thai University of Florida
Yan Huang
Yan Huang University of North Texas
Xiang Zhang
Xiang Zhang University of Hong Kong
Yuri Breitbart
Yuri Breitbart Kent State University
Feodor F. Dragan
Feodor F. Dragan Kent State University
Charu C. Aggarwal
Charu C. Aggarwal IBM (United States)
Xinyue Ye
Xinyue Ye Texas A&M University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online education opens up flexible and accessible pathways into computer science and related fields. For students managing a tight budget, cheapest online degrees are available, enabling you to gain valuable qualifications without overwhelming financial stress.

Worried about GPA requirements? Many online graduate schools with low gpa requirements provide opportunities for those looking to advance their education regardless of prior academic performance.

Computer science skills can also open career doors across various industries. For example, tech expertise is increasingly important in environmental work. Learn more about what can you do with an environmental science degree—including roles that blend technology with sustainability and research.

If you’re eager to fast-track your education, some schools offer a 1 year computer science degree online, letting you upskill and enter the workforce sooner. Whichever route you choose, online degrees provide flexibility and real-world opportunity.

Best Scientists Citing Ruoming Jin

Trending Scientists

Recently Published Articles