Two methods for encoding clusters

被引：5

作者：

Courrieu, P ^{[1
]}

机构：

[1] Univ Aix Marseille 1, CNRS, UMR 6561, Lab Psychol Cognit, F-13621 Aix En Provence 1, France

来源：

NEURAL NETWORKS | 2001年 / 14卷 / 02期

关键词：

cluster codes; neural network input and output representations pseudo-sequences; unordered sets; encoding problem;

D O I：

10.1016/S0893-6080(00)00096-4

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];

摘要：

This paper presents two methods for generating numerical codes representing clusters of R-n, while preserving various topological properties of data spaces. This is useful for networks whose input, or eventually output, consists of unordered sets of points. The first method is the best one from a theoretical point of view, while the second one is more usable for large clusters in practice. (C) 2001 Elsevier Science Ltd. All rights reserved.

引用

页码：175 / 183

页数：9

共 11 条

[1]

BARATGIN J, UNPUB SIMILARITY J 2

[2]

Barnsley MF, FRACTALS EVERYWHERE

[3]

The Hyperbell Algorithm for global optimization: A random walk using Cauchy densities [J].

Courrieu, P .

JOURNAL OF GLOBAL OPTIMIZATION, 1997, 10 (01) :37-55

[4]

COURRIEU P, UNPUB SIMILARITY J 1

[5]

Iterated random functions [J].

Diaconis, P ;

Freedman, D .

SIAM REVIEW, 1999, 41 (01) :45-76

[6]

Neural networks for predicting conditional probability densities: Improved training scheme combining EM and RVFL [J].

Husmeier, D ;

Taylor, JG .

NEURAL NETWORKS, 1998, 11 (01) :89-116

[7]

GENETIC ALGORITHMS AND VERY FAST SIMULATED REANNEALING - A COMPARISON [J].

INGBER, L ;

ROSEN, B .

MATHEMATICAL AND COMPUTER MODELLING, 1992, 16 (11) :87-100

[8]

Rumelhart D. E., 1986, PARALLEL DISTRIBUTED, V1

[9]

MINIMIZATION BY RANDOM SEARCH TECHNIQUES [J].

SOLIS, FJ ;

WETS, RJB .

MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (01) :19-30

[10]

PROBABILISTIC NEURAL NETWORKS [J].

SPECHT, DF .

NEURAL NETWORKS, 1990, 3 (01) :109-118

← 1 2 →