Gencosman, B.C.; Ozmutlu, H.C.; Ozmutlu, S.: Character n-gram application for automatic new topic identification (2014)
0.01
0.0065351077 = product of:
0.026140431 = sum of:
0.026140431 = product of:
0.052280862 = sum of:
0.052280862 = weight(_text_:aspects in 2688) [ClassicSimilarity], result of:
0.052280862 = score(doc=2688,freq=2.0), product of:
0.20938325 = queryWeight, product of:
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.046325076 = queryNorm
0.2496898 = fieldWeight in 2688, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.5198684 = idf(docFreq=1308, maxDocs=44218)
0.0390625 = fieldNorm(doc=2688)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- The widespread availability of the Internet and the variety of Internet-based applications have resulted in a significant increase in the amount of web pages. Determining the behaviors of search engine users has become a critical step in enhancing search engine performance. Search engine user behaviors can be determined by content-based or content-ignorant algorithms. Although many content-ignorant studies have been performed to automatically identify new topics, previous results have demonstrated that spelling errors can cause significant errors in topic shift estimates. In this study, we focused on minimizing the number of wrong estimates that were based on spelling errors. We developed a new hybrid algorithm combining character n-gram and neural network methodologies, and compared the experimental results with results from previous studies. For the FAST and Excite datasets, the proposed algorithm improved topic shift estimates by 6.987% and 2.639%, respectively. Moreover, we analyzed the performance of the character n-gram method in different aspects including the comparison with Levenshtein edit-distance method. The experimental results demonstrated that the character n-gram method outperformed to the Levensthein edit distance method in terms of topic identification.
