In community question-answering platforms, tags play essential roles in
effective information organization and retrieval, better question routing,
faster response to questions, and assessment of topic popularity. Hence,
automatic assistance for predicting and suggesting tags for posts is of high
utility to users of such platforms. To develop better tag prediction across
diverse communities and domains, we performed a thorough analysis of users'
tagging behavior in 17 StackExchange communities. We found various common
inherent properties of this behavior in those diverse domains. We used the
findings to develop a flexible neural tag prediction architecture, which
predicts both popular tags and more granular tags for each question. Our
extensive experiments and obtained performance show the effectiveness of our
model

通过分析 17 个 StackExchange 社区的用户标记行为，我们开发了一种灵活的神经网络标记预测体系结构，可以同时预测热门标签和更细致的标签，从而提高社区问答平台的信息检索效率。

基于社区问答平台用户问题标签行为分析的标签预测建模

Modeling Tag Prediction based on Question Tagging Behavior Analysis of  CommunityQA Platform Users

We present a semi-supervised learning algorithm for learning discrete factor
analysis models with arbitrary structure on the latent variables. Our algorithm
assumes that every latent variable has an "anchor", an observed variable with
only that latent variable as its parent. Given such anchors, we show that it is
possible to consistently recover moments of the latent variables and use these
moments to learn complete models. We also introduce a new technique for
improving the robustness of method-of-moment algorithms by optimizing over the
marginal polytope or its relaxations. We evaluate our algorithm using two
real-world tasks, tag prediction on questions from the Stack Overflow website
and medical diagnosis in an emergency department.

本研究介绍了一种用于学习任意结构的离散因子分析模型的半监督学习算法，该算法假定每个潜在变量都有 “锚”，即仅有该潜在变量作为其父变量的观测变量。在给定这些锚的情况下，可以恢复隐变量的矩，并利用这些矩来学习完整的模型。同时，我们还介绍了一种提高矩方法算法健壮性的新技术，即通过优化边际多面体或其松弛度。我们在 Stack Overflow 网站提问的标签预测和急诊科医学诊断两个实际任务中对我们的算法进行了评估。

锚定离散因子分析

Anchored Discrete Factor Analysis

Learning to predict multi-label outputs is challenging, but in many problems
there is a natural metric on the outputs that can be used to improve
predictions. In this paper we develop a loss function for multi-label learning,
based on the Wasserstein distance. The Wasserstein distance provides a natural
notion of dissimilarity for probability measures. Although optimizing with
respect to the exact Wasserstein distance is costly, recent work has described
a regularized approximation that is efficiently computed. We describe an
efficient learning algorithm based on this regularization, as well as a novel
extension of the Wasserstein distance from probability measures to unnormalized
measures. We also describe a statistical learning bound for the loss. The
Wasserstein loss can encourage smoothness of the predictions with respect to a
chosen metric on the output space. We demonstrate this property on a real-data
tag prediction problem, using the Yahoo Flickr Creative Commons dataset,
outperforming a baseline that doesn't use the metric.

本文提出了一个基于 Wasserstein 距离的多标签学习损失函数，基于概率度量体提供了一种自然的概念。该算法可以有效鼓励模型在输出空间中使用所选度量的平滑性，并用 Yahoo Flickr Creative Commons 数据集上的标签预测问题验证了性能。