Newsgroups: comp.ai.neural-nets
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!usenet.eel.ufl.edu!newsfeed.internetmci.com!in1.uu.net!news.interpath.net!sas!mozart.unx.sas.com!saswss
From: saswss@hotellng.unx.sas.com (Warren Sarle)
Subject: Re: "curse of dimensionality"
Originator: saswss@hotellng.unx.sas.com
Sender: news@unx.sas.com (Noter of Newsworthy Events)
Message-ID: <DnG5q5.A22@unx.sas.com>
Date: Tue, 27 Feb 1996 18:22:53 GMT
X-Nntp-Posting-Host: hotellng.unx.sas.com
References:  <312DC2E7.2DBA@ikaros.mathematik.uni-mainz.de>
Organization: SAS Institute Inc.
Lines: 18


In article <312DC2E7.2DBA@ikaros.mathematik.uni-mainz.de>, Martin Petermann <dimpeter@ikaros.mathematik.uni-mainz.de> writes:
|> I like to know something about the phrase "curse of dimensionality".
|> I know it's about the problem of the reduction of hi-dimensional spaces.
|> It would be nice if someone can give me a hint, e.g. tell me some books.

Scott, D.W. (1992), Multivariate Density Estimation, NY: John Wiley & Sons.

Bishop, C.M. (1995). Neural Networks for Pattern Recognition, Oxford:
Oxford University Press.

As for hints, try reading the instructions for your newsreader, too.

-- 

Warren S. Sarle       SAS Institute Inc.   The opinions expressed here
saswss@unx.sas.com    SAS Campus Drive     are mine and not necessarily
(919) 677-8000        Cary, NC 27513, USA  those of SAS Institute.
