Annihilation of traditional union through Ktmax-Maxam algorithm in disorder mining

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

Abstract

Nowadays web contains many identical documents. Many efforts made towards in search engines with identical detection algorithms, still the retrieved web documents with redundant link. The proposed system, we are effectively identifying and minimize the redundant information from web documents. We introduce the degree based KTMAX-MAXAM algorithm filters out the redundant information. Using proposed KTMAX-MAXAM algorithm accessing of web pages with reduced time and space complexity.

Cite

CITATION STYLE

APA

Thiagarajan, K., Maheshwari, A., & Kavitha, J. (2019). Annihilation of traditional union through Ktmax-Maxam algorithm in disorder mining. International Journal of Recent Technology and Engineering, 8(2 Special Issue 4), 326–328. https://doi.org/10.35940/ijrte.B1061.0782S419

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