Efficient construction of Optimal Binary Search Trees using Data Preprocessing to improve Quality and Attribute Post computing to save Space and time through modified Dynamic Programming Technique
Journal Title: International Journal on Computer Science and Engineering - Year 2016, Vol 8, Issue 1
Abstract
There are various methods of handling Optimal Binary search trees in order to improve the performance. One of the methods is Dynamic programming which incurs O(n3) time complexity to store involved computations in a table. The data mining technique called Data Preprocessing is used to remove noise early in the data and enhance consistency of given data. The data postcomputing (opposite to Data Preprocessing) is applied using dynamic programming principle which starts with only required data and computes only the necessary attributes required to construct Optimal Binary Search Tree with time complexity O(n) if there are n identifiers / integers / any complex objects. This approach avoids computing all table attributes. Hence, the complexity or cost of Data post computing using Dynamic Programming is proved to be less than O(n3) or even less than specified in some cases with experimental results.
Authors and Affiliations
S. Hrushikesava Raju , Dr. T. Swarna Latha
Keywords
Related Articles
- EP ID EP138434
- DOI -
- Views 82
- Downloads 0
A New Effective System for FilteringPornography Videos
Videos are consider in these time an important way to record our life moments. Nowadays and with the widespread of using Internet, videos can be shared easily between different countries and between peoples around the wo...
Comparative and Analysis of Biometric Systems
Biometric as the science of recognizing an individual based on his or her physical or behavioral traits, it is beginning to gain acceptance as a legitimate method for determining an individual identity. Biometric have no...
A Method for Group Formation Using Genetic Algorithm
Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time. Thus, in niversities, group work is seen as a good p...
Speaker Identification using Row Mean of DCT and Walsh Hadamard Transform
In this paper we propose a unique approach to text dependent speaker identification using transformation techniques such as DCT (Discrete Cosine Transform) and WHT (Walsh and Hadamard Transform). The feature vectors for...
Enhancement of Network Security Techniques using Quantum Cryptography
Quantum cryptography uses the law of quantum physics for unconditionally secure data communications. This is a main achievement because the cryptography currently in use, known as conventional cryptography, relies comple...