文章基本信息

标题：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
本地全文：下载
作者：S.Hrushikesava Raju ; Dr. T.Swarna Latha
期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2016
卷号：8
期号：01
页码：1-7
出版社：Engg Journals Publications
摘要：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.
关键词：Optimal Binary Search Tree (OBST); Data Preprocessing; Data Postcomputing; Dynamic Programming; Time Complexity.