[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3240323.3241610acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
demonstration
Public Access

Extra: explaining team recommendation in networks

Published: 27 September 2018 Publication History

Abstract

State-of-the-art in network science of teams offers effective recommendation methods to answer questions like who is the best replacement, what is the best team expansion strategy, but lacks intuitive ways to explain why the optimization algorithm gives the specific recommendation for a given team optimization scenario. To tackle this problem, we develop an interactive prototype system, Extra, as the first step towards addressing such a sense-making challenge, through the lens of the underlying network where teams embed, to explain the team recommendation results. The main advantages are (1) Algorithm efficacy: we propose an effective and fast algorithm to explain random walk graph kernel, the central technique for networked team recommendation; (2) Intuitive visual explanation: we present intuitive visual analysis of the recommendation results, which can help users better understand the rationality of the underlying team recommendation algorithm.

References

[1]
Karsten M Borgwardt, Cheng Soon Ong, Stefan Schönauer, SVN Vishwanathan, Alex J Smola, and Hans-Peter Kriegel. 2005. Protein function prediction via graph kernels. Bioinformatics 21, suppl_1 (2005), i47--i56.
[2]
Karsten M Borgwardt, Nicol N Schraudolph, and SVN Vishwanathan. 2007. Fast computation of graph kernels. In NIPS. 1449--1456.
[3]
Liangyue Li, Hanghang Tong, Nan Cao, Kate Ehrlich, Yu-Ru Lin, and Norbou Buchler. 2015. Replacing the irreplaceable: Fast algorithms for team member recommendation. In WWW. International World Wide Web Conferences Steering Committee, 636--646.
[4]
Liangyue Li, Hanghang Tong, Nan Cao, Kate Ehrlich, Yu-Ru Lin, and Norbou Buchler. 2017. Enhancing team composition in professional networks: Problem definitions and fast solutions. TKDE 29, 3 (2017), 613--626.

Cited By

View all
  • (2019)Academic Team Formulation Based on Liebig’s Barrel: Discovery of Anticask EffectIEEE Transactions on Computational Social Systems10.1109/TCSS.2019.29134606:5(1083-1094)Online publication date: Oct-2019
  • (2019)ADMIRING: Adversarial Multi-network Mining2019 IEEE International Conference on Data Mining (ICDM)10.1109/ICDM.2019.00201(1522-1527)Online publication date: Nov-2019

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
RecSys '18: Proceedings of the 12th ACM Conference on Recommender Systems
September 2018
600 pages
ISBN:9781450359016
DOI:10.1145/3240323
Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 September 2018

Check for updates

Author Tags

  1. random walk graph kernel
  2. team recommendation explanation
  3. visualization

Qualifiers

  • Demonstration

Funding Sources

Conference

RecSys '18
Sponsor:
RecSys '18: Twelfth ACM Conference on Recommender Systems
October 2, 2018
British Columbia, Vancouver, Canada

Acceptance Rates

RecSys '18 Paper Acceptance Rate 32 of 181 submissions, 18%;
Overall Acceptance Rate 254 of 1,295 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)62
  • Downloads (Last 6 weeks)16
Reflects downloads up to 07 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2019)Academic Team Formulation Based on Liebig’s Barrel: Discovery of Anticask EffectIEEE Transactions on Computational Social Systems10.1109/TCSS.2019.29134606:5(1083-1094)Online publication date: Oct-2019
  • (2019)ADMIRING: Adversarial Multi-network Mining2019 IEEE International Conference on Data Mining (ICDM)10.1109/ICDM.2019.00201(1522-1527)Online publication date: Nov-2019

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media