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 104
- Downloads 0
Web Page Segmentation for Small Screen Devices Using Tag Path Clustering Approach
The web pages breathing these days are developed to be displayed on a Desktop PCs and so viewing them on mobile web browsers is extremely tough. Since mobile devices have restricted resources, small screen device users n...
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...
Impulse Noise removal in Digital Images
In this paper, we introduce a new class of filter, the modified spatial median filter (MSMF) for the removal of impulse noise in digital images. The proposed filter is compared with four different filtering algorithms ba...
An Efficient Association Rule Hiding Algorithm for Privacy Preserving Data Mining
The security of the large database that contains certain crucial information, it will become a serious issue when sharing data to the network against unauthorized access. Privacy preserving data mining is a new research...
Supply and demand vs. price driven graphs financial data visualization
In the financial world, people almost every day, argue whether the price of a financial instrument will go up or down. While long term investors use fundamental data to create their view, mid & short term investors a...