Monte Carlo Techniques for Estimating the Fiedler Vector in Graph Applications
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Linear Orderings of Random Geometric Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A Multi-scale Algorithm for the Linear Arrangement Problem
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Experiments on the minimum linear arrangement problem
Journal of Experimental Algorithmics (JEA)
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding partial orders from unordered 0-1 data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Aspects of the Binary CMAC: Unimodularity and Probabilistic Reconstruction
Neural Processing Letters
MatrixExplorer: a Dual-Representation System to Explore Social Networks
IEEE Transactions on Visualization and Computer Graphics
Graph matching and clustering using spectral partitions
Pattern Recognition
Nestedness and segmented nestedness
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast ordering of large categorical datasets for visualization
Intelligent Data Analysis
Design Aspects of Multi-level Reconfigurable Architectures
Journal of Signal Processing Systems
Graph spectral image smoothing using the heat kernel
Pattern Recognition
Banded structure in binary matrices
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Finding Total and Partial Orders from Data for Seriation
DS '08 Proceedings of the 11th International Conference on Discovery Science
Quantitative Evaluation on Heat Kernel Permutation Invariants
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Graph characteristics from the heat kernel trace
Pattern Recognition
Geometric Characterizations of Graphs Using Heat Kernel Embeddings
Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII
Text clustering algorithm based on spectral graph seriation
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Geometric characterization and clustering of graphs using heat kernel embeddings
Image and Vision Computing
Graph matching using spectral seriation and string edit distance
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Some experiments on clustering a set of strings
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Knowledge and Information Systems
A faster algorithm for finding minimum tucker submatrices
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Trace formula analysis of graphs
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Eigenspaces from seriated graphs
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Graph clustering using heat content invariants
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Machine learning with seriated graphs
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Graph seriation using semi-definite programming
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Comparing string representations and distances in a natural images classification task
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Recent results on heat kernel embedding of graphs
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Manifold embedding of graphs using the heat kernel
IMA'05 Proceedings of the 11th IMA international conference on Mathematics of Surfaces
Graph structure analysis based on complex network
Digital Signal Processing
Visualising many-objective populations
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
In applications ranging from DNA sequencing through archeological dating to sparse matrix reordering, a recurrent problem is the sequencing of elements in such a way that highly correlated pairs of elements are near each other. That is, given a correlation function f reflecting the desire for each pair of elements to be near each other, find all permutations $\pi$ with the property that if $\pi(i)seriation problem is a generalization of the well-studied consecutive ones problem. We present a spectral algorithm for this problem that has a number of interesting features. Whereas most previous applications of spectral techniques provide only bounds or heuristics, our result is an algorithm that correctly solves a nontrivial combinatorial problem. In addition, spectral methods are being successfully applied as heuristics to a variety of sequencing problems, and our result helps explain and justify these applications.