Graph-based ranking algorithms for e-mail expertise analysis
Graph-based ranking algorithms for e-mail expertise analysis
复制标题
DOI：
10.1145/882082.882093
复制
发表时间：
2003-06
期刊：
影响因子：
--
通讯作者：
B. Dom;Iris Eiron;Alex Cozzi;Yi Zhang
中科院分区：
文献类型：
--
作者：
B. Dom;Iris Eiron;Alex Cozzi;Yi Zhang
在本文中，我们研究了基于图表的排名措施，目的是使用它们根据他们对感兴趣的主题的专业程度对电子邮件通讯员进行排名。虽然这个完整的专业知识分析由几个步骤组成，但在本文中，我们重点分析有向图，其节点对应于通讯员（人），其边缘对应于他们连接的节点对应的人之间存在电子邮件通信，其边缘方向指向相对专业知识估计较高的对中的成员。我们对合成数据和真实数据进行了分析，并引入了一种新的误差度量来比较排名。
In this paper we study graph--based ranking measures for the purpose of using them to rank email correspondents according to their degree of expertise on subjects of interest. While this complete expertise analysis consists of several steps, in this paper we focus on the analysis of digraphs whose nodes correspond to correspondents (people), whose edges correspond to the existence of email correspondence between the people corresponding to the nodes they connect and whose edge directions point from the member of the pair whose relative expertise has been estimated to be higher. We perform our analysis on both synthetic and real data and we introduce a new error measure for comparing ranked lists.