“Wrong path” algorithm for content search systems
Abstract
Search systems design is based on the successful rate of content find. The key problem in that kind of design is a good probability of failure in content find if any mistake in the system occurs. The article discusses an algorithm that increases the chances of successful content find in content search systems by analyzing user behavior. The algorithm describes the process of data gain by the system, data transfer into marshallable essences, and corresponding results determination. The article also refers to most common algorithms that serve as the basement for the <> algorithm, their problems and key features. The article discusses possible improvements of the algorithm that should be taken into account in future.
References
2. Beyond PageRank: Machine Learning for Static Ranking [электронный ресурс] / URL: http://www2006.org/programme/files/xhtml/3101/p3101-Richardson.html (дата обращения 25.05.2015).
3. Что такое ТИЦ [электронный ресурс] / URL: http://help.yandex.ru/catalogue/citation-index/tic-about.xml (дата обращения 25.05.2015).
4. PageRank sculpting [электронный ресурс] / URL: https://www.mattcutts.com/blog/pagerank-sculpting/ (дата обращения 25.05.2015).
5. Google toolbar [электронный ресурс] / URL: http://www.google.com/intl/ru/toolbar/ie/index.html (дата обращения 25.05.2015).
6. Web Spam Taxonomy [электронный ресурс] / URL: http://airweb.cse.lehigh.edu/2005/gyongyi.pdf (дата обращения 25.05.2015).
7. Yuting Lu, Bin Gao, Tie-Yan Liu, Zhiming Ma, Shuyuan He, Hang Li, Ying Zhang. BrowseRank: Letting Web Users Vote for Page Importance. China, 2008. P. 451—458.
8. Boldi P., Santini M., Vigna S. Pagerank as a function of the damping factor. USA, 2005. P. 557—566.
9. Tao Wu, Hui He, Xiqian Gu, Ying Peng. An intelligent network user behavior analysis system based on collaborative Markov model and distributed data processing. Canada, 2013. P. 221–228.
10. Ericson C. Real-Time Collision Detection. USA, 2004.
11. Knuth D.E. The Art of Computer Programming. Vols. 1–3. UK, 1998.
This work is licensed under a Creative Commons Attribution 4.0 International License.