World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
63
Citations
17989
World Ranking
2731
National Ranking
119

Overview

Volker Tresp is affiliated with Ludwig-Maximilians-Universität München in Germany. Their research predominantly falls within the field of Computer Science, with a significant focus on Artificial Intelligence. The breadth of their work also covers subfields including Computer Vision and Pattern Recognition, Molecular Biology, Management Science and Operations Research, and Information Systems.

The scientist's research interests span multiple advanced topics, which include:

  • Topic Modeling
  • Advanced Graph Neural Networks
  • Multimodal Machine Learning Applications
  • Data Quality and Management
  • Natural Language Processing Techniques
  • Advanced Image and Video Retrieval Techniques
  • Domain Adaptation and Few-Shot Learning

Volker Tresp has contributed extensively to scholarly literature, frequently publishing in several academic venues. The most common publication outlets for their work are:

  • arXiv (Cornell University)
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Zenodo (CERN European Organization for Nuclear Research)
  • Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing
  • Lecture notes in computer science

Several recent papers highlight the range of their research focus. Notable works include:

  • TLogic: Temporal Logical Rules for Explainable Link Forecasting on Temporal Knowledge Graphs (2022), published in Proceedings of the AAAI Conference on Artificial Intelligence
  • Learning Neural Ordinary Equations for Forecasting Future Links on Temporal Knowledge Graphs (2021), published in Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing
  • PyKEEN 1.0: A Python Library for Training and Evaluating Knowledge Graph Embeddings (2020), published on arXiv (Cornell University)
  • A Systematic Survey of Prompt Engineering on Vision-Language Foundation Models (2023), published on arXiv (Cornell University)
  • Classification by Attention: Scene Graph Classification with Prior Knowledge (2021), published in Proceedings of the AAAI Conference on Artificial Intelligence

Throughout their career, Volker Tresp has collaborated frequently with several researchers. Their most common co-authors include:

  • Yunpu Ma
  • Jindong Gu
  • Sahand Sharifzadeh
  • Rajat Koner
  • Marcel Hildebrandt

Best Publications

  • A Three-Way Model for Collective Learning on Multi-Relational Data

    Maximilian Nickel;Volker Tresp;Hans-peter Kriegel

  • A Review of Relational Machine Learning for Knowledge Graphs

    Maximilian Nickel;Kevin Murphy;Volker Tresp;Evgeniy Gabrilovich

  • A Bayesian Committee Machine

    Volker Tresp

  • Learning Gaussian processes from multiple tasks

    Kai Yu;Volker Tresp;Anton Schwaighofer

  • Probabilistic memory-based collaborative filtering

    Kai Yu;A. Schwaighofer;V. Tresp;Xiaowei Xu

  • Factorizing YAGO: scalable machine learning for linked data

    Maximilian Nickel;Volker Tresp;Hans-Peter Kriegel

  • Active learning via transductive experimental design

    Kai Yu;Jinbo Bi;Volker Tresp

  • Method and device for the neuronal modelling of a dynamic system with non-linear stochastic behavior

    Thomas Briegel;Volker Tresp

  • Multi-label informed latent semantic indexing

    Kai Yu;Shipeng Yu;Volker Tresp

  • Representative sampling for text classification using support vector machines

    Zhao Xu;Kai Yu;Volker Tresp;Xiaowei Xu

  • Extraction of semantic biomedical relations from text using conditional random fields

    Markus Bundschus;Markus Bundschus;Mathaeus Dejori;Mathaeus Dejori;Martin Stetter;Volker Tresp

  • Stochastic Relational Models for Discriminative Link Prediction

    Kai Yu;Wei Chu;Shipeng Yu;Volker Tresp

  • Mixtures of Gaussian Processes

    Volker Tresp

  • Natural Language Questions for the Web of Data

    Mohamed Yahya;Klaus Berberich;Shady Elbassuoni;Maya Ramanath

  • Type-Constrained Representation Learning in Knowledge Graphs

    Denis Krompaβ;Stephan Baier;Volker Tresp

  • Learning Gaussian Process Kernels via Hierarchical Bayes

    Anton Schwaighofer;Volker Tresp;Kai Yu

  • Combining Estimators Using Non-Constant Weighting Functions

    Volker Tresp;Michiaki Taniguchi

  • Towards LarKC: A Platform for Web-Scale Reasoning

    D. Fensel;F. van Harmelen;B. Andersson;P. Brennan

  • Supervised probabilistic principal component analysis

    Shipeng Yu;Kai Yu;Volker Tresp;Hans-Peter Kriegel

  • Tensor-train recurrent neural networks for video classification

    Yinchong Yang;Denis Krompass;Volker Tresp

Frequent Co-Authors

Shipeng Yu
Shipeng Yu Pinterest
Hans-Peter Kriegel
Hans-Peter Kriegel Ludwig-Maximilians-Universität München
Hinrich Schütze
Hinrich Schütze Ludwig-Maximilians-Universität München
Xiaowei Xu
Xiaowei Xu University of Arkansas at Little Rock
Kristian Kersting
Kristian Kersting Technical University of Darmstadt
Thomas Seidl
Thomas Seidl Ludwig-Maximilians-Universität München
Stephan Günnemann
Stephan Günnemann Technical University of Munich
Jens Lehmann
Jens Lehmann University of Bonn
Evgeniy Gabrilovich
Evgeniy Gabrilovich Google (United States)

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 related to Computer Science opens up a range of options tailored to different career goals. Selecting the best degree to get depends on factors like your interests, desired career path, and commitment level.

If you are seeking flexibility or a quicker entry into the workforce, you might consider programs known as the what is the easiest masters degree to get. These programs can provide valuable skills without the extensive time or workload of more rigorous options.

For those interested in advancing research or pursuing academic leadership, pursuing affordable phd programs online is increasingly accessible. Such programs allow you to continue working while earning a respected credential at a lower cost.

Alternatively, if you're looking for a fast-track to educational leadership, accelerated edd programs online offer the opportunity to complete your degree in less time, often entirely online.

Carefully review program details, accreditation, and your personal career objectives to identify the best fit for your goals in Computer Science or related fields.

Best Scientists Citing Volker Tresp

Trending Scientists

Recently Published Articles