loe-package

Soft Ordinal Embedding (SOE) is a simple new method for ordinal embedding problem.
SOE can deal with a part of ordinal comparisons:
$dissimilarity(i,j)<dissimilarity(k,l)$ for="" certain="" quadruples="" of="" indices="" $(i,j,k,l)$.<="" p="">The local point of view suggests
ordinal embedding as an interesting alternative to graph drawing
algorithms. If vertex $i$ is connected by an edge to vertex $j$, but
not to vertex $k$, we interpret this constellation as a constraint of
the form $dissimilarity(i,j)<dissimilarity(i,k)$. with="" this="" interpretation,="" graph="" embedding="" (graph="" drawing)="" becomes="" a="" special="" case="" of="" ordinal="" embedding.="" we="" call="" soe="" for="" problem="" local="" (loe).="" the="" connectivity="" matrix="" given="" unweighted="" graph,="" loe="" provides="" low-dimensional="" which="" preserves="" original="" structure.<="" p="">This package provides SOE and LOE. </dissimilarity(i,k)$.></dissimilarity(k,l)$>

Local Ordinal embedding (LOE) is one of graph embedding methods for unweighted graphs.

Yoshikazu Terada

Local Ordinal Embedding

loe-package function

The authors wishes to express their thanks to Dr. Michio Yamamoto and Mr. Yuichi Saito for their help in creating this package.
	This work was partially supported by Grant-in-Aid for JSPS Fellows Number 24-2466.

loe-package: Local Ordinal Embedding

Description

Arguments

Acknowledgement

Details