Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Multi-Objective Optimization utilizing Cluster Analysis applied to Dimensional Transposed Problems

by Karsten Wendt
Save 12% Save 12%
Current price ₹5,578.00
Original price ₹6,324.00
Original price ₹6,324.00
Original price ₹6,324.00
(-12%)
₹5,578.00
Current price ₹5,578.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9783959080422
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Tudpress Verlag Der Wissenschaften Gmbh
  • Publisher Imprint: Tudpress Verlag Der Wissenschaften Gmbh
  • Publication Date:
  • Pages: 228
  • Original Price: GBP 49.99
  • Language: English
  • Edition: N/A
  • Item Weight: 368 grams
  • BISAC Subject(s): Engineering (General)

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 run-times 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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us