skip to main content
10.1145/2766462.2767767acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
short-paper

I See You: Person-of-Interest Search in Social Networks

Published:09 August 2015Publication History

ABSTRACT

Searching for a particular person by specifying her name is one of the essential functions in online social networking services such as Facebook. So many times, however, one would like to find a person but what she knows is few social labels about the target, such as interests, skills, hometown, school, employment, etc. Assume each user is associated a set of social labels, we propose a novel search in online social network, Person-of-Interest (POI) Search, which aims to find a list of desired targets based on a set of user-specified query labels that depict the targets. We develop a greedy heuristic graph search algorithm, which finds the target who not only covers the query labels, but also either possesses better social interactions with peers or has higher social proximity towards the user. Experiments conducted on Facebook and Twitter datasets exhibit the satisfying accuracy and encourage more advanced efforts on POI search.

References

  1. S. Bao, G. Xue, X. Wu, Y. Yu, B. Fei, and Z. Su. Optimizing web search using social annotations. In WWW, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S.-W. Huang, D. Tunkelang, and K. Karahalios. The role of network distance in linkedin people search. In SIGIR, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Kleinberg. Social networks, incentives, and search. In SIGIR, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. McAuley and J. Leskovec. Learning to discover social circles in ego networks. In NIPS, 2012.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. K. Mouratidis, J. Li, Y. Tang, and N. Mamoulis. Joint search by social and spatial proximity. In IEEE TKDE, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  6. M. Roth, A. Ben-David, D. Deutscher, G. Flysher, I. Horn, A. Leichtberg, N. Leiser, Y. Matias, and R. Merom. Suggesting friends using the implicit social graph. In KDD, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Schenkel, T. Crecelius, M. Kacimi, S. Michel, T. Neumann, and G. Weikum. Efficient top-k querying over social-tagging networks. In SIGIR, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. N. V. Spirin, J. He, M. Develin, K. G. Karahalios, and M. Boucher. People search within an online social network: Large scale analysis of facebook graph search query logs. In CIKM, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. H. Tong and C. Faloutsos. Center-piece subgraph: Problem definition and fast solutions. In KDD, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Tong, C. Faloutsos, and J.-Y. Pan. Fast random walk with restart and its applications. In ICDM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. V. Vieira, B. M. Fonseca, R. Damazio, P. B. Golgher, D. D. C. Reis, and B. Ribeiro-Neto. Efficient search ranking in social networks. In CIKM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Y. Yanbe, A. Jatowt, S. Nakamura, and K. Tanaka. Can social bookmarking enhance search in the web. In JCDL, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. I See You: Person-of-Interest Search in Social Networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGIR '15: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval
      August 2015
      1198 pages
      ISBN:9781450336215
      DOI:10.1145/2766462

      Copyright © 2015 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 9 August 2015

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • short-paper

      Acceptance Rates

      SIGIR '15 Paper Acceptance Rate70of351submissions,20%Overall Acceptance Rate792of3,983submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader