如何提供多因素加权排序最相关的结果因素、结果

2023-09-11 00:25:51 作者:一城荒芜、一世疏离

我需要提供一个加权排序上2+因素,下令相关性。然而,因素不完全隔离,​​在我想要一个影响紧迫性的因素或多个其它的(重量)

I need to provide a weighted sort on 2+ factors, ordered by "relevancy". However, the factors aren't completely isolated, in that I want one or more of the factors to affect the "urgency" (weight) of the others.

例如:所提供的内容(文章的),可以向上/向下投,因而有评级;他们有一个发布日期,而且他们也标记类别。用户写的文章,可以投票,并且可以或可以不具有某种排名本身(专家等)。大概类似于计算器,对吧?

Example: contributed content (articles) can be up-/down-voted, and thus have a rating; they have a post date, and they're also tagged with categories. Users write the articles and can vote, and may or may not have some kind of ranking themselves (expert, etc). Probably similar to StackOverflow, right?

我想提供与由标签分组的文章的列表中的每个用户,但依关联,其中的关联的是基于计算在制品的等级和年龄,以及可能受排名的作者。 I.E.这是写了几年前一个高排名的文章未必是有关为昨天的书面媒体排名的文章。也许如果一篇文章的作者是一个专家,将被视为超过一写乔Schmoe。

I want to provide each user with a list of articles grouped by tag but sorted by "relevancy", where relevancy is calculated based on the rating and age of the article, and possibly affected by the ranking of the author. I.E. a highly ranked article that was written several years ago may not necessarily be as relevant as a medium ranked article written yesterday. And maybe if an article was written by an expert it would be treated as more relevant than one written by "Joe Schmoe".

另一个很好的例子是指定酒店元分由价格,评级,和旅游景点。

我的问题是,什么是多因素排序最好的算法?这可能是这个问题,但我对任何数量的因素(一更合理的预期是2 - 4因素)感兴趣的一个通用的算法,preferably一个我没有扭捏或需要用户输入,而我无法解析线性代数和特征向量的古怪全自动功能。

My question is, what is the best algorithm for multiple factor sorting? This may be a duplicate of that question, but I'm interested in a generic algorithm for any number of factors (a more reasonable expectation is 2 - 4 factors), preferably a "fully-automatic" function that I don't have to tweak or require user input, and I can't parse linear algebra and eigenvector wackiness.

可能性,我发现迄今:

注:取值是排序分数的

Note: S is the "sorting score"

线性加权 - 使用功能,如: S =(W 1 *˚F 1 )+ (W 2 *˚F 2 )+(W 3 *˚F 3 ) ,其中是W X 是任意分配的权重,而 F X 的因素的值。你也希望要正常化 F (即 F x_n = F X /˚F 最大 )。我认为这是有点儿如何 Lucene搜索工作 基地-N加权 - 更像是一个比加权分组,这其中权重不断增加以10的倍数(类似的原理的