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.
"synopsis" may belong to another edition of this title.
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783959080422
Quantity: Over 20 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Apr0316110178834
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783959080422
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783959080422_new
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783959080422
Quantity: 10 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: 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. Seller Inventory # 9783959080422
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 228. Seller Inventory # 26391754749
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 228. Seller Inventory # 388893730
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 228. Seller Inventory # 18391754743
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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.TUDpress, Hüblerstraße 26, 01309 Dresden 228 pp. Englisch. Seller Inventory # 9783959080422