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

SEGMENTATION OF OIL SPILL IMAGES USING IMPROVED FCM AND LEVEL SET METHODS.

The main part of image processing and computer vision is Image segmentation. Image segmentation is the task of splitting a digital image into one or more regions of interest. In this paper a robust method for oil spill S...

EVALUATION OF CBIR APPROACHES FOR DIFFERENTLY SIZED IMAGES

CBIR is the application of computer vision techniques to the image retrieval problem, that is, the problem of searching for digital images in large databases. An experimental comparison of a number of different color des...

Mathematical modeling And Fuzzy logic control of Inspired Isoflurane to obtain minimal flow of Anesthesia

In this paper, a fuzzy logic controller is designed and developed for control of Mean Arterial Pressure (MAP) of a patient during anesthesia using the anesthetic drug Isoflurane. Isoflurane is an anesthetic drug administ...

COMBINING THE SPECTRAL FEATURES TO IDENTIFY THE MUSICAL INSTRUMENTS AND RECOGNIZE THE EMOTION FROM MUSIC

Music can influence Human pervasive that can console, motivate, feel the love and hate or even bring us tears. Instrument plays a vital role in Musical Composition. ‘Combining the Spectral Features To Identify the Musica...

A STUDY OF CLONE DETECTING TECHNIQUES IN STATIONARY AND MOBILE WIRELESS SENSOR NETWORK

Mobile Wireless sensor network (MWSN) is one of the recently emerging areas in which mobility of sensor nodes play a major role. Sensor nodes are allowed to move freely and are allowed to communicate with each other with...

Download PDF file
  • EP ID EP138434
  • DOI -
  • Views 106
  • Downloads 0

How To Cite

S. Hrushikesava Raju, Dr. T. Swarna Latha (2016). 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. International Journal on Computer Science and Engineering, 8(1), 1-7. https://europub.co.uk/articles/-A-138434