loading
Sách, tuyển tập

Artificial Neural Networks in Pattern Recognition

Nhà xuất bản : Springer

Năm xuất bản : 2008

Mô tả vật lý : 327 p.

Số phân loại : 006

Chủ đề : 1. Computer Science. 2. Book.

Chia sẻ

Thông tin chi tiết

Tóm tắt :

Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural gas or the self-organizing map offer an intuitive and fast variant which represents data by means of typical representatives, thereby running in linear time. Recently, an extension of these methods towards relational clustering has been proposed which can handle general non-vectorial data characterized by dissimilarities only, such as alignment or general kernels. This extension, relational neural gas, is directly applicable in important domains such as bioinformatics or text clustering. However, it is quadratic in m both in memory and in time (m being the number of data points). Hence, it is infeasible for huge data sets. In this contribution we introduce an approximate patch version of relational neural gas which relies on the same cost function but it dramatically reduces time and memory requirements. It offers a single pass clustering algorithm for huge data sets, running in constant space and linear time only.
Chia sẻ


Hiển thị MARC

 Thông tin dữ liệu nguồn

 Thư viện  Ký hiệu xếp giá  Dữ liệu nguồn
Đại học quốc gia Hà Nội
https://repository.vnu.edu.vn/handle/VNU_123/25014