Most frequent k chars distance: Difference between revisions

m
missed converting some links
(Try to tidy up)
m (missed converting some links)
Line 14:
| url = http://arxiv.org/abs/1401.6596
| year = 2014}}.</ref>
MethodThis method is originally based on a hashing function, MaxFreqKChars <ref name="hashfunc">{{citation
| last1 = Seker | first1 = Sadi E. | author1-link = Sadi Evren SEKER
| last2 = Mert | first2 = Cihan
Line 25:
| volume = 2
| issue = 1
| year = 2013}}.</ref>
| year = 2013}}.</ref> classical [[wp:author recognition|author recognition]] problem and idea first came out while studying on [[wp:data stream mining|data stream mining]].<ref name="author">{{citation
| last1 = Seker | first1 = Sadi E. | author1-link = Sadi Evren SEKER
| last2 = Al-Naami | first2 = Khaled
Anonymous user