A Universal Kernel for Learning Regular Languages

Posted in Science on August 03, 2008


A Universal Kernel for Learning Regular Languages

We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but we do have an efficient ?-approximation

Author: Leonid Kontorovich, Weizmann Institute

Watch Video

Tags: Science, Lectures, Computer Science, Machine Learning, VideoLectures.Net, Kernel Methods