World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
49
Citations
13816
World Ranking
5778
National Ranking
2627

Overview

Aram Galstyan is affiliated with the University of Southern California in the United States. Their research primarily engages with the field of Computer Science, encompassing 183 publications with a focus on multiple subfields such as Artificial Intelligence, Computer Vision and Pattern Recognition, Molecular Biology, Statistics and Probability, and Statistical and Nonlinear Physics.

The scientist's work covers a diverse range of topics within these areas, including:

  • Topic Modeling
  • Natural Language Processing Techniques
  • Domain Adaptation and Few-Shot Learning
  • Adversarial Robustness in Machine Learning
  • Advanced Graph Neural Networks
  • Multimodal Machine Learning Applications
  • Speech and Dialogue Systems

Galstyan's recent papers reflect active involvement in several research directions. Notable publications include:

  • "A Survey on Bias and Fairness in Machine Learning" (2021), published in ACM Computing Surveys
  • "Stacking models for nearly optimal link prediction in complex networks" (2020), published in Proceedings of the National Academy of Sciences
  • "Identifying and Analyzing Cryptocurrency Manipulations in Social Media" (2021), published in IEEE Transactions on Computational Social Systems
  • "Partner-Assisted Learning for Few-Shot Image Classification" (2021), presented at the 2021 IEEE/CVF International Conference on Computer Vision (ICCV)
  • "A survey of human judgement and quantitative forecasting methods" (2021), published in Royal Society Open Science

Frequent coauthors contributing to these research efforts include Greg Ver Steeg, Ninareh Mehrabi, Kai-Wei Chang, Fred Morstatter, and Jwala Dhamala. Collaboration with these researchers spans multiple projects and publications.

Publication venues where Galstyan frequently contributes comprise:

  • arXiv (Cornell University)
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Proceedings of the International AAAI Conference on Web and Social Media
  • ACM Computing Surveys
  • Proceedings of the National Academy of Sciences

Best Publications

  • A Survey on Bias and Fairness in Machine Learning

    Ninareh Mehrabi;Fred Morstatter;Nripsuta Saxena;Kristina Lerman

  • Multitask learning and benchmarking with clinical time series data.

    Hrayr Harutyunyan;Hrant Khachatrian;David C. Kale;Greg Ver Steeg

  • The DARPA Twitter Bot Challenge

    V.S. Subrahmanian;Amos Azaria;Skylar Durst;Vadim Kagan

  • The DARPA Twitter Bot Challenge

    V.S. Subrahmanian;Amos Azaria;Skylar Durst;Vadim Kagan

  • A review of probabilistic macroscopic models for swarm robotic systems

    Kristina Lerman;Alcherio Martinoli;Aram Galstyan

  • Distributed online localization in sensor networks using a moving target

    Aram Galstyan;Bhaskar Krishnamachari;Kristina Lerman;Sundeep Pattem

  • Analysis of Dynamic Task Allocation in Multi-Robot Systems

    Kristina Lerman;Chris Jones;Aram Galstyan;Maja J Mataríc

  • MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing

    Sami Abu-El-Haija;Bryan Perozzi;Amol Kapoor;Nazanin Alipourfard

  • Mathematical Model of Foraging in a Group of Robots: Effect of Interference

    Kristina Lerman;Aram Galstyan

  • Scalable Temporal Latent Space Inference for Link Prediction in Dynamic Social Networks

    Linhong Zhu;Dong Guo;Junming Yin;Greg Ver Steeg

  • Hormone-Inspired Self-Organization and Distributed Control of Robotic Swarms

    Wei-Min Shen;Peter Will;Aram Galstyan;Cheng-Ming Chuong

  • MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing

    Sami Abu-El-Haija;Bryan Perozzi;Amol Kapoor;Hrayr Harutyunyan

  • Information transfer in social media

    Greg Ver Steeg;Aram Galstyan

  • Predicting Online Extremism, Content Adopters, and Interaction Reciprocity

    Emilio Ferrara;Wen-Qiang Wang;Onur Varol;Alessandro Flammini

  • A macroscopic analytical model of collaboration in distributed robotic systems

    Kristina Lerman;Aram Galstyan;Alcherio Martinoli;Auke Ijspeert

  • Efficient Estimation of Mutual Information for Strongly Dependent Variables

    Shuyang Gao;Greg Ver Steeg;Aram Galstyan

  • Top-down vs bottom-up methodologies in multi-agent system design

    Valentino Crespi;Aram Galstyan;Kristina Lerman

  • Resource Allocation in the Grid Using Reinforcement Learning

    Aram Galstyan;Karl Czajkowski;Kristina Lerman

  • Analysis of social voting patterns on digg

    Kristina Lerman;Aram Galstyan

  • Stacking models for nearly optimal link prediction in complex networks.

    Amir Ghasemian;Amir Ghasemian;Amir Ghasemian;Homa Hosseinmardi;Aram Galstyan;Edoardo M. Airoldi

  • Invariant Representations without Adversarial Training

    Daniel Moyer;Shuyang Gao;Rob Brekelmans;Aram Galstyan

  • Scalable Link Prediction in Dynamic Networks via Non-Negative Matrix Factorization.

    Linhong Zhu;Greg Ver Steeg;Aram Galstyan

Frequent Co-Authors

Kristina Lerman
Kristina Lerman University of Southern California
Emilio Ferrara
Emilio Ferrara University of Southern California
Nanyun Peng
Nanyun Peng University of California, Los Angeles
Guillermo A. Cecchi
Guillermo A. Cecchi IBM (United States)
Paul R. Cohen
Paul R. Cohen University of Pittsburgh
Irina Rish
Irina Rish University of Montreal
Alexander G. Tartakovsky
Alexander G. Tartakovsky Moscow Institute of Physics and Technology
Ralph Weischedel
Ralph Weischedel University of Southern California
Paul M. Thompson
Paul M. Thompson University of Southern California
Alessandro Flammini
Alessandro Flammini Indiana 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 degrees in Computer Science or related fields is a practical option for many students, especially those who need flexibility. Cheapest online college programs provide quality education without the high cost, making Computer Science more accessible than ever before.

Worried about your academic record? Many online graduate programs that accept 2.0 GPA make it possible to launch a tech career even if your undergraduate grades weren’t ideal.

Online learning can also expand your career opportunities beyond programming or IT. For instance, if you’re interested in sustainability or policy, it’s worth asking, what can you do with an environmental studies degree? Options range from working in data analysis to environmental consulting and technology management.

If you want to enter the tech workforce as quickly as possible, consider a accelerated computer science degree. These programs are designed for swift completion and can fast-track your entry into a rewarding technology career.

Best Scientists Citing Aram Galstyan

Trending Scientists

Recently Published Articles