A hybrid method for multidimensional scaling using city-block distances
Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining rand...
Ausführliche Beschreibung
Autor*in: |
Žilinskas, Antanas [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2008 |
---|
Schlagwörter: |
---|
Anmerkung: |
© Springer-Verlag 2008 |
---|
Übergeordnetes Werk: |
Enthalten in: Mathematical methods of operations research - Springer-Verlag, 1996, 68(2008), 3 vom: 22. Juli, Seite 429-443 |
---|---|
Übergeordnetes Werk: |
volume:68 ; year:2008 ; number:3 ; day:22 ; month:07 ; pages:429-443 |
Links: |
---|
DOI / URN: |
10.1007/s00186-008-0238-5 |
---|
Katalog-ID: |
OLC2057883094 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC2057883094 | ||
003 | DE-627 | ||
005 | 20230323143808.0 | ||
007 | tu | ||
008 | 200820s2008 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/s00186-008-0238-5 |2 doi | |
035 | |a (DE-627)OLC2057883094 | ||
035 | |a (DE-He213)s00186-008-0238-5-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 650 |a 330 |q VZ |
084 | |a 3,2 |2 ssgn | ||
084 | |a 85.00 |2 bkl | ||
100 | 1 | |a Žilinskas, Antanas |e verfasserin |4 aut | |
245 | 1 | 0 | |a A hybrid method for multidimensional scaling using city-block distances |
264 | 1 | |c 2008 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
500 | |a © Springer-Verlag 2008 | ||
520 | |a Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling. | ||
650 | 4 | |a Multidimensional scaling | |
650 | 4 | |a Global optimization | |
650 | 4 | |a City-block distances | |
700 | 1 | |a Žilinskas, Julius |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Mathematical methods of operations research |d Springer-Verlag, 1996 |g 68(2008), 3 vom: 22. Juli, Seite 429-443 |w (DE-627)195962478 |w (DE-600)1310695-8 |w (DE-576)051452545 |x 1432-2994 |7 nnns |
773 | 1 | 8 | |g volume:68 |g year:2008 |g number:3 |g day:22 |g month:07 |g pages:429-443 |
856 | 4 | 1 | |u https://doi.org/10.1007/s00186-008-0238-5 |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a SSG-OLC-WIW | ||
912 | |a GBV_ILN_11 | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_21 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_26 | ||
912 | |a GBV_ILN_30 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_78 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_267 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2006 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2018 | ||
912 | |a GBV_ILN_2057 | ||
912 | |a GBV_ILN_2088 | ||
912 | |a GBV_ILN_4029 | ||
912 | |a GBV_ILN_4193 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4317 | ||
912 | |a GBV_ILN_4318 | ||
912 | |a GBV_ILN_4319 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
936 | b | k | |a 85.00 |q VZ |
951 | |a AR | ||
952 | |d 68 |j 2008 |e 3 |b 22 |c 07 |h 429-443 |
author_variant |
a ž až j ž jž |
---|---|
matchkey_str |
article:14322994:2008----::hbimtofrutdmninlclnuig |
hierarchy_sort_str |
2008 |
bklnumber |
85.00 |
publishDate |
2008 |
allfields |
10.1007/s00186-008-0238-5 doi (DE-627)OLC2057883094 (DE-He213)s00186-008-0238-5-p DE-627 ger DE-627 rakwb eng 650 330 VZ 3,2 ssgn 85.00 bkl Žilinskas, Antanas verfasserin aut A hybrid method for multidimensional scaling using city-block distances 2008 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2008 Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling. Multidimensional scaling Global optimization City-block distances Žilinskas, Julius aut Enthalten in Mathematical methods of operations research Springer-Verlag, 1996 68(2008), 3 vom: 22. Juli, Seite 429-443 (DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 1432-2994 nnns volume:68 year:2008 number:3 day:22 month:07 pages:429-443 https://doi.org/10.1007/s00186-008-0238-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_32 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_95 GBV_ILN_267 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2057 GBV_ILN_2088 GBV_ILN_4029 GBV_ILN_4193 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 85.00 VZ AR 68 2008 3 22 07 429-443 |
spelling |
10.1007/s00186-008-0238-5 doi (DE-627)OLC2057883094 (DE-He213)s00186-008-0238-5-p DE-627 ger DE-627 rakwb eng 650 330 VZ 3,2 ssgn 85.00 bkl Žilinskas, Antanas verfasserin aut A hybrid method for multidimensional scaling using city-block distances 2008 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2008 Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling. Multidimensional scaling Global optimization City-block distances Žilinskas, Julius aut Enthalten in Mathematical methods of operations research Springer-Verlag, 1996 68(2008), 3 vom: 22. Juli, Seite 429-443 (DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 1432-2994 nnns volume:68 year:2008 number:3 day:22 month:07 pages:429-443 https://doi.org/10.1007/s00186-008-0238-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_32 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_95 GBV_ILN_267 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2057 GBV_ILN_2088 GBV_ILN_4029 GBV_ILN_4193 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 85.00 VZ AR 68 2008 3 22 07 429-443 |
allfields_unstemmed |
10.1007/s00186-008-0238-5 doi (DE-627)OLC2057883094 (DE-He213)s00186-008-0238-5-p DE-627 ger DE-627 rakwb eng 650 330 VZ 3,2 ssgn 85.00 bkl Žilinskas, Antanas verfasserin aut A hybrid method for multidimensional scaling using city-block distances 2008 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2008 Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling. Multidimensional scaling Global optimization City-block distances Žilinskas, Julius aut Enthalten in Mathematical methods of operations research Springer-Verlag, 1996 68(2008), 3 vom: 22. Juli, Seite 429-443 (DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 1432-2994 nnns volume:68 year:2008 number:3 day:22 month:07 pages:429-443 https://doi.org/10.1007/s00186-008-0238-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_32 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_95 GBV_ILN_267 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2057 GBV_ILN_2088 GBV_ILN_4029 GBV_ILN_4193 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 85.00 VZ AR 68 2008 3 22 07 429-443 |
allfieldsGer |
10.1007/s00186-008-0238-5 doi (DE-627)OLC2057883094 (DE-He213)s00186-008-0238-5-p DE-627 ger DE-627 rakwb eng 650 330 VZ 3,2 ssgn 85.00 bkl Žilinskas, Antanas verfasserin aut A hybrid method for multidimensional scaling using city-block distances 2008 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2008 Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling. Multidimensional scaling Global optimization City-block distances Žilinskas, Julius aut Enthalten in Mathematical methods of operations research Springer-Verlag, 1996 68(2008), 3 vom: 22. Juli, Seite 429-443 (DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 1432-2994 nnns volume:68 year:2008 number:3 day:22 month:07 pages:429-443 https://doi.org/10.1007/s00186-008-0238-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_32 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_95 GBV_ILN_267 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2057 GBV_ILN_2088 GBV_ILN_4029 GBV_ILN_4193 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 85.00 VZ AR 68 2008 3 22 07 429-443 |
allfieldsSound |
10.1007/s00186-008-0238-5 doi (DE-627)OLC2057883094 (DE-He213)s00186-008-0238-5-p DE-627 ger DE-627 rakwb eng 650 330 VZ 3,2 ssgn 85.00 bkl Žilinskas, Antanas verfasserin aut A hybrid method for multidimensional scaling using city-block distances 2008 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2008 Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling. Multidimensional scaling Global optimization City-block distances Žilinskas, Julius aut Enthalten in Mathematical methods of operations research Springer-Verlag, 1996 68(2008), 3 vom: 22. Juli, Seite 429-443 (DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 1432-2994 nnns volume:68 year:2008 number:3 day:22 month:07 pages:429-443 https://doi.org/10.1007/s00186-008-0238-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_32 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_95 GBV_ILN_267 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2057 GBV_ILN_2088 GBV_ILN_4029 GBV_ILN_4193 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 85.00 VZ AR 68 2008 3 22 07 429-443 |
language |
English |
source |
Enthalten in Mathematical methods of operations research 68(2008), 3 vom: 22. Juli, Seite 429-443 volume:68 year:2008 number:3 day:22 month:07 pages:429-443 |
sourceStr |
Enthalten in Mathematical methods of operations research 68(2008), 3 vom: 22. Juli, Seite 429-443 volume:68 year:2008 number:3 day:22 month:07 pages:429-443 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Multidimensional scaling Global optimization City-block distances |
dewey-raw |
650 |
isfreeaccess_bool |
false |
container_title |
Mathematical methods of operations research |
authorswithroles_txt_mv |
Žilinskas, Antanas @@aut@@ Žilinskas, Julius @@aut@@ |
publishDateDaySort_date |
2008-07-22T00:00:00Z |
hierarchy_top_id |
195962478 |
dewey-sort |
3650 |
id |
OLC2057883094 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2057883094</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323143808.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2008 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00186-008-0238-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2057883094</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00186-008-0238-5-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">650</subfield><subfield code="a">330</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Žilinskas, Antanas</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A hybrid method for multidimensional scaling using city-block distances</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2008</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2008</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multidimensional scaling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Global optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">City-block distances</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Žilinskas, Julius</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Mathematical methods of operations research</subfield><subfield code="d">Springer-Verlag, 1996</subfield><subfield code="g">68(2008), 3 vom: 22. Juli, Seite 429-443</subfield><subfield code="w">(DE-627)195962478</subfield><subfield code="w">(DE-600)1310695-8</subfield><subfield code="w">(DE-576)051452545</subfield><subfield code="x">1432-2994</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:68</subfield><subfield code="g">year:2008</subfield><subfield code="g">number:3</subfield><subfield code="g">day:22</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:429-443</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00186-008-0238-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_78</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4193</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.00</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">68</subfield><subfield code="j">2008</subfield><subfield code="e">3</subfield><subfield code="b">22</subfield><subfield code="c">07</subfield><subfield code="h">429-443</subfield></datafield></record></collection>
|
author |
Žilinskas, Antanas |
spellingShingle |
Žilinskas, Antanas ddc 650 ssgn 3,2 bkl 85.00 misc Multidimensional scaling misc Global optimization misc City-block distances A hybrid method for multidimensional scaling using city-block distances |
authorStr |
Žilinskas, Antanas |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)195962478 |
format |
Article |
dewey-ones |
650 - Management & auxiliary services 330 - Economics |
delete_txt_mv |
keep |
author_role |
aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
1432-2994 |
topic_title |
650 330 VZ 3,2 ssgn 85.00 bkl A hybrid method for multidimensional scaling using city-block distances Multidimensional scaling Global optimization City-block distances |
topic |
ddc 650 ssgn 3,2 bkl 85.00 misc Multidimensional scaling misc Global optimization misc City-block distances |
topic_unstemmed |
ddc 650 ssgn 3,2 bkl 85.00 misc Multidimensional scaling misc Global optimization misc City-block distances |
topic_browse |
ddc 650 ssgn 3,2 bkl 85.00 misc Multidimensional scaling misc Global optimization misc City-block distances |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Mathematical methods of operations research |
hierarchy_parent_id |
195962478 |
dewey-tens |
650 - Management & public relations 330 - Economics |
hierarchy_top_title |
Mathematical methods of operations research |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 |
title |
A hybrid method for multidimensional scaling using city-block distances |
ctrlnum |
(DE-627)OLC2057883094 (DE-He213)s00186-008-0238-5-p |
title_full |
A hybrid method for multidimensional scaling using city-block distances |
author_sort |
Žilinskas, Antanas |
journal |
Mathematical methods of operations research |
journalStr |
Mathematical methods of operations research |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
600 - Technology 300 - Social sciences |
recordtype |
marc |
publishDateSort |
2008 |
contenttype_str_mv |
txt |
container_start_page |
429 |
author_browse |
Žilinskas, Antanas Žilinskas, Julius |
container_volume |
68 |
class |
650 330 VZ 3,2 ssgn 85.00 bkl |
format_se |
Aufsätze |
author-letter |
Žilinskas, Antanas |
doi_str_mv |
10.1007/s00186-008-0238-5 |
dewey-full |
650 330 |
title_sort |
a hybrid method for multidimensional scaling using city-block distances |
title_auth |
A hybrid method for multidimensional scaling using city-block distances |
abstract |
Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling. © Springer-Verlag 2008 |
abstractGer |
Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling. © Springer-Verlag 2008 |
abstract_unstemmed |
Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling. © Springer-Verlag 2008 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_32 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_95 GBV_ILN_267 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2057 GBV_ILN_2088 GBV_ILN_4029 GBV_ILN_4193 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 |
container_issue |
3 |
title_short |
A hybrid method for multidimensional scaling using city-block distances |
url |
https://doi.org/10.1007/s00186-008-0238-5 |
remote_bool |
false |
author2 |
Žilinskas, Julius |
author2Str |
Žilinskas, Julius |
ppnlink |
195962478 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s00186-008-0238-5 |
up_date |
2024-07-03T16:43:28.222Z |
_version_ |
1803576943030829056 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2057883094</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323143808.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2008 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00186-008-0238-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2057883094</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00186-008-0238-5-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">650</subfield><subfield code="a">330</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Žilinskas, Antanas</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A hybrid method for multidimensional scaling using city-block distances</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2008</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2008</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multidimensional scaling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Global optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">City-block distances</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Žilinskas, Julius</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Mathematical methods of operations research</subfield><subfield code="d">Springer-Verlag, 1996</subfield><subfield code="g">68(2008), 3 vom: 22. Juli, Seite 429-443</subfield><subfield code="w">(DE-627)195962478</subfield><subfield code="w">(DE-600)1310695-8</subfield><subfield code="w">(DE-576)051452545</subfield><subfield code="x">1432-2994</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:68</subfield><subfield code="g">year:2008</subfield><subfield code="g">number:3</subfield><subfield code="g">day:22</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:429-443</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00186-008-0238-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_78</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4193</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.00</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">68</subfield><subfield code="j">2008</subfield><subfield code="e">3</subfield><subfield code="b">22</subfield><subfield code="c">07</subfield><subfield code="h">429-443</subfield></datafield></record></collection>
|
score |
7.3987494 |