An improved KNN algorithm for vertical search engines

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Secondary Data Processing deals the information further by re-crawling and categories based on the basic of structured data. It is the key researching module of Vertical Search Engines. This paper proposes an improved KNN algorithm for the categories. This algorithm achieves the responsiveness and the accuracy of vertical search by reducing the time complexity and accelerating the speed of classification. The experiment proved the improved algorithm has the better feasibility and robustness when it's used in secondary data processing and participle of vertical search engines. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Jia, Y., Fan, H., Xia, G., & Dong, X. (2011). An improved KNN algorithm for vertical search engines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6988 LNCS, pp. 219–223). https://doi.org/10.1007/978-3-642-23982-3_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free