Informatics Publishing Limited

Deepti Juneja ¹, Sachin Sharma ¹, Anupriya Jain ¹, Seema Sharma ¹

Affiliations
1 Manav Rachna University, Faridabad, Haryana, IN

Abstract

With the rapid growth in size and number of available databases in commercial, industrial, administrative and other applications, it is necessary and interesting to examine how to extract knowledge from huge amount of data. There are several mining algorithms available to solve diverse data mining problems. One of the knowledge and discovery in databases operations is the problem of inducing decision trees. C4.5 is one of the most important algorithms in Decision Tree Induction. In this paper the limitations of the existing C4.5 algorithm are discussed and an enhancement technique for improving its efficiency is proposed.

Keywords

Data Mining, Decision Trees, C4.5 Algorithm.

Full Text

   

Anupriya Jain ¹, Sachin Sharma ¹, Seema Sharma ¹, Deepti Juneja ¹

Affiliations
1 Manav Rachna International University, Faridabad, IN

Abstract

The purpose of boundary value analysis is to concentrate effort on error prone area by accurately pinpointing the boundaries of condition. Boundary value analysis produces test inputs near each sub domain’s to find failure cause by incorrect implementation of boundary. The major limitation of boundary value analysis is that it fails to test non-numerical variables. This paper focuses on as an antidote to enter the string values.

Keywords

Boundary Value, Failure, Test Case Generation, Non-Numerical Text.

Full Text