default search action
Christian M. M. Frey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Andrea Maldonado, Christian M. M. Frey, Gabriel Marques Tavares, Nikolina Rehwald, Thomas Seidl:
GEDI: Generating Event Data with Intentional Features for Benchmarking Process Mining. BPM 2024: 221-237 - [c8]Andrea Maldonado, Sai Anirudh Aryasomayajula, Christian M. M. Frey, Thomas Seidl:
iGEDI: interactive Generating Event Data with Intentional Features. ICPM Doctoral Consortium / Demo 2024 - [c7]Simon Rauch, Christian M. M. Frey, Ludwig Zellner, Thomas Seidl:
Process-Aware Bayesian Networks for Sequential Event Log Queries. ICPM 2024: 161-168 - [c6]Philipp Jahn, Christian M. M. Frey, Anna Beer, Collin Leiber
, Thomas Seidl:
Data with Density-Based Clusters: A Generator for Systematic Evaluation of Clustering Algorithms. ECML/PKDD (7) 2024: 3-21 - 2023
- [b1]Christian M. M. Frey:
Learning from complex networks. Ludwig Maximilian University of Munich, Germany, 2023 - [j3]Christian M. M. Frey, Alexander Jungwirth
The vehicle routing problem with time windows and flexible delivery locations. Eur. J. Oper. Res. 308(3): 1142-1159 (2023) - [c5]Anna Beer
Connecting the Dots - Density-Connectivity Distance unifies DBSCAN, k-Center and Spectral Clustering. KDD 2023: 80-92 - [c4]Sandra Gilhuber, Julian Busch, Daniel Rotthues, Christian M. M. Frey, Thomas Seidl:
DiffusAL: Coupling Active Learning with Graph Diffusion for Label-Efficient Node Classification. ECML/PKDD (1) 2023: 75-91 - [i5]Sandra Gilhuber, Julian Busch, Daniel Rotthues, Christian M. M. Frey, Thomas Seidl:
DiffusAL: Coupling Active Learning with Graph Diffusion for Label-Efficient Node Classification. CoRR abs/2308.00146 (2023) - 2022
- [j2]Ellen Hohma, Christian M. M. Frey, Anna Beer
SCAR - Spectral Clustering Accelerated and Robustified. Proc. VLDB Endow. 15(11): 3031-3044 (2022) - [c3]Christian M. M. Frey
SEA: Graph Shell Attention in Graph Neural Networks. ECML/PKDD (2) 2022: 326-343 - [i4]Christian M. M. Frey, Matthias Schubert:
V-Coder: Adaptive AutoEncoder for Semantic Disclosure in Knowledge Graphs. CoRR abs/2208.01735 (2022) - 2021
- [i3]Christian M. M. Frey, Yunpu Ma, Matthias Schubert:
SEA: Graph Shell Attention in Graph Neural Networks. CoRR abs/2110.10674 (2021) - [i2]Christian M. M. Frey, Yunpu Ma, Matthias Schubert:
MIRA: Multihop Relation Prediction in Temporal Knowledge Graphs. CoRR abs/2110.14284 (2021)
2010 – 2019
- 2018
- [j1]Christian M. M. Frey
Efficient Information Flow Maximization in Probabilistic Graphs. IEEE Trans. Knowl. Data Eng. 30(5): 880-894 (2018) - [c2]Christian M. M. Frey, Andreas Züfle, Tobias Emrich, Matthias Renz:
Efficient Information Flow Maximization in Probabilistic Graphs (Extended Abstract). ICDE 2018: 1801-1802 - 2017
- [i1]Christian M. M. Frey, Andreas Züfle, Tobias Emrich, Matthias Renz:
Efficient Information Flow Maximization in Probabilistic Graphs. CoRR abs/1701.05395 (2017) - 2016
- [c1]Klaus Arthur Schmid, Christian M. M. Frey, Fengchao Peng, Michael Weiler, Andreas Züfle, Lei Chen, Matthias Renz:
TrendTracker: Modelling the Motion of Trends in Space and Time. ICDM Workshops 2016: 1145-1152
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: