Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm.
Moritz LichterIlia PonomarenkoPascal SchweitzerPublished in: LICS (2019)
Keyphrases
- experimental evaluation
- execution times
- computational complexity
- high accuracy
- space complexity
- computational effort
- improved algorithm
- small number
- theoretical analysis
- detection algorithm
- path planning
- matching algorithm
- times faster
- data sets
- convergence rate
- initial set
- expectation maximization
- learning algorithm
- optimal solution
- preprocessing
- probabilistic model
- iterative algorithms
- objective function
- memory requirements
- search space
- cost function
- worst case
- first order logic
- k means
- optimization algorithm
- np hard
- random walk
- recognition algorithm
- dynamic programming
- hardware implementation
- bayesian networks
- similarity measure
- undirected graph
- space requirements
- input data
- neural network