Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Angle constrained path to cluster multiple manifolds   In this paper, we propose a method to cluster multiple intersected manifolds.
The algorithm chooses several landmark nodes randomly and then checks whether
there is an angle constrained path between each landmark node and every other
node in the neighborhood graph. When the points lie on different manifolds with
intersection they should not be connected using a smooth path, thus the angle
constraint is used to prevent connecting points from one cluster to another
one. The resulting algorithm is implemented as a simple variation of Dijkstras
algorithm used in Isomap. However, Isomap was specifically designed for
dimensionality reduction in the single-manifold setting, and in particular,
can-not handle intersections. Our method is simpler than the previous proposals
in the literature and performs comparably to the best methods, both on
simulated and some real datasets.

26
The categories of this paper are: bayes-an
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
27
The categories of this paper are: comp-gas
24
The categories of this paper are: dg-ga
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
36
The categories of this paper are: cmp-lg
4
The categories of this paper are: cond-mat
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th
15
The categories of this paper are: nucl-ex
29
The categories of this paper are: funct-an
28
The categories of this paper are: alg-geom
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph