Verfügbarkeit: The random projection method | Technische Universität München

The random projection method:

Gespeichert in:

Bibliographische Detailangaben
Beteilige Person:	Vempala, Santosh S. (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Providence, RI American Mathematical Soc. 2004
Schriftenreihe:	DIMACS series in discrete mathematics and theoretical computer science 65
Schlagwörter:	Anwendung Kombinatorische Optimierung Zufall Projektionsverfahren Algorithmus
Links:	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017473267&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	IX, 105 S. graph. Darst.
ISBN:	0821820184

Internformat

MARC


LEADER	00000nam a2200000zcb4500
001	BV023831105
003	DE-604
005	20090401000000.0
007	t\|
008	040915s2004 xx d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0821820184 \|9 0-8218-2018-4
035			\|a (OCoLC)635589493
035			\|a (DE-599)BVBBV023831105
040			\|a DE-604 \|b ger
041	0		\|a eng
049			\|a DE-634 \|a DE-11 \|a DE-188
082	0		\|a 518.1
084			\|a SK 970 \|0 (DE-625)143276: \|2 rvk
100	1		\|a Vempala, Santosh S. \|e Verfasser \|4 aut
245	1	0	\|a The random projection method \|c Santosh S. Vempala
264		1	\|a Providence, RI \|b American Mathematical Soc. \|c 2004
300			\|a IX, 105 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a DIMACS series in discrete mathematics and theoretical computer science \|v 65
650	0	7	\|a Anwendung \|0 (DE-588)4196864-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Zufall \|0 (DE-588)4068050-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Projektionsverfahren \|0 (DE-588)4175879-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
689	0	0	\|a Projektionsverfahren \|0 (DE-588)4175879-1 \|D s
689	0	1	\|a Zufall \|0 (DE-588)4068050-2 \|D s
689	0	2	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0	3	\|a Anwendung \|0 (DE-588)4196864-5 \|D s
689	0	4	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|D s
689	0		\|5 DE-604
830		0	\|a DIMACS series in discrete mathematics and theoretical computer science \|v 65 \|w (DE-604)BV004648770 \|9 65
856	4	2	\|m HEBIS Datenaustausch Mainz \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017473267&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-017473267

Datensatz im Suchindex

_version_	1819259564644630528
adam_text	DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE VOLUME 65 THE RANDOM PROJECTION METHOD SANTOSH S. VEMPALA CENTER FOR DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE A CONSORTIUM OF RUTGERS UNIVERSITY, PRINCETON UNIVERSITY, AT&T LABS-RESEARCH, BELL LABS (LUCENT TECHNOLOGIES), NEC LABORATORIES AMERICA, AND TELCORDIA TECHNOLOGIES (WITH PARTNERS AT AVAYA LABS, IBM RESEARCH, AND MICROSOFT RESEARCH) AMERICAN MATHEMATICAL SOCIETY CONTENTS FOREWORD (BY CHRISTOS H. PAPADIMITRIOU) VII ACKNOWLEDGEMENTS IX CHAPTER 1. RANDOM PROJECTION 1 1.1. HOW TO PROJECT 1 1.2. BASIC PROPERTIES OF RANDOM PROJECTION 2 1.3. WHEN TO PROJECT 4 PART 1. COMBINATORIAL OPTIMIZATION 5 CHAPTER 2. ROUNDING VIA RANDOM PROJECTION 7 2.1. MAXIMUM CUT 7 2.2. MAXIMUM FC-CUT 9 2.3. COLORING 11 CHAPTER 3. EMBEDDING METRICS IN EUCLIDEAN SPACE 15 3.1. BOURGAIN S EMBEDDING 16 3.2. FINDING A MINIMUM DISTORTION EMBEDDING 19 3.3. THE MAX-FLOW MIN-CUT GAP FOR MULTICOMMODITY FLOW 20 CHAPTER 4. EUCLIDEAN EMBEDDINGS: BEYOND DISTANCE PRESERVATION 27 4.1. METRIC VOLUME AND GEOMETRIC VOLUME 27 4.2. PRESERVING POINT-SUBSET DISTANCES. 34 4.3. ORDERING AND LAYOUT PROBLEMS 40 4.4. THE EMBED-AND-PROJECT ROUNDING ALGORITHM 43 PART 2. LEARNING THEORY 49 CHAPTER 5. ROBUST CONCEPTS 51 5.1. A MODEL OF COGNITIVE LEARNING 52 5.2. NEURON-FRIENDLY RANDOM PROJECTION 52 5.3. ROBUST HALF-SPACES 57 CHAPTER 6. INTERSECTIONS OF HALF-SPACES 61 6.1. THE COMPLEXITY OF AN OLD PROBLEM 61 6.2. A RANDOMIZED ALGORITHM 63 6.3. ITS ANALYSIS 67 PART 3. INFORMATION RETRIEVAL 75 CHAPTER 7. NEAREST NEIGHBORS 77 VI CONTENTS 7.1. EUCLIDEAN SPACE 77 7.2. RANDOM PROJECTION FOR THE HYPERCUBE 79 7.3. BACK TO EUCLIDEAN SPACE 83 CHAPTER 8. INDEXING AND CLUSTERING 87 8.1. FAST LOW-RANK APPROXIMATION 87 8.2. GEOMETRIC P-MEDIAN 92 BIBLIOGRAPHY 97 APPENDIX 101
any_adam_object	1
author	Vempala, Santosh S.
author_facet	Vempala, Santosh S.
author_role	aut
author_sort	Vempala, Santosh S.
author_variant	s s v ss ssv
building	Verbundindex
bvnumber	BV023831105
classification_rvk	SK 970
ctrlnum	(OCoLC)635589493 (DE-599)BVBBV023831105
dewey-full	518.1
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	518 - Numerical analysis
dewey-raw	518.1
dewey-search	518.1
dewey-sort	3518.1
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>01884nam a2200445zcb4500</leader><controlfield tag="001">BV023831105</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090401000000.0</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">040915s2004 xx d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0821820184</subfield><subfield code="9">0-8218-2018-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)635589493</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023831105</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vempala, Santosh S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The random projection method</subfield><subfield code="c">Santosh S. Vempala</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Providence, RI</subfield><subfield code="b">American Mathematical Soc.</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 105 S.</subfield><subfield code="b">graph. Darst.</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">DIMACS series in discrete mathematics and theoretical computer science</subfield><subfield code="v">65</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Anwendung</subfield><subfield code="0">(DE-588)4196864-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zufall</subfield><subfield code="0">(DE-588)4068050-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Projektionsverfahren</subfield><subfield code="0">(DE-588)4175879-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Projektionsverfahren</subfield><subfield code="0">(DE-588)4175879-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Zufall</subfield><subfield code="0">(DE-588)4068050-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Anwendung</subfield><subfield code="0">(DE-588)4196864-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">DIMACS series in discrete mathematics and theoretical computer science</subfield><subfield code="v">65</subfield><subfield code="w">(DE-604)BV004648770</subfield><subfield code="9">65</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Mainz</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017473267&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017473267</subfield></datafield></record></collection>
id	DE-604.BV023831105
illustrated	Illustrated
indexdate	2024-12-20T13:34:58Z
institution	BVB
isbn	0821820184
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-017473267
oclc_num	635589493
open_access_boolean
owner	DE-634 DE-11 DE-188
owner_facet	DE-634 DE-11 DE-188
physical	IX, 105 S. graph. Darst.
publishDate	2004
publishDateSearch	2004
publishDateSort	2004
publisher	American Mathematical Soc.
record_format	marc
series	DIMACS series in discrete mathematics and theoretical computer science
series2	DIMACS series in discrete mathematics and theoretical computer science
spellingShingle	Vempala, Santosh S. The random projection method DIMACS series in discrete mathematics and theoretical computer science Anwendung (DE-588)4196864-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Zufall (DE-588)4068050-2 gnd Projektionsverfahren (DE-588)4175879-1 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4196864-5 (DE-588)4031826-6 (DE-588)4068050-2 (DE-588)4175879-1 (DE-588)4001183-5
title	The random projection method
title_auth	The random projection method
title_exact_search	The random projection method
title_full	The random projection method Santosh S. Vempala
title_fullStr	The random projection method Santosh S. Vempala
title_full_unstemmed	The random projection method Santosh S. Vempala
title_short	The random projection method
title_sort	the random projection method
topic	Anwendung (DE-588)4196864-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Zufall (DE-588)4068050-2 gnd Projektionsverfahren (DE-588)4175879-1 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Anwendung Kombinatorische Optimierung Zufall Projektionsverfahren Algorithmus
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017473267&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV004648770
work_keys_str_mv	AT vempalasantoshs therandomprojectionmethod

Verfügbarkeit

‌

Inhaltsverzeichnis