The meta-pi network: building distributed knowledge representations for robust pattern recognition
Abstract: "We present a multi-network connectionist architecture that forms distributed low-level knowledge representations critical to robust pattern recognition in non-stationary stochastic processes. This new network comprises a number of stimulus-specific sub-networks (i.e., networks traine...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Pittsburgh, Pa.
1989
|
Schriftenreihe: | Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS
89,166 |
Schlagworte: | |
Zusammenfassung: | Abstract: "We present a multi-network connectionist architecture that forms distributed low-level knowledge representations critical to robust pattern recognition in non-stationary stochastic processes. This new network comprises a number of stimulus-specific sub-networks (i.e., networks trained to classify a particular type of stimulus) that are linked by a combinational superstructure. The combinational superstructure adapts to the stimulus being processed, optimally integrating stimulus-specific classifications based on its internally-developed model of the stimulus or combination of stimuli most likely to have produced the input signal. To train this combinational network we have developed a new form of multiplicative connection that we call the "Meta-Pi" connection. We illustrate how the Meta-Pi paradigm implements a dynamically adaptive Bayesian connectionist classifier We demonstrate the Meta-Pi architecture's performance in the context of multi-speaker phoneme recognition. In this task the Meta-Pi superstructure integrates conflict-arbitrated Time-Delay Neural Network (TDNN) sub-networks to perform multi-speaker phoneme recognition at speaker-dependent rates. It achieves a 6-speaker (4 males, 2 females) recognition rate of 98.4% on a database of voiced-stops (/b,d,g/). This recognition performance constitutes a significant improvement over the 95.9% multi-speaker recognition rate obtained by a single TDNN trained in multi-speaker fashion. It also approaches the 98.7% average of the speaker-dependent recognition rates for the six speakers processed. We show that the Meta-Pi network can learn--without direct supervision--to recognize the speech of one particular speaker using a dynamic combination of internal models of other speakers exclusively (99.8% correct). The Meta-Pi model constitutes a viable basis for connectionist pattern recognition systems that can rapidly adapt to new stimuli by using dynamic, conditional combinations of existing stimulus-specific models. |
Beschreibung: | 32 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008948781 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940206s1989 |||| 00||| eng d | ||
035 | |a (OCoLC)21049939 | ||
035 | |a (DE-599)BVBBV008948781 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
082 | 0 | |a 510.7808 |b C28r 89-166 | |
100 | 1 | |a Hampshire, John B. |e Verfasser |4 aut | |
245 | 1 | 0 | |a The meta-pi network |b building distributed knowledge representations for robust pattern recognition |c John B. Hampshire ; Alex H. Waibel |
264 | 1 | |a Pittsburgh, Pa. |c 1989 | |
300 | |a 32 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS |v 89,166 | |
520 | 3 | |a Abstract: "We present a multi-network connectionist architecture that forms distributed low-level knowledge representations critical to robust pattern recognition in non-stationary stochastic processes. This new network comprises a number of stimulus-specific sub-networks (i.e., networks trained to classify a particular type of stimulus) that are linked by a combinational superstructure. The combinational superstructure adapts to the stimulus being processed, optimally integrating stimulus-specific classifications based on its internally-developed model of the stimulus or combination of stimuli most likely to have produced the input signal. To train this combinational network we have developed a new form of multiplicative connection that we call the "Meta-Pi" connection. We illustrate how the Meta-Pi paradigm implements a dynamically adaptive Bayesian connectionist classifier | |
520 | 3 | |a We demonstrate the Meta-Pi architecture's performance in the context of multi-speaker phoneme recognition. In this task the Meta-Pi superstructure integrates conflict-arbitrated Time-Delay Neural Network (TDNN) sub-networks to perform multi-speaker phoneme recognition at speaker-dependent rates. It achieves a 6-speaker (4 males, 2 females) recognition rate of 98.4% on a database of voiced-stops (/b,d,g/). This recognition performance constitutes a significant improvement over the 95.9% multi-speaker recognition rate obtained by a single TDNN trained in multi-speaker fashion. It also approaches the 98.7% average of the speaker-dependent recognition rates for the six speakers processed. We show that the Meta-Pi network can learn--without direct supervision--to recognize the speech of one particular speaker using a dynamic combination of internal models of other speakers exclusively (99.8% correct). The Meta-Pi model constitutes a viable basis for connectionist pattern recognition systems that can rapidly adapt to new stimuli by using dynamic, conditional combinations of existing stimulus-specific models. | |
650 | 4 | |a Automatic speech recognition | |
650 | 4 | |a Pattern recognition systems | |
700 | 1 | |a Waibel, Alex H. |e Verfasser |4 aut | |
810 | 2 | |a Computer Science Department: CMU-CS |t Carnegie-Mellon University <Pittsburgh, Pa.> |v 89,166 |w (DE-604)BV006187264 |9 89,166 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005904509 |
Datensatz im Suchindex
_version_ | 1804123281657167872 |
---|---|
any_adam_object | |
author | Hampshire, John B. Waibel, Alex H. |
author_facet | Hampshire, John B. Waibel, Alex H. |
author_role | aut aut |
author_sort | Hampshire, John B. |
author_variant | j b h jb jbh a h w ah ahw |
building | Verbundindex |
bvnumber | BV008948781 |
ctrlnum | (OCoLC)21049939 (DE-599)BVBBV008948781 |
dewey-full | 510.7808 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 510 - Mathematics |
dewey-raw | 510.7808 |
dewey-search | 510.7808 |
dewey-sort | 3510.7808 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03183nam a2200337 cb4500</leader><controlfield tag="001">BV008948781</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21049939</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008948781</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.7808</subfield><subfield code="b">C28r 89-166</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hampshire, John B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The meta-pi network</subfield><subfield code="b">building distributed knowledge representations for robust pattern recognition</subfield><subfield code="c">John B. Hampshire ; Alex H. Waibel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, Pa.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS</subfield><subfield code="v">89,166</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a multi-network connectionist architecture that forms distributed low-level knowledge representations critical to robust pattern recognition in non-stationary stochastic processes. This new network comprises a number of stimulus-specific sub-networks (i.e., networks trained to classify a particular type of stimulus) that are linked by a combinational superstructure. The combinational superstructure adapts to the stimulus being processed, optimally integrating stimulus-specific classifications based on its internally-developed model of the stimulus or combination of stimuli most likely to have produced the input signal. To train this combinational network we have developed a new form of multiplicative connection that we call the "Meta-Pi" connection. We illustrate how the Meta-Pi paradigm implements a dynamically adaptive Bayesian connectionist classifier</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We demonstrate the Meta-Pi architecture's performance in the context of multi-speaker phoneme recognition. In this task the Meta-Pi superstructure integrates conflict-arbitrated Time-Delay Neural Network (TDNN) sub-networks to perform multi-speaker phoneme recognition at speaker-dependent rates. It achieves a 6-speaker (4 males, 2 females) recognition rate of 98.4% on a database of voiced-stops (/b,d,g/). This recognition performance constitutes a significant improvement over the 95.9% multi-speaker recognition rate obtained by a single TDNN trained in multi-speaker fashion. It also approaches the 98.7% average of the speaker-dependent recognition rates for the six speakers processed. We show that the Meta-Pi network can learn--without direct supervision--to recognize the speech of one particular speaker using a dynamic combination of internal models of other speakers exclusively (99.8% correct). The Meta-Pi model constitutes a viable basis for connectionist pattern recognition systems that can rapidly adapt to new stimuli by using dynamic, conditional combinations of existing stimulus-specific models.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic speech recognition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pattern recognition systems</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Waibel, Alex H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: CMU-CS</subfield><subfield code="t">Carnegie-Mellon University <Pittsburgh, Pa.></subfield><subfield code="v">89,166</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">89,166</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005904509</subfield></datafield></record></collection> |
id | DE-604.BV008948781 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:27:17Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005904509 |
oclc_num | 21049939 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 32 S. |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
record_format | marc |
series2 | Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS |
spelling | Hampshire, John B. Verfasser aut The meta-pi network building distributed knowledge representations for robust pattern recognition John B. Hampshire ; Alex H. Waibel Pittsburgh, Pa. 1989 32 S. txt rdacontent n rdamedia nc rdacarrier Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS 89,166 Abstract: "We present a multi-network connectionist architecture that forms distributed low-level knowledge representations critical to robust pattern recognition in non-stationary stochastic processes. This new network comprises a number of stimulus-specific sub-networks (i.e., networks trained to classify a particular type of stimulus) that are linked by a combinational superstructure. The combinational superstructure adapts to the stimulus being processed, optimally integrating stimulus-specific classifications based on its internally-developed model of the stimulus or combination of stimuli most likely to have produced the input signal. To train this combinational network we have developed a new form of multiplicative connection that we call the "Meta-Pi" connection. We illustrate how the Meta-Pi paradigm implements a dynamically adaptive Bayesian connectionist classifier We demonstrate the Meta-Pi architecture's performance in the context of multi-speaker phoneme recognition. In this task the Meta-Pi superstructure integrates conflict-arbitrated Time-Delay Neural Network (TDNN) sub-networks to perform multi-speaker phoneme recognition at speaker-dependent rates. It achieves a 6-speaker (4 males, 2 females) recognition rate of 98.4% on a database of voiced-stops (/b,d,g/). This recognition performance constitutes a significant improvement over the 95.9% multi-speaker recognition rate obtained by a single TDNN trained in multi-speaker fashion. It also approaches the 98.7% average of the speaker-dependent recognition rates for the six speakers processed. We show that the Meta-Pi network can learn--without direct supervision--to recognize the speech of one particular speaker using a dynamic combination of internal models of other speakers exclusively (99.8% correct). The Meta-Pi model constitutes a viable basis for connectionist pattern recognition systems that can rapidly adapt to new stimuli by using dynamic, conditional combinations of existing stimulus-specific models. Automatic speech recognition Pattern recognition systems Waibel, Alex H. Verfasser aut Computer Science Department: CMU-CS Carnegie-Mellon University <Pittsburgh, Pa.> 89,166 (DE-604)BV006187264 89,166 |
spellingShingle | Hampshire, John B. Waibel, Alex H. The meta-pi network building distributed knowledge representations for robust pattern recognition Automatic speech recognition Pattern recognition systems |
title | The meta-pi network building distributed knowledge representations for robust pattern recognition |
title_auth | The meta-pi network building distributed knowledge representations for robust pattern recognition |
title_exact_search | The meta-pi network building distributed knowledge representations for robust pattern recognition |
title_full | The meta-pi network building distributed knowledge representations for robust pattern recognition John B. Hampshire ; Alex H. Waibel |
title_fullStr | The meta-pi network building distributed knowledge representations for robust pattern recognition John B. Hampshire ; Alex H. Waibel |
title_full_unstemmed | The meta-pi network building distributed knowledge representations for robust pattern recognition John B. Hampshire ; Alex H. Waibel |
title_short | The meta-pi network |
title_sort | the meta pi network building distributed knowledge representations for robust pattern recognition |
title_sub | building distributed knowledge representations for robust pattern recognition |
topic | Automatic speech recognition Pattern recognition systems |
topic_facet | Automatic speech recognition Pattern recognition systems |
volume_link | (DE-604)BV006187264 |
work_keys_str_mv | AT hampshirejohnb themetapinetworkbuildingdistributedknowledgerepresentationsforrobustpatternrecognition AT waibelalexh themetapinetworkbuildingdistributedknowledgerepresentationsforrobustpatternrecognition |