Annihilation of Traditional Union through Ktmax-Maxam Algorithm in Disorder Mining
Thiagarajan K1, Maheshwari .A2, Kavitha J.3

1K. Thiagarajan, Academic Research Professor, Anna University, Jeppiaar Engineering College, Chennai (Tamil Nadu), India.
2A. Maheshwari, Department of Computer Science and Engineering, Jeppiaar Engineering College, Chennai (Tamil Nadu), India.
3J. Kavitha, Ph.D Research & Development Centre, Department of Mathematics, Bharathiar University, Coimbatore (Tamil Nadu), India.
Manuscript received on 04 July 2019 | Revised Manuscript received on 14 August 2019 | Manuscript Published on 27 August 2019 | PP: 326-328 | Volume-8 Issue-2S4 July 2019 | Retrieval Number: B10610782S419/2019©BEIESP | DOI: 10.35940/ijrte.B1061.0782S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

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.
Keywords: Data Mining, Degree, Maximum Degree, Minimum Degree, Link, Path.
Scope of the Article: Algorithm Engineering