With respect to the importance of multi-objective optimization in the context of the today's information processing and analysis, as well as the limitation of current approaches to treat large and complex tasks in practical time and little adjustment costs, this work proposes a novel optimization concept, based on data domain transformations and subsequent cluster analyses to solve multi-objective optimization problems. The approach abstracts the transposition of large, high-dimensional and diverse data models to low-dimensional uniform equivalents within an independent framework, which is optimized regarding data similarity conservation, i.e. the semantic relations of the data items to each other are preserved, and low runtime complexity, i.e. linearly increasing model sizes also cause only linearly growing runtimes in spite of the consideration of all data relations. The cluster analysis step is represented by an enhanced version of the k-Means algorithm, which is designed to group large numbers of data items to large numbers of clusters with also linear time complexity. Applying and adapting these both components to generic segmentation and pattern recognition tasks as two representative multi-objective optimization problems, illustrate and prove the usability of the proposed concept, by solving these tasks with high qualities of results and low runtimes with virtually linear time complexities. The abstracted components, as well as their application extensions are tested and analyzed during full factorial design tests, utilizing artificial, scalable data models, to determine valid parameter ranges, qualities of results and runtimes, as well as to ensure repeatable and comparable tests.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 26075880-n
Quantità: Più di 20 disponibili
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9783959080422
Quantità: Più di 20 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9783959080422
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783959080422_new
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -With respect to the importance of multi-objective optimization in the context of the today's information processing and analysis, as well as the limitation of current approaches to treat large and complex tasks in practical time and little adjustment costs, this work proposes a novel optimization concept, based on data domain transformations and subsequent cluster analyses to solve multi-objective optimization problems. The approach abstracts the transposition of large, high-dimensional and diverse data models to low-dimensional uniform equivalents within an independent framework, which is optimized regarding data similarity conservation, i.e. the semantic relations of the data items to each other are preserved, and low runtime complexity, i.e. linearly increasing model sizes also cause only linearly growing runtimes in spite of the consideration of all data relations. The cluster analysis step is represented by an enhanced version of the k-Means algorithm, which is designed to group large numbers of data items to large numbers of clusters with also linear time complexity. Applying and adapting these both components to generic segmentation and pattern recognition tasks as two representative multi-objective optimization problems, illustrate and prove the usability of the proposed concept, by solving these tasks with high qualities of results and low runtimes with virtually linear time complexities. The abstracted components, as well as their application extensions are tested and analyzed during full factorial design tests, utilizing artificial, scalable data models, to determine valid parameter ranges, qualities of results and runtimes, as well as to ensure repeatable and comparable tests. 228 pp. Englisch. Codice articolo 9783959080422
Quantità: 2 disponibili
Da: Chiron Media, Wallingford, Regno Unito
Paperback. Condizione: New. Codice articolo 6666-IUK-9783959080422
Quantità: 10 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 26075880-n
Quantità: Più di 20 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 228. Codice articolo 388893730
Quantità: 4 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Print on Demand pp. 228. Codice articolo 26391754749
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 228. Codice articolo 18391754743
Quantità: 4 disponibili