Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Clustering based on the In-tree Graph Structure and Affinity Propagation   A recently proposed clustering method, called the Nearest Descent (ND), can
organize the whole dataset into a sparsely connected graph, called the In-tree.
This ND-based Intree structure proves able to reveal the clustering structure
underlying the dataset, except one imperfect place, that is, there are some
undesired edges in this In-tree which require to be removed. Here, we propose
an effective way to automatically remove the undesired edges in In-tree via an
effective combination of the In-tree structure with affinity propagation (AP).
The key for the combination is to add edges between the reachable nodes in
In-tree before using AP to remove the undesired edges. The experiments on both
synthetic and real datasets demonstrate the effectiveness of the proposed
method.

29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol
20
The categories of this paper are: acc-phys
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
10
The categories of this paper are: q-bio
11
The categories of this paper are: hep-lat
31
The categories of this paper are: ao-sci
3
The categories of this paper are: physics
0
The categories of this paper are: hep-ph
37
The categories of this paper are: supr-con
21
The categories of this paper are: adap-org
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
35
The categories of this paper are: mtrl-th
4
The categories of this paper are: cond-mat