Connectionist Bench (Vowel Recognition - Deterding Data)

Speaker independent recognition of the eleven steady state vowels of British English using a specified training set of lpc derived log area ratios.

Dataset Characteristics

-

Subject Area

Other

Associated Tasks

Classification

Feature Type

Real

# Instances

528

# Features

10

Dataset Information

Additional Information

The problem is specified by the accompanying data file, "vowel.data". This consists of a three dimensional array: voweldata [speaker, vowel, input]. The speakers are indexed by integers 0-89. (Actually, there are fifteen individual speakers, each saying each vowel six times.) The vowels are indexed by integers 0-10. For each utterance, there are ten floating-point input values, with array indices 0-9. The problem is to train the network as well as possible using only on data from "speakers" 0-47, and then to test the network on speakers 48-89, reporting the number of correct classifications in the test set. For a more detailed explanation of the problem, see the excerpt from Tony Robinson's Ph.D. thesis in the COMMENTS section. In Robinson's opinion, connectionist problems fall into two classes, the possible and the impossible. He is interested in the latter, by which he means problems that have no exact solution. Thus the problem here is not to see how fast a network can be trained (although this is important), but to maximise a less than perfect performance.

Has Missing Values?

No

Reviews

There are no reviews for this dataset yet.

Login to Write a Review
Download
0 citations
12460 views

Creators

David Deterding

Mahesan Niranjan

Tony Robinson

License

By using the UCI Machine Learning Repository, you acknowledge and accept the cookies and privacy practices used by the UCI Machine Learning Repository.

Read Policy