On Partitioning Multivariate Self-Affine Time Series
Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the precedin...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Taylor, Christopher Michael [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2017 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: IEEE transactions on evolutionary computation - New York, NY : IEEE, 1997, 21(2017), 6, Seite 845-862 |
|---|---|
| Übergeordnetes Werk: |
volume:21 ; year:2017 ; number:6 ; pages:845-862 |
| Links: |
|---|
| DOI / URN: |
10.1109/TEVC.2017.2688521 |
|---|
| Katalog-ID: |
OLC1999647351 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1999647351 | ||
| 003 | DE-627 | ||
| 005 | 20230715084844.0 | ||
| 007 | tu | ||
| 008 | 171228s2017 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1109/TEVC.2017.2688521 |2 doi | |
| 028 | 5 | 2 | |a PQ20171228 |
| 035 | |a (DE-627)OLC1999647351 | ||
| 035 | |a (DE-599)GBVOLC1999647351 | ||
| 035 | |a (PRQ)i652-3c8b821c0b526d44b69ba3086903df87746f5004ad1346dee9762df75da0dd1d0 | ||
| 035 | |a (KEY)0326032120170000021000600845onpartitioningmultivariateselfaffinetimeseries | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |q DNB |
| 100 | 1 | |a Taylor, Christopher Michael |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a On Partitioning Multivariate Self-Affine Time Series |
| 264 | 1 | |c 2017 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales. | ||
| 650 | 4 | |a Biological system modeling | |
| 650 | 4 | |a genetic algorithms | |
| 650 | 4 | |a Finance | |
| 650 | 4 | |a optimization methods | |
| 650 | 4 | |a Algorithm design and analysis | |
| 650 | 4 | |a Pareto optimization | |
| 650 | 4 | |a Econometrics | |
| 650 | 4 | |a Clustering algorithms | |
| 650 | 4 | |a Partitioning algorithms | |
| 650 | 4 | |a Time series analysis | |
| 650 | 4 | |a fractals | |
| 650 | 4 | |a Optimization | |
| 700 | 1 | |a Salhi, Abdellah |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t IEEE transactions on evolutionary computation |d New York, NY : IEEE, 1997 |g 21(2017), 6, Seite 845-862 |w (DE-627)230109055 |w (DE-600)1386081-1 |w (DE-576)059981148 |x 1089-778X |7 nnns |
| 773 | 1 | 8 | |g volume:21 |g year:2017 |g number:6 |g pages:845-862 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1109/TEVC.2017.2688521 |3 Volltext |
| 856 | 4 | 2 | |u http://ieeexplore.ieee.org/document/7908964 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2002 | ||
| 912 | |a GBV_ILN_4307 | ||
| 951 | |a AR | ||
| 952 | |d 21 |j 2017 |e 6 |h 845-862 | ||
| author_variant |
c m t cm cmt |
|---|---|
| matchkey_str |
article:1089778X:2017----::nattoigutvraeeff |
| hierarchy_sort_str |
2017 |
| publishDate |
2017 |
| allfields |
10.1109/TEVC.2017.2688521 doi PQ20171228 (DE-627)OLC1999647351 (DE-599)GBVOLC1999647351 (PRQ)i652-3c8b821c0b526d44b69ba3086903df87746f5004ad1346dee9762df75da0dd1d0 (KEY)0326032120170000021000600845onpartitioningmultivariateselfaffinetimeseries DE-627 ger DE-627 rakwb eng 620 DNB Taylor, Christopher Michael verfasserin aut On Partitioning Multivariate Self-Affine Time Series 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales. Biological system modeling genetic algorithms Finance optimization methods Algorithm design and analysis Pareto optimization Econometrics Clustering algorithms Partitioning algorithms Time series analysis fractals Optimization Salhi, Abdellah oth Enthalten in IEEE transactions on evolutionary computation New York, NY : IEEE, 1997 21(2017), 6, Seite 845-862 (DE-627)230109055 (DE-600)1386081-1 (DE-576)059981148 1089-778X nnns volume:21 year:2017 number:6 pages:845-862 http://dx.doi.org/10.1109/TEVC.2017.2688521 Volltext http://ieeexplore.ieee.org/document/7908964 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_4307 AR 21 2017 6 845-862 |
| spelling |
10.1109/TEVC.2017.2688521 doi PQ20171228 (DE-627)OLC1999647351 (DE-599)GBVOLC1999647351 (PRQ)i652-3c8b821c0b526d44b69ba3086903df87746f5004ad1346dee9762df75da0dd1d0 (KEY)0326032120170000021000600845onpartitioningmultivariateselfaffinetimeseries DE-627 ger DE-627 rakwb eng 620 DNB Taylor, Christopher Michael verfasserin aut On Partitioning Multivariate Self-Affine Time Series 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales. Biological system modeling genetic algorithms Finance optimization methods Algorithm design and analysis Pareto optimization Econometrics Clustering algorithms Partitioning algorithms Time series analysis fractals Optimization Salhi, Abdellah oth Enthalten in IEEE transactions on evolutionary computation New York, NY : IEEE, 1997 21(2017), 6, Seite 845-862 (DE-627)230109055 (DE-600)1386081-1 (DE-576)059981148 1089-778X nnns volume:21 year:2017 number:6 pages:845-862 http://dx.doi.org/10.1109/TEVC.2017.2688521 Volltext http://ieeexplore.ieee.org/document/7908964 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_4307 AR 21 2017 6 845-862 |
| allfields_unstemmed |
10.1109/TEVC.2017.2688521 doi PQ20171228 (DE-627)OLC1999647351 (DE-599)GBVOLC1999647351 (PRQ)i652-3c8b821c0b526d44b69ba3086903df87746f5004ad1346dee9762df75da0dd1d0 (KEY)0326032120170000021000600845onpartitioningmultivariateselfaffinetimeseries DE-627 ger DE-627 rakwb eng 620 DNB Taylor, Christopher Michael verfasserin aut On Partitioning Multivariate Self-Affine Time Series 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales. Biological system modeling genetic algorithms Finance optimization methods Algorithm design and analysis Pareto optimization Econometrics Clustering algorithms Partitioning algorithms Time series analysis fractals Optimization Salhi, Abdellah oth Enthalten in IEEE transactions on evolutionary computation New York, NY : IEEE, 1997 21(2017), 6, Seite 845-862 (DE-627)230109055 (DE-600)1386081-1 (DE-576)059981148 1089-778X nnns volume:21 year:2017 number:6 pages:845-862 http://dx.doi.org/10.1109/TEVC.2017.2688521 Volltext http://ieeexplore.ieee.org/document/7908964 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_4307 AR 21 2017 6 845-862 |
| allfieldsGer |
10.1109/TEVC.2017.2688521 doi PQ20171228 (DE-627)OLC1999647351 (DE-599)GBVOLC1999647351 (PRQ)i652-3c8b821c0b526d44b69ba3086903df87746f5004ad1346dee9762df75da0dd1d0 (KEY)0326032120170000021000600845onpartitioningmultivariateselfaffinetimeseries DE-627 ger DE-627 rakwb eng 620 DNB Taylor, Christopher Michael verfasserin aut On Partitioning Multivariate Self-Affine Time Series 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales. Biological system modeling genetic algorithms Finance optimization methods Algorithm design and analysis Pareto optimization Econometrics Clustering algorithms Partitioning algorithms Time series analysis fractals Optimization Salhi, Abdellah oth Enthalten in IEEE transactions on evolutionary computation New York, NY : IEEE, 1997 21(2017), 6, Seite 845-862 (DE-627)230109055 (DE-600)1386081-1 (DE-576)059981148 1089-778X nnns volume:21 year:2017 number:6 pages:845-862 http://dx.doi.org/10.1109/TEVC.2017.2688521 Volltext http://ieeexplore.ieee.org/document/7908964 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_4307 AR 21 2017 6 845-862 |
| allfieldsSound |
10.1109/TEVC.2017.2688521 doi PQ20171228 (DE-627)OLC1999647351 (DE-599)GBVOLC1999647351 (PRQ)i652-3c8b821c0b526d44b69ba3086903df87746f5004ad1346dee9762df75da0dd1d0 (KEY)0326032120170000021000600845onpartitioningmultivariateselfaffinetimeseries DE-627 ger DE-627 rakwb eng 620 DNB Taylor, Christopher Michael verfasserin aut On Partitioning Multivariate Self-Affine Time Series 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales. Biological system modeling genetic algorithms Finance optimization methods Algorithm design and analysis Pareto optimization Econometrics Clustering algorithms Partitioning algorithms Time series analysis fractals Optimization Salhi, Abdellah oth Enthalten in IEEE transactions on evolutionary computation New York, NY : IEEE, 1997 21(2017), 6, Seite 845-862 (DE-627)230109055 (DE-600)1386081-1 (DE-576)059981148 1089-778X nnns volume:21 year:2017 number:6 pages:845-862 http://dx.doi.org/10.1109/TEVC.2017.2688521 Volltext http://ieeexplore.ieee.org/document/7908964 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_4307 AR 21 2017 6 845-862 |
| language |
English |
| source |
Enthalten in IEEE transactions on evolutionary computation 21(2017), 6, Seite 845-862 volume:21 year:2017 number:6 pages:845-862 |
| sourceStr |
Enthalten in IEEE transactions on evolutionary computation 21(2017), 6, Seite 845-862 volume:21 year:2017 number:6 pages:845-862 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Biological system modeling genetic algorithms Finance optimization methods Algorithm design and analysis Pareto optimization Econometrics Clustering algorithms Partitioning algorithms Time series analysis fractals Optimization |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
IEEE transactions on evolutionary computation |
| authorswithroles_txt_mv |
Taylor, Christopher Michael @@aut@@ Salhi, Abdellah @@oth@@ |
| publishDateDaySort_date |
2017-01-01T00:00:00Z |
| hierarchy_top_id |
230109055 |
| dewey-sort |
3620 |
| id |
OLC1999647351 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1999647351</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230715084844.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">171228s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/TEVC.2017.2688521</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20171228</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1999647351</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1999647351</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)i652-3c8b821c0b526d44b69ba3086903df87746f5004ad1346dee9762df75da0dd1d0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0326032120170000021000600845onpartitioningmultivariateselfaffinetimeseries</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">620</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Taylor, Christopher Michael</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On Partitioning Multivariate Self-Affine Time Series</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</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="520" ind1=" " ind2=" "><subfield code="a">Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Biological system modeling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">genetic algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Finance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">optimization methods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm design and analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pareto optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Econometrics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Clustering algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Partitioning algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Time series analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">fractals</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Salhi, Abdellah</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on evolutionary computation</subfield><subfield code="d">New York, NY : IEEE, 1997</subfield><subfield code="g">21(2017), 6, Seite 845-862</subfield><subfield code="w">(DE-627)230109055</subfield><subfield code="w">(DE-600)1386081-1</subfield><subfield code="w">(DE-576)059981148</subfield><subfield code="x">1089-778X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:21</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:6</subfield><subfield code="g">pages:845-862</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/TEVC.2017.2688521</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://ieeexplore.ieee.org/document/7908964</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">GBV_ILN_30</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_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">21</subfield><subfield code="j">2017</subfield><subfield code="e">6</subfield><subfield code="h">845-862</subfield></datafield></record></collection>
|
| author |
Taylor, Christopher Michael |
| spellingShingle |
Taylor, Christopher Michael ddc 620 misc Biological system modeling misc genetic algorithms misc Finance misc optimization methods misc Algorithm design and analysis misc Pareto optimization misc Econometrics misc Clustering algorithms misc Partitioning algorithms misc Time series analysis misc fractals misc Optimization On Partitioning Multivariate Self-Affine Time Series |
| authorStr |
Taylor, Christopher Michael |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)230109055 |
| format |
Article |
| dewey-ones |
620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1089-778X |
| topic_title |
620 DNB On Partitioning Multivariate Self-Affine Time Series Biological system modeling genetic algorithms Finance optimization methods Algorithm design and analysis Pareto optimization Econometrics Clustering algorithms Partitioning algorithms Time series analysis fractals Optimization |
| topic |
ddc 620 misc Biological system modeling misc genetic algorithms misc Finance misc optimization methods misc Algorithm design and analysis misc Pareto optimization misc Econometrics misc Clustering algorithms misc Partitioning algorithms misc Time series analysis misc fractals misc Optimization |
| topic_unstemmed |
ddc 620 misc Biological system modeling misc genetic algorithms misc Finance misc optimization methods misc Algorithm design and analysis misc Pareto optimization misc Econometrics misc Clustering algorithms misc Partitioning algorithms misc Time series analysis misc fractals misc Optimization |
| topic_browse |
ddc 620 misc Biological system modeling misc genetic algorithms misc Finance misc optimization methods misc Algorithm design and analysis misc Pareto optimization misc Econometrics misc Clustering algorithms misc Partitioning algorithms misc Time series analysis misc fractals misc Optimization |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
a s as |
| hierarchy_parent_title |
IEEE transactions on evolutionary computation |
| hierarchy_parent_id |
230109055 |
| dewey-tens |
620 - Engineering |
| hierarchy_top_title |
IEEE transactions on evolutionary computation |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)230109055 (DE-600)1386081-1 (DE-576)059981148 |
| title |
On Partitioning Multivariate Self-Affine Time Series |
| ctrlnum |
(DE-627)OLC1999647351 (DE-599)GBVOLC1999647351 (PRQ)i652-3c8b821c0b526d44b69ba3086903df87746f5004ad1346dee9762df75da0dd1d0 (KEY)0326032120170000021000600845onpartitioningmultivariateselfaffinetimeseries |
| title_full |
On Partitioning Multivariate Self-Affine Time Series |
| author_sort |
Taylor, Christopher Michael |
| journal |
IEEE transactions on evolutionary computation |
| journalStr |
IEEE transactions on evolutionary computation |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2017 |
| contenttype_str_mv |
txt |
| container_start_page |
845 |
| author_browse |
Taylor, Christopher Michael |
| container_volume |
21 |
| class |
620 DNB |
| format_se |
Aufsätze |
| author-letter |
Taylor, Christopher Michael |
| doi_str_mv |
10.1109/TEVC.2017.2688521 |
| dewey-full |
620 |
| title_sort |
on partitioning multivariate self-affine time series |
| title_auth |
On Partitioning Multivariate Self-Affine Time Series |
| abstract |
Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales. |
| abstractGer |
Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales. |
| abstract_unstemmed |
Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_4307 |
| container_issue |
6 |
| title_short |
On Partitioning Multivariate Self-Affine Time Series |
| url |
http://dx.doi.org/10.1109/TEVC.2017.2688521 http://ieeexplore.ieee.org/document/7908964 |
| remote_bool |
false |
| author2 |
Salhi, Abdellah |
| author2Str |
Salhi, Abdellah |
| ppnlink |
230109055 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1109/TEVC.2017.2688521 |
| up_date |
2024-07-03T14:54:17.410Z |
| _version_ |
1803570073999245312 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1999647351</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230715084844.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">171228s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/TEVC.2017.2688521</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20171228</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1999647351</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1999647351</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)i652-3c8b821c0b526d44b69ba3086903df87746f5004ad1346dee9762df75da0dd1d0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0326032120170000021000600845onpartitioningmultivariateselfaffinetimeseries</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">620</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Taylor, Christopher Michael</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On Partitioning Multivariate Self-Affine Time Series</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</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="520" ind1=" " ind2=" "><subfield code="a">Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Biological system modeling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">genetic algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Finance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">optimization methods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm design and analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pareto optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Econometrics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Clustering algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Partitioning algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Time series analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">fractals</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Salhi, Abdellah</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on evolutionary computation</subfield><subfield code="d">New York, NY : IEEE, 1997</subfield><subfield code="g">21(2017), 6, Seite 845-862</subfield><subfield code="w">(DE-627)230109055</subfield><subfield code="w">(DE-600)1386081-1</subfield><subfield code="w">(DE-576)059981148</subfield><subfield code="x">1089-778X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:21</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:6</subfield><subfield code="g">pages:845-862</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/TEVC.2017.2688521</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://ieeexplore.ieee.org/document/7908964</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">GBV_ILN_30</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_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">21</subfield><subfield code="j">2017</subfield><subfield code="e">6</subfield><subfield code="h">845-862</subfield></datafield></record></collection>
|
| score |
7.402009 |