Name
Abstract | ||
|---|---|---|
We consider the problem of recovering a circular arrangement of data instances with respect to some proximity measure, such that nearby instances are more similar. Applications of this problem, also referred to as circular seriation, can be found in various disciplines such as genome sequencing, data visualization and exploratory data analysis. Circular seriation can be expressed as a quadratic assignment problem, which is in general an intractable problem. Spectral-based approaches can be used to find approximate solutions, but are shown to perform well only for a specific class of data matrices. We propose a bilevel optimization framework where we employ a spherical embedding approach together with a spectral method for circular ordering in order to recover circular arrangements of the embedded data. Experiments on real and synthetic datasets demonstrate the competitive performance of the proposed method. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.patcog.2019.107192 | Pattern Recognition |
Keywords | DocType | Volume |
Combinatorial data analysis,Data sequencing,Circular seriation,Quadratic assignment problem,Spherical embeddings | Journal | 103 |
Issue | ISSN | Citations |
1 | 0031-3203 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xenophon Evangelopoulos | 1 | 0 | 0.34 |
| Austin J. Brockmeier | 2 | 20 | 5.24 |
| Tingting Mu | 3 | 19 | 4.98 |
| John Y. Goulermas | 4 | 0 | 0.68 |