This paper deals with Gärdenfors’ theory of conceptual spaces. Let $${\mathcal {S}}$$
S
be a conceptual space consisting of 2-type fuzzy sets equipped with several kinds of metrics. Let a finite set of prototypes $$\tilde{P}_1,\ldots ,\tilde{P}_n\in \mathcal {S}$$
P
~
1
,
…
,
P
~
n
∈
S
be given. Our main result is the construction of a classification algorithm. That is, given an element $${\tilde{A}}\in \mathcal {S},$$
A
~
∈
S
,
our algorithm classifies it into the conceptual field determined by one of the given prototypes $$\tilde{P}_i.$$
P
~
i
.
The construction of our algorithm uses some physical analogies and the Newton potential plays a significant role here. Importantly, the resulting conceptual fields are not convex in the Euclidean sense, which we believe is a reasonable departure from the assumptions of Gardenfors’ original definition of the conceptual space. A partitioning algorithm of the space $$\mathcal {S}$$
S
is also considered in the paper. In the application section, we test our classification algorithm on real data and obtain very satisfactory results. Moreover, the example we consider is another argument against requiring convexity of conceptual fields.