跳到主要导航 跳到搜索 跳到主要内容

Social search with missing data: Which ranking algorithm?

  • Jianhan Zhu*
  • , Marc Eisenstadt
  • , Alexandre Gonçalves
  • , Chris Denham
  • , Victoria Uren
  • , Dawei Song
  • *此作品的通讯作者
  • Open University Milton Keynes
  • Stela Institute

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

Online social networking tools are extremely popular, but can miss potential discoveries latent in the social 'fabric'. Matchmaking services which can do naive profile matching with old database technology are too brittle in the absence of key data, and even modern ontological markup, though powerful, can be onerous at data-input time. In this paper, we present a system called BuddyFinder which can automatically identify buddies who can best match a user's search requirements specified in a term-based query, even in the absence of stored user-profiles. We deploy and compare five statistical measures, namely, our own CORDER, mutual information (MI), phi-squared, improved MI and Z score, and two TF/IDF based baseline methods to find online users who best match the search requirements based on 'inferred profiles' of these users in the form of scavenged web pages. These measures identify statistically significant relationships between online users and a term-based query. Our user evaluation on two groups of users shows that BuddyFinder can find users highly relevant to search queries, and that CORDER achieved the best average ranking correlations among all seven algorithms and improved the performance of both baseline methods.

源语言英语
页(从-至)249-261
页数13
期刊Journal of Digital Information Management
卷5
期5
出版状态已出版 - 10月 2007
已对外发布是

学术指纹

探究 'Social search with missing data: Which ranking algorithm?' 的科研主题。它们共同构成独一无二的学术指纹。

引用此