Low-Rank Approximation of Weighted Tree Automata.
Guillaume RabusseauBorja BalleShay B. CohenPublished in: AISTATS (2016)
Keyphrases
- tree automata
- low rank approximation
- regular expressions
- singular value decomposition
- finite state
- finite automata
- subspace learning
- low rank
- spectral clustering
- kernel matrix
- iterative algorithms
- context free grammars
- pattern matching
- nonnegative matrix factorization
- adjacency matrix
- knn
- markov decision processes
- data representation
- feature space
- data dependent
- dimensionality reduction