Selecting training inputs via greedy rank covering

Adam L. Buchsbaum, Jan Van Santen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

We present a general method for selecting a small set of training inputs, the observations of which will suffice to estimate the parameters of a given linear model. We exemplify the algorithm in terms of predicting segmental duration of phonetic-segment feature vectors in a text-to-speech synthesizer, but the algorithm will work for any linear model and its associated domain.

Original languageEnglish (US)
Title of host publicationProceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996
PublisherAssociation for Computing Machinery
Pages288-295
Number of pages8
VolumePart F129447
ISBN (Electronic)0898713668
StatePublished - Jan 28 1996
Externally publishedYes
Event7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996 - Atlanta, United States
Duration: Jan 28 1996Jan 30 1996

Other

Other7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996
CountryUnited States
CityAtlanta
Period1/28/961/30/96

Fingerprint

Linear Model
Covering
Text-to-speech
Speech analysis
Feature Vector
Estimate
Training
Observation

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Buchsbaum, A. L., & Van Santen, J. (1996). Selecting training inputs via greedy rank covering. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996 (Vol. Part F129447, pp. 288-295). Association for Computing Machinery.

Selecting training inputs via greedy rank covering. / Buchsbaum, Adam L.; Van Santen, Jan.

Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996. Vol. Part F129447 Association for Computing Machinery, 1996. p. 288-295.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Buchsbaum, AL & Van Santen, J 1996, Selecting training inputs via greedy rank covering. in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996. vol. Part F129447, Association for Computing Machinery, pp. 288-295, 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996, Atlanta, United States, 1/28/96.
Buchsbaum AL, Van Santen J. Selecting training inputs via greedy rank covering. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996. Vol. Part F129447. Association for Computing Machinery. 1996. p. 288-295
Buchsbaum, Adam L. ; Van Santen, Jan. / Selecting training inputs via greedy rank covering. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996. Vol. Part F129447 Association for Computing Machinery, 1996. pp. 288-295
@inproceedings{09c911fcc6c648ffb89dd7251bf4c29b,
title = "Selecting training inputs via greedy rank covering",
abstract = "We present a general method for selecting a small set of training inputs, the observations of which will suffice to estimate the parameters of a given linear model. We exemplify the algorithm in terms of predicting segmental duration of phonetic-segment feature vectors in a text-to-speech synthesizer, but the algorithm will work for any linear model and its associated domain.",
author = "Buchsbaum, {Adam L.} and {Van Santen}, Jan",
year = "1996",
month = "1",
day = "28",
language = "English (US)",
volume = "Part F129447",
pages = "288--295",
booktitle = "Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Selecting training inputs via greedy rank covering

AU - Buchsbaum, Adam L.

AU - Van Santen, Jan

PY - 1996/1/28

Y1 - 1996/1/28

N2 - We present a general method for selecting a small set of training inputs, the observations of which will suffice to estimate the parameters of a given linear model. We exemplify the algorithm in terms of predicting segmental duration of phonetic-segment feature vectors in a text-to-speech synthesizer, but the algorithm will work for any linear model and its associated domain.

AB - We present a general method for selecting a small set of training inputs, the observations of which will suffice to estimate the parameters of a given linear model. We exemplify the algorithm in terms of predicting segmental duration of phonetic-segment feature vectors in a text-to-speech synthesizer, but the algorithm will work for any linear model and its associated domain.

UR - http://www.scopus.com/inward/record.url?scp=77953171897&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77953171897&partnerID=8YFLogxK

M3 - Conference contribution

VL - Part F129447

SP - 288

EP - 295

BT - Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996

PB - Association for Computing Machinery

ER -