LENN: Laplacian Probability Based Extended Nearest Neighbor Classification Algorithm for Web Page Retrieval

Web page prediction is the area of interest that enables to tackle the problem of dealing with the massive collection of the web pages, mainly, in retrieving the highly relevant web pages. The hectic challenge of the web page prediction methods relied on time-effective and cost-effective management. The problem of dealing with the issue is tackled using the efficient web page retrieval algorithm. The paper proposes a new classifier called, Laplacian probability based Extended Nearest Neighbor (LENN)that is formed through the integration of the Laplacian probability with the Extended Nearest Neighbor (ENN)classifier. The proposed LENN classifier determines the nearest web pages of the query. Accordingly, the web page retrieval is done in three important steps, such as pre-processing, feature indexing and web page retrieval. The key words are stored in the database for performing the feature match such that the highly relevant web page is retrieved based on the maximum value of the score. The experimentation using five benchmarks prove that the proposed method is effective compared with the existing methods of web page retrieval. The maximum precision, recall, and F-measure of the proposed method is found to be 98%, 96.7%, and 97.3%, respectively.