東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

A Data Clustering Algorithm for Stra...

Sahoo, Ajit Kumar.

Linked to FindBook

Google Book

Amazon

博客來

A Data Clustering Algorithm for Stratified Data Partitioning in Artificial Neural Network.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	A Data Clustering Algorithm for Stratified Data Partitioning in Artificial Neural Network./
Author:	Sahoo, Ajit Kumar.
Description:	114 p.
Notes:	Source: Masters Abstracts International, Volume: 49-04, page: .
Contained By:	Masters Abstracts International49-04.
Subject:	Engineering, Computer. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR70891
ISBN:	9780494708910

A Data Clustering Algorithm for Stratified Data Partitioning in Artificial Neural Network.
Sahoo, Ajit Kumar.

A Data Clustering Algorithm for Stratified Data Partitioning in Artificial Neural Network. - 114 p.

Source: Masters Abstracts International, Volume: 49-04, page: .

Thesis (M.Sc.)--University of Alberta (Canada), 2011.

The statistical properties of training, validation and test data play an important role in assuring optimal performance in artificial neural networks (ANN). Researchers have proposed randomized data partitioning (RDP) and stratified data partitioning (SDP) methods for partition of input data into training, validation and test datasets. RDP methods based on genetic algorithm (GA) are computationally expensive as the random search space can be in the power of twenty or more for an average sized dataset. For SDP methods, clustering algorithms such as self organizing map (SOM) and fuzzy clustering (FC) are used to form strata. It is assumed that data points in any individual stratum are in close statistical agreement. Reported clustering algorithms are designed to form natural clusters. In the case of large multivariate datasets, some of these natural clusters can be big enough such that the furthest data vectors are statistically far away from the mean. Further, these algorithms are computationally expensive as well. Here a custom design clustering algorithm (CDCA) has been proposed to overcome these shortcomings. Comparisons have been made using three benchmark case studies, one each from classification, function approximation and prediction domain respectively. The proposed CDCA data partitioning method was evaluated in comparison with SOM, FC and GA based data partitioning methods. It was found that the CDCA data partitioning method not only performed well but also reduced the average CPU time.

ISBN: 9780494708910Subjects--Topical Terms:

1669061
Engineering, Computer.

A Data Clustering Algorithm for Stratified Data Partitioning in Artificial Neural Network.
LDR:02317nam 2200253 4500 001 1395536
005 20110518115317.5
008 130515s2011 ||||||||||||||||| ||eng d
020 $a 9780494708910
035 $a (UMI)AAIMR70891
035 $a AAIMR70891
040 $a UMI $c UMI
100 1 $a Sahoo, Ajit Kumar. $3 1674238
245 1 2 $a A Data Clustering Algorithm for Stratified Data Partitioning in Artificial Neural Network.
300 $a 114 p.
500 $a Source: Masters Abstracts International, Volume: 49-04, page: .
502 $a Thesis (M.Sc.)--University of Alberta (Canada), 2011.
520 $a The statistical properties of training, validation and test data play an important role in assuring optimal performance in artificial neural networks (ANN). Researchers have proposed randomized data partitioning (RDP) and stratified data partitioning (SDP) methods for partition of input data into training, validation and test datasets. RDP methods based on genetic algorithm (GA) are computationally expensive as the random search space can be in the power of twenty or more for an average sized dataset. For SDP methods, clustering algorithms such as self organizing map (SOM) and fuzzy clustering (FC) are used to form strata. It is assumed that data points in any individual stratum are in close statistical agreement. Reported clustering algorithms are designed to form natural clusters. In the case of large multivariate datasets, some of these natural clusters can be big enough such that the furthest data vectors are statistically far away from the mean. Further, these algorithms are computationally expensive as well. Here a custom design clustering algorithm (CDCA) has been proposed to overcome these shortcomings. Comparisons have been made using three benchmark case studies, one each from classification, function approximation and prediction domain respectively. The proposed CDCA data partitioning method was evaluated in comparison with SOM, FC and GA based data partitioning methods. It was found that the CDCA data partitioning method not only performed well but also reduced the average CPU time.
590 $a School code: 0351.
650 4 $a Engineering, Computer. $3 1669061
650 4 $a Artificial Intelligence. $3 769149
690 $a 0464
690 $a 0800
710 2 $a University of Alberta (Canada). $3 626651
773 0 $t Masters Abstracts International $g 49-04.
790 $a 0351
791 $a M.Sc.
792 $a 2011
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR70891