The Altair Community is migrating to a new platform to provide a better experience for you. In preparation for the migration, the Altair Community is on read-only mode from October 28 - November 6, 2024. Technical support via cases will continue to work as is. For any urgent requests from Students/Faculty members, please submit the form linked here

Text clustering using k-Means and optimizing the amount of clusters

molsenmolsen Member Posts: 6 Contributor II
edited November 2018 in Help

Hello.

I have made the attached process for RapidMiner, which will do the following:

Take the text from different rows and cluster them by similarity, while also carrying over the unique id number of each row. An optimization of the number of clusters needed by the Elbow method is also part of the process.

 ID and text.png

It is probably not perfect, but it took me some time to scramble together from different sources.

I hope it might help people who are in the same situation as I was to get a better starting point.

Here is the file:

Text clustering

Tagged:

Answers

  • MartinLiebigMartinLiebig Administrator, Moderator, Employee-RapidMiner, RapidMiner Certified Analyst, RapidMiner Certified Expert, University Professor Posts: 3,533 RM Data Scientist

    Hi,

     

    have a look at the processes i created for my hearthstone analysis: https://rapidminer.com/creative-use-hearthstone-cluster-analysis/ 

     

    This contains the ellbow, even with nice python plots.

     

    ~Martin

    - Sr. Director Data Solutions, Altair RapidMiner -
    Dortmund, Germany
Sign In or Register to comment.