BACKGROUND: The visualization of large volumes of data is a computationally challenging task that often promises rewarding new insights. There is great potential in the application of new algorithms and models from combinatorial optimisation. Datasets often contain "hidden regularities" and a combined identification and visualization method should reveal these structures and present them in a way that helps analysis. While several methodologies exist, including those that use non-linear optimization algorithms, severe limitations exist even when working with only a few hundred objects. METHODOLOGY/PRINCIPAL FINDINGS: We present a new data visualization approach (QAPgrid) that reveals patterns of similarities and differences in large dataset...
Local Optima Networks (LON) model combinatorial landscapes as graphs, where nodes are local optima a...
Many important traits in plants, animals and humans are quantitative, and most such traits are gener...
The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide ...
Background: The visualization of large volumes of data is a computationally challenging task that of...
Background: The visualization of large volumes of data is a computationally challenging task that of...
The visualization of large volumes of data is a computationally challenging task that often promises...
This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model th...
Data visualization is the process of transforming data, information, and knowledge into visual form,...
Quadratic assignment problems arise in a wide variety of domains, spanning operations research, grap...
Quadratic assignment problems arise in a wide variety of domains, spanning operations re-search, gra...
This paper introduces an automatic procedure to assist on the interpretation of a large dataset when...
The quadratic assignment problem (QAP) is one of the most studied NP-hard problems with various prac...
Graph matching (GM)—the process of finding an optimal permutation of the vertices of one graph to mi...
OnLine Analytical Processing (OLAP) is a relational database technology providing users with rapid a...
Much of the previous work in the large data visualization area has solely focused on handling the sc...
Local Optima Networks (LON) model combinatorial landscapes as graphs, where nodes are local optima a...
Many important traits in plants, animals and humans are quantitative, and most such traits are gener...
The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide ...
Background: The visualization of large volumes of data is a computationally challenging task that of...
Background: The visualization of large volumes of data is a computationally challenging task that of...
The visualization of large volumes of data is a computationally challenging task that often promises...
This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model th...
Data visualization is the process of transforming data, information, and knowledge into visual form,...
Quadratic assignment problems arise in a wide variety of domains, spanning operations research, grap...
Quadratic assignment problems arise in a wide variety of domains, spanning operations re-search, gra...
This paper introduces an automatic procedure to assist on the interpretation of a large dataset when...
The quadratic assignment problem (QAP) is one of the most studied NP-hard problems with various prac...
Graph matching (GM)—the process of finding an optimal permutation of the vertices of one graph to mi...
OnLine Analytical Processing (OLAP) is a relational database technology providing users with rapid a...
Much of the previous work in the large data visualization area has solely focused on handling the sc...
Local Optima Networks (LON) model combinatorial landscapes as graphs, where nodes are local optima a...
Many important traits in plants, animals and humans are quantitative, and most such traits are gener...
The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide ...