0
$\begingroup$

I am trying to use clustering to determine the number of products in a search of products. So far I am using kmeans clustering. I have run into a problem where I cannot determine good features to use. Here are my clustering results for one search.

As you can see, there is clearly three different groups showing up at the moment. However, when you look at the top terms of each cluster, there is a clear issue. A lot of the terms are repeating in each cluster.

There is another issue, when I try to have the model predict which clusters a few test items are in, which are clearly different products, it says that they are in the same group. Here are the test terms:

Adjustable DC-DC LM 2596 Converter Buck Step Down Regulator Power Module LW SZUS
10pcs Mini360 3A DC Voltage Step Down Power Converter Buck Module 3.3V 5V 9V 12V
5V Out, 6V to 12V In AMS1117-5.0 5.0V Step-Down Linear Voltage Regulator Module
10pcs Mini LM2596s 3A DC to DC Buck Converter Power Supply Step Down Module

I have thought about using the grammar in each title as a feature, but as there is an 80 character limit for the titles, there rarely is any grammar. I am at a loss for where to go next in terms of trying to pick more features that would get me better results. I am doing all of this in python using scikitlearn and nltk.

$\endgroup$
  • $\begingroup$ What is your input like? Is it a list of keywords? Is it a description? How do you represent it? Bag-of-words, one-hot encoding, word embeddings? $\endgroup$ – Valentin Calomme Jul 12 '18 at 11:52
1
$\begingroup$

You cannot expect clustering to understand what a "product" is. So it will not make one cluster per product.

Also, the lines are very blurry: is the same mobile phone in different colors the same product, or not?

An unsupervised method cannot do this. You need to provide training data and use supervised learning.

$\endgroup$
0
$\begingroup$

Finding the number of clusters

Remember that K-Means needs to be given the number of clusters it will find in advance, which doesn't seem to be what you want. What you could do, however, is try different values of K and use an elbow method to pick the best K. You could also dry different clustering techniques like DBSCAN for instance, which will find the number of clusters by themselves.

Picking the right distance

K-Means uses Euclidean distance. My guess is that Euclidean distance doesn't represent similarity between your items well. Perhaps you should look into creating a custom similarity measure and check that it works well on some pairs of examples.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.