Efficient data cleaning algorithm using decision tree classification model approach and modified new unique user identification algorithm using hashing techniques with a new error factor

Abstract

The study focuses on preprocessing techniques of web mining. Considering this scope, the study has proposed and implemented an efficient data cleaning and unique user identification algorithms. Previously proposed data cleaning algorithm is a generalized approach and lacked transparency. An appropriate model has to be used to implement the new data cleaning algorithm. Over analysis of various related studies and suggestions made by eminent experts, the study finalized decision tree classification model, and appropriate model to implement the new data cleaning algorithm. Simplicity, ease in framing rules and ability to fragment complex decisions to solve a problem motivated to choose decision tree classification model to implement new data cleaning algorithm. Apart from this the study has also modified the previously proposed hash function, used to locate existing web users in web log server. A new error factor is introduced to remove memory address discrepancy. The modified hashing function along with binary search techniques is used to design the new unique user identification algorithm. Various experiments analysis is done using web log servers of eminent universities and colleges from United Arab Emirates and India. Results obtained prove the improved and better performances of the new rule based data cleaning and modified unique user identification algorithms.

A New Hash Function Based On The Hybrid Of Existing Message Digest Algorithms

“…The hash function compresses any size message into information known as a hash-value whose its size is always fixed and shorter than the message itself, usually 128-512 bits [2]. Besides easy to calculate, the hash functions are very sensitive to changes in input messages although only one bit changes, and is resistant to collision events [3]. Therefore, the hash function is suitable for checking the integrity of messages sent over an unsecured communication network.…”