A Novel Binary Search Tree Method to Find an Item Using Scaling

The international arab journal of information technology

article

Praveen Pappula¹ 

[1] School of Computer Science and Artificial Intelligence, SR University

关键词: Clustering;    classification;    KNN;    vector quantization;    mean based search;    scaling;   

DOI  :  10.34028/iajit/19/5/2

学科分类：计算机科学（综合）

来源: Zarqa University

【 摘 要 】

This Approach comprises of methods to produce novel and efficient methods to implement search of data objects invarious applications. It is based on the best match search to implement proximity or best match search over complex or morethan one data source. In particular with the availability of very large numeric data set in the present day scenario. Theproposed approach which is based on the Arithmetic measures or distance measures called as the predominant Mean basedalgorithm. It is implemented on the longest common prefix of data object that shows how it can be used to generate variousclusters through combining or grouping of data, as it takes O(log n) computational time. And further the approach is based onthe process of measuring the distance which is suitable for a hierarchy tree property for proving the classification is neededone for storing or accessing or retrieving the information as required. The results obtained illustrates overall error detectionrates in generating the clusters and searching the key value for Denial of Service (DOS) attack 5.15%, Probe attack 3.87%,U2R attack 8.11% and R2L attack 11.14%. as these error detection rates denotes that our proposed algorithm generates lesserror rates than existing linkage methods.

【 授权许可】

Unknown