東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Neural networks and adaptive wavelet...

Campos, Marcos de Moura.

Linked to FindBook

Google Book

Amazon

博客來

Neural networks and adaptive wavelets for vector quantization, function approximation, and classification.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Neural networks and adaptive wavelets for vector quantization, function approximation, and classification./
Author:	Campos, Marcos de Moura.
Description:	125 p.
Notes:	Major Professor: Gail A. Carpenter.
Contained By:	Dissertation Abstracts International62-12B
Subject:	Computer Science -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3037373
ISBN:	0493503811

Neural networks and adaptive wavelets for vector quantization, function approximation, and classification.
Campos, Marcos de Moura.

Neural networks and adaptive wavelets for vector quantization, function approximation, and classification. - 125 p.

Major Professor: Gail A. Carpenter.

Thesis (Ph.D.)--Boston University, 2002.

This dissertation develops neural network models for function approximation, classification, and vector quantization. These models perform code compression of data and are used for efficient transmission of images, medical diagnosis; customer profiling, and data visualization. Code compression reduces the amount of data in a problem by using prototypical values from a codebook to summarize a database, or by representing complex functions as combinations of basis functions.

ISBN: 0493503811Subjects--Topical Terms:

890869
Computer Science

Neural networks and adaptive wavelets for vector quantization, function approximation, and classification.
LDR:03288nam 2200289 a 45 001 936583
005 20110510
008 110510s2002 eng d
020 $a 0493503811
035 $a (UnM)AAI3037373
035 $a AAI3037373
040 $a UnM $c UnM
100 1 $a Campos, Marcos de Moura. $3 1260293
245 1 0 $a Neural networks and adaptive wavelets for vector quantization, function approximation, and classification.
300 $a 125 p.
500 $a Major Professor: Gail A. Carpenter.
500 $a Source: Dissertation Abstracts International, Volume: 62-12, Section: B, page: 5801.
502 $a Thesis (Ph.D.)--Boston University, 2002.
520 $a This dissertation develops neural network models for function approximation, classification, and vector quantization. These models perform code compression of data and are used for efficient transmission of images, medical diagnosis; customer profiling, and data visualization. Code compression reduces the amount of data in a problem by using prototypical values from a codebook to summarize a database, or by representing complex functions as combinations of basis functions.
520 $a The first part of the work introduces two models that define basis functions adapted to given data distributions. The Continuous Self-Organizing Map (CSOM) is a new, distributed version of the discrete Self-Organizing Map (SOM) network. Applications of SOM have included the visualization of high dimensional datasets and function approximation. CSOM outperforms the SOM algorithm in function approximation and data visualization tasks. The second model, the Wavelet Self-Organizing Map (WSOM) implements discrete approximations using wavelets for basis functions. Wavelets represent functions concisely and are useful in separating signal from noise. The WSOM model creates wavelet bases adapted to the distribution of input data, achieving improved performance with fewer wavelets compared to non-adaptive methods. The model also provides an efficient online way to construct, iv high-dimensional wavelet bases
520 $a The second part of the dissertation builds hierarchical representations of data and applies the resulting systems to vector quantization and clustering problems. Hierarchical architectures break down complex and difficult problems into smaller ones. This dissertation introduces S-TREE (Self-Organizing Tree), a competitive learning neural network tree. S-TREE is an online method that can learn codebooks for data compression with small numbers of passes through large databases of examples. The performance of the algorithm is illustrated with an image compression application. On this task, S-TREE's image reconstruction quality approaches that of the standard generalized Lloyd algorithm (a non-hierarchical method) while taking less than 10% of the computer time of the generalized Lloyd algorithm. S-TREE also compares favorably with the standard Tree-Structured Vector Quantizer algorithm in both the time needed to create the codebook and quality of image reconstruction
590 $a School code: 0017
650 $a Computer Science $3 890869
690 $a 098
710 2 $a Boston University $3 1260282
773 0 $t Dissertation Abstracts International $g 62-12B
790 $a 001
790 1 $a Carpenter, Gail A., $e adviso
791 $a Ph.D
792 $a 200
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3037373