Optimal Neighborhood Preserving Visualization by Maximum Satisfiability

We present a novel approach to low-dimensional neighbor embedding for visualization, based on formulating an information retrieval based neighborhood preservation cost function as Maximum satisfiability on a discretized output display. The method has a rigorous interpretation as optimal visualization based on the cost function. Unlike previous lowdimensional neighbor embedding methods, our formulation is guaranteed to yield globally optimal visualizations, and does so reasonably fast. Unlike previous manifold learning methods yielding global optima of their cost functions, our cost function and method are designed for low-dimensional visualization where evaluation and minimization of visualization errors are crucial. Our method performs well in experiments, yielding clean embeddings of datasets where a stateof-the-art comparison method yields poor arrangements. In a real-world case study for semi-supervised WLAN signal mapping in buildings we outperform state-of-the-art methods.

Authors

• Kerstin Bunte Helsinki Institute for Information Technology HIIT and Aalto University
• Matti Järvisalo University of Helsinki
• Jeremias Berg Helsinki Institute for Information Technology HIIT and University of Helsinki
• Petri Myllymäki Helsinki Institute for Information Technology HIIT and University of Helsinki
• Jaakko Peltonen
• Samuel Kaski Aalto University The University of Manchester

Keywords

No keywords are indexed for this paper.