mQAPViz: A divide-and-conquer multi-objective optimization algorithm to compute large data visualizations

April 02, 2018 Β· Declared Dead Β· πŸ› Annual Conference on Genetic and Evolutionary Computation

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Claudio Sanhueza, Francia JimΓ©nez, Regina Berretta, Pablo Moscato arXiv ID 1804.00656 Category cs.HC: Human-Computer Interaction Cross-listed cs.NE Citations 0 Venue Annual Conference on Genetic and Evolutionary Computation Last Checked 3 months ago
Abstract
Algorithms for data visualizations are essential tools for transforming data into useful narratives. Unfortunately, very few visualization algorithms can handle the large datasets of many real-world scenarios. In this study, we address the visualization of these datasets as a Multi-Objective Optimization Problem. We propose mQAPViz, a divide-and-conquer multi-objective optimization algorithm to compute large-scale data visualizations. Our method employs the Multi-Objective Quadratic Assignment Problem (mQAP) as the mathematical foundation to solve the visualization task at hand. The algorithm applies advanced sampling techniques originating from the field of machine learning and efficient data structures to scale to millions of data objects. The algorithm allocates objects onto a 2D grid layout. Experimental results on real-world and large datasets demonstrate that mQAPViz is a competitive alternative to existing techniques.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Human-Computer Interaction

Died the same way β€” πŸ‘» Ghosted