Matches in DBpedia 2015-10 for { ?s ?p "In information theory, MostFreqKDistance is a string metric technique for quickly estimating how similar two ordered sets or strings are. The scheme was invented by Sadi Evren SEKER (2014), and initially used in text mining applications like author recognition.Method is originally based on a hashing function MaxFreqKChars classical author recognition problem and idea first came out while studying on data stream mining. Algorithm is suitable for coding in most of the programming languages like Java, Tcl, Python or J."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Most_frequent_k_characters abstract "In information theory, MostFreqKDistance is a string metric technique for quickly estimating how similar two ordered sets or strings are. The scheme was invented by Sadi Evren SEKER (2014), and initially used in text mining applications like author recognition.Method is originally based on a hashing function MaxFreqKChars classical author recognition problem and idea first came out while studying on data stream mining. Algorithm is suitable for coding in most of the programming languages like Java, Tcl, Python or J.".