SELF-CLUSTERING ALGORITHM FOR PARTITIONING ANN SAMPLES
|更新时间:2025-12-10
|
SELF-CLUSTERING ALGORITHM FOR PARTITIONING ANN SAMPLES
CIESC JournalIssue 9, (2002)
作者机构:
清华大学化学工程系
作者简介:
基金信息:
DOI:
CLC:
Online First:25 September 2002,
Published:25 September 2002
稿件说明:
移动端阅览
ZHOU Xiang, HE Xiaorong, CHEN Bingzhen. SELF-CLUSTERING ALGORITHM FOR PARTITIONING ANN SAMPLES[J]. CIESC Journal, 2002, (9).
DOI:
ZHOU Xiang, HE Xiaorong, CHEN Bingzhen. SELF-CLUSTERING ALGORITHM FOR PARTITIONING ANN SAMPLES[J]. CIESC Journal, 2002, (9).DOI:
SELF-CLUSTERING ALGORITHM FOR PARTITIONING ANN SAMPLES
摘要
建立神经网络模型时
能否合理地划分训练样本和检验样本直接关系到建模的效率 .在很多实际应用中
检验样本是随机抽取的 .本文提出了一种基于欧氏距离的自聚类算法
根据样本的空间分布情况对其自动分类
然后确定检验样本 .算例研究表明
应用此算法能够改善检验效果
从而提高建模效率 .
Abstract
In the modeling process of Artificial Neural Network (ANN)
an appropriate partition of train samples and test samples conduces to a high modeling efficiency.In most cases
test samples are selected randomly.In this paper
a Euclidian distance based self-clustering algorithm is proposed to partition train samples and test samples automatically.All the samples are attributed to different clusters firstly; each individual sample is affiliated to the nearest cluster according to the Euclidian distance from the kernels of other clusters whereafter; and then small clusters are divided up into others;at last test samples are selected from each cluster in the same proportion.Two case studies show that this algorithm leads to a better test result in comparison with the random method