兴趣相似的人聚类的算法

本文介绍了兴趣相似的人聚类的算法的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！ 问题描述

我想根据人们的兴趣将他们分为几类.例如.喜欢机器学习和图形的人可以放在一个小组中，而对数学和经济学等感兴趣的人可以放在一个小组中.

I want to cluster people into groups based on their interests. For eg. people who like machine learning and graphs may be placed in a group and people who have interest in mathematics and economics etc. may be placed in a different group.

该算法应该能够根据人们的利益来决定哪些人的利益最匹配，并创建集群.它还应该能够输出特定人所在的组中的其他人.

The algorithm should be able to decide which people have most matching interests based on the interests of the people and create clusters.It should also be able to output about other persons in the group in which a particular person is placed.

推荐答案

这听起来并不像是一个特别困难的聚类问题，任何现成的聚类算法都可能会很好地工作.如果您知道要多少个群集，请尝试k-means或k-medoid群集.如果您不知道有多少个群集，请尝试使用聚集群集.

This does not sound like a particularly difficult clustering problem, and any of the off-the-shelf clustering algorithm will probably work well. If you know how many clusters you want, then try k-means or k-medoid clustering. If you don't know how many clusters, then try agglomerative clustering.

问题的困难部分将是功能.您提到兴趣"可以用作要在其上进行聚类的特征，但是特征工程和选择始终会涉及一些反复试验.

The difficult part of the problem will be the features. You mentioned that 'interests' could be used as the features upon which to cluster, but feature engineering and selection will always involve some trial and error.