Algorithmic data science (invited talk)

DOI10.4230/LIPICS.STACS.2019.3MaRDI QIDQ5090449zbMATH OpenFDO

Authors Petra Mutzel

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2019.3

zbMATH Keywords

algorithmic data sciencegraph similarityWeisfeiler-Leman

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Distribution-Free Models of Social Networks
• Algorithm engineering -- an attempt at a definition using sorting as an example
• Algorithm engineering: Concepts and practice
• Needed: An Empirical Science of Algorithms
• Algorithm engineering. Abstracts from the workshop held May 6--12, 2007.

Cites work

• A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
• A note on compact graphs
• A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree
• Algorithm 457: finding all cliques of an undirected graph
• An improved isomorphism test for bounded-tree-width graphs
• An optimal lower bound on the number of variables for graph identification
• Analysis of agglomerative clustering
• Data mining. The textbook
• Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
• Finding largest common substructures of molecules in quadratic time
• Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
• Foundations of Data Science
• Frequent Pattern Mining
• Graph isomorphism in quasipolynomial time (extended abstract)
• Graph isomorphism is in the low hierarchy
• Graph similarity and approximate isomorphism
• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Lov\'asz Meets Weisfeiler and Leman
• Measure and conquer
• On maximum common subgraph problems in series-parallel graphs
• On the approximability of the maximum common subgraph problem
• PEBBLE GAMES AND LINEAR EQUATIONS
• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
• Practical graph isomorphism. II.
• Random Graph Isomorphism
• Sherali-Adams relaxations and indistinguishability in counting logics
• Sherali-Adams relaxations of graph isomorphism polytopes
• Structure theorem and isomorphism test for graphs with excluded topological subgraphs
• Subtree Isomorphism in O(n5/2)
• Testing cluster structure of graphs
• The data science design manual
• Turning big data into tiny data: constant-size coresets for k-means, PCA and projective clustering
• Understanding machine learning. From theory to algorithms
• Weisfeiler-Lehman graph kernels

Cited in

(2)

• Distribution-Free Models of Social Networks
• Algorithms for a New World

This page was built for publication: Algorithmic data science (invited talk)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090449)