Andre Valdestilhas will present the current state of his work “A High Performance Approach to String Distance using Most Frequent K Characters”.
Abstract
The idea is to reduce the computation in Link Discovery using and improving a String Distance Function called Most Frequent K Characters in order to get the Euclidean distance between two strings with a high performance. In order to do that we did experiments implementing a threshold and filters that allow skip cases when the distance between two strings are so much that no need to do a the whole computation. Also, we did experiments with parallel and GPU, also with a performance gain.
About the AKSW Colloquium
This event is part of a series of events about Semantic Web technology. Please see http://wiki.aksw.org/Colloquium for further information about previous and future events. As always, Bachelor and Master students are able to get points for attendance and there is complimentary coffee and cake after the session.
