On the most representative summaries of network user activities

详细信息    查看全文

• 作者：Joshua Stein^a ; ^{jgs@cs.uoregon.edu}Author Vitae ; Han Hee Song^b ; ^{hanhsong@cisco.com}Author Vitae ; Mario Baldi ; ^b ; ^c ; ^{mario.baldi@polito.it}Author Vitae ; Jun Li^a ; ^{lijun@cs.uoregon.edu}Author Vitae
• 关键词：Network user activities ; User interest discovery ; Interest summarization
• 刊名：Computer Networks
• 出版年：2017
• 出版时间：11 February 2017
• 年：2017
• 卷：113
• 期：Complete
• 页码：205-217
• 全文大小：981 K
• 卷排序：113

文摘

A summary of a user’s Internet activities, such as web visitations, can provide information that closely reflects their interests and preferences. However, automating the summarization process is not trivial as the summary should strike a good balance between generality and specificity, while there is no gold standard for doing so.In our approach to summarizing user information, dubbed SUM, we develop two scoring mechanisms that cooperatively optimize for polarizing criteria. After mapping user activity information onto a category tree, the scoring mechanisms highlight the most representative tree node (or summary); the node provides an aggregated view of the activities most characteristic of the user. We evaluate our approach by using web activity on the network of a large Cellular Service Provider and summarizing it to devise interests of individual users as well as groups. We compare SUM against an algorithm that discovers Hierarchical Heavy Hitter and show that SUM uncovers previously unknown information about users.