EDBT 2026 Demo / reviewers in the wild / expert
Frank Emmert-Streib
dblp:99/3214
· DBLP profile ↗
16ranked-venue papers in the field
2as first author
5since 2021 · last 2024
0000-0003-0745-5641ORCID · verified
Domains — venue-derived; a paper can count in several
Knowledge Engineering, Semantic Web & Information Systems · 15 (1 first)Information Retrieval & Web Search · 1 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Human Team Behavior and Predictability in the Massively Multiplayer Online Game WOT BlitzabstractMassively multiplayer online games (MMOGs) played on the Web provide a new form of social, computer-mediated interactions that allow the connection of millions of players worldwide. The rules governing team-based MMOGs are typically complex and nondeterministic giving rise to an intricate dynamical behavior. However, due to the novelty and complexity of MMOGs, their behavior is understudied. In this article, we investigate the MMOG World of Tanks Blitz by using a combined approach based on data science and complex adaptive systems. We analyze data on the population level to get insights into organizational principles of the game and its game mechanics. For this reason, we study the scaling behavior and the predictability of system variables. As a result, we find a power-law behavior on the population level revealing long-range interactions between system variables. Furthermore, we identify and quantify the predictability of summary statistics of the game and its decomposition into explanatory variables. This reveals a heterogeneous progression through the tiers and identifies only a single system variable as key driver for the win rate. Frank Emmert-Streib, Shailesh Tripathi, Matthias Dehmer |
ACM Trans. Web | 1 |
| 2022 | A data-centric review of deep transfer learning with applications to text dataabstractIn recent years, many applications are using various forms of deep learning models. Such methods are usually based on traditional learning paradigms requiring the consistency of properties among the feature spaces of the training and test data and also the availability of large amounts of training data, e.g., for performing supervised learning tasks. However, many real-world data do not adhere to such assumptions. In such situations transfer learning can provide feasible solutions, e.g., by simultaneously learning from data-rich source data and data-sparse target data to transfer information for learning a target task. In this paper, we survey deep transfer learning models with a focus on applications to text data. First, we review the terminology used in the literature and introduce a new nomenclature allowing the unequivocal description of a transfer learning model. Second, we introduce a visual taxonomy of deep learning approaches that provides a systematic structure to the many diverse models introduced until now. Furthermore, we provide comprehensive information about text data that have been used for studying such models because only by the application of methods to data, performance measures can be estimated and models assessed. Samar Bashath, Nadeesha Perera, Shailesh Tripathi, Kalifa Manjang, Matthias Dehmer, Frank Emmert-Streib |
Inf. Sci. | 6 |
| 2022 | The usefulness of topological indices
Yuede Ma, Matthias Dehmer, Urs-Martin Künzi, Shailesh Tripathi, Modjtaba Ghorbani, Frank Emmert-Streib |
Inf. Sci. | 7 |
| 2021 | On the relationship between PageRank and automorphisms of a graph
Modjtaba Ghorbani, Matthias Dehmer, Abdullah Lotfi, Najaf Amraei, Abbe Mowshowitz, Frank Emmert-Streib |
Inf. Sci. | 6 |
| 2021 | Relationships between symmetry-based graph measures
Yuede Ma, Matthias Dehmer, Urs-Martin Künzi, Abbe Mowshowitz, Shailesh Tripathi, Modjtaba Ghorbani, Frank Emmert-Streib |
Inf. Sci. | 7 |
| 2020 | On the zeros of the partial Hosoya polynomial of graphs
Modjtaba Ghorbani, Matthias Dehmer, Shujuan Cao, Lihua Feng, Frank Emmert-Streib |
Inf. Sci. | 6 |
| 2020 | On graph entropy measures based on the number of independent sets and matchings
Xinzhuang Chen, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib |
Inf. Sci. | 6 |
| 2019 | Towards detecting structural branching and cyclicity in graphs: A polynomial-based approach
Matthias Dehmer, Zengqiang Chen 0001, Frank Emmert-Streib, Abbe Mowshowitz, Yongtang Shi, Shailesh Tripathi, Yusen Zhang 0002 |
Inf. Sci. | 3 |
| 2019 | On the degeneracy of the Randić entropy and related graph measures
Matthias Dehmer, Zengqiang Chen 0001, Abbe Mowshowitz, Herbert Jodlbauer, Frank Emmert-Streib, Yongtang Shi, Shailesh Tripathi, Chengyi Xia |
Inf. Sci. | 5 |
| 2019 | Hermitian normalized Laplacian matrix for directed networks
Guihai Yu, Matthias Dehmer, Frank Emmert-Streib, Herbert Jodlbauer |
Inf. Sci. | 3 |
| 2018 | Graph measures with high discrimination power revisited: A random polynomial approach
Matthias Dehmer, Zengqiang Chen 0001, Frank Emmert-Streib, Yongtang Shi, Shailesh Tripathi |
Inf. Sci. | 3 |
| 2017 | Highly unique network descriptors based on the roots of the permanental polynomial
Matthias Dehmer, Frank Emmert-Streib, Yongtang Shi, Monica Stefu, Shailesh Tripathi |
Inf. Sci. | 2 |
| 2017 | Quantitative Graph Theory: A new branch of graph theory and network science
Matthias Dehmer, Frank Emmert-Streib, Yongtang Shi |
Inf. Sci. | 2 |
| 2016 | Fifty years of graph matching, network alignment and network comparison
Frank Emmert-Streib, Matthias Dehmer, Yongtang Shi |
Inf. Sci. | 1 |
| 2014 | A computational approach to construct a multivariate complete graph invariant
Matthias Dehmer, Frank Emmert-Streib, Martin Grabner |
Inf. Sci. | 2 |
| 2014 | Probabilistic inequalities for evaluating structural network measures
Veronika Kraus, Matthias Dehmer, Frank Emmert-Streib |
Inf. Sci. | 3 |