A Modified Kennard-Stone Algorithm for Optimal Division of Data for Developing Artificial Neural Network Models
Access Status
Authors
Date
2012Type
Metadata
Show full item recordCitation
Source Title
ISSN
School
Collection
Abstract
This paper proposes a method, namely MDKS (Kennard-Stone algorithm based on Mahalanobis distance), to divide the data into training and testing subsets for developing artificial neural network (ANN) models. This method is a modified version of the Kennard-Stone (KS) algorithm. With this method, better data splitting, in terms of data representation and enhanced performance of developed ANN models, can be achieved. Compared with standard KS algorithm and another improved KS algorithm (data division based on joint x - y distances (SPXY) method), the proposed method has also shown a better performance. Therefore, the proposed technique can be used as an advantageous alternative to other existing methods of data splitting for developing ANN models. Care should be taken when dealing with large amount of dataset since they may increase the computational load for MDKS due to its variance-covariance matrix calculations.
Related items
Showing items related by title, author, creator and subject.
-
Li, Yanrong (2009)Clustering and association rules mining are two core data mining tasks that have been actively studied by data mining community for nearly two decades. Though many clustering and association rules mining algorithms have ...
-
Laguerre, Rick; Barnes-Farrell, Janet; Petery, Gigi (2019)Subjective age is the age one feels, which can often differ from one’s chronological age. Research shows that this form of age identification has cross-cultural relevance when assessing life-course development (Barak, ...
-
Kusumah, Yaya S, (2001)The facility layout design problem is concerned with determining the arrangement and configuration of facilities, which optimizes a prescribed objective such as profit, cost, or distance, and which satisfies various ...