License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2019.3
URN: urn:nbn:de:0030-drops-102425
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10242/
Mutzel, Petra
Algorithmic Data Science (Invited Talk)
Abstract
The area of algorithmic data science provides new opportunities for researchers in the algorithmic community. In this paper we will see examples that demonstrate that algorithm engineering is the perfect basis for algorithmic data science. But there are also many open interesting questions for purely theoretically interested computer scientists. In my opinion, these opportunities should be taken because this will be fruitful for both areas, algorithmics as well as data sciences. I like to call for more participation in algorithmic data science by our community. Now we have the opportunity to shape this new emerging field.
BibTeX - Entry
@InProceedings{mutzel:LIPIcs:2019:10242,
author = {Petra Mutzel},
title = {{Algorithmic Data Science (Invited Talk)}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-100-9},
ISSN = {1868-8969},
year = {2019},
volume = {126},
editor = {Rolf Niedermeier and Christophe Paul},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10242},
doi = {10.4230/LIPIcs.STACS.2019.3},
annote = {Keywords: Algorithmic Data Science, Graph Similarity, Weisfeiler-Leman}
}
Keywords: |
|
Algorithmic Data Science, Graph Similarity, Weisfeiler-Leman |
Collection: |
|
36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) |
Issue Date: |
|
2019 |
Date of publication: |
|
12.03.2019 |