Patent partner recommendation in enterprise social networks

It is often challenging to incorporate users' interactions into a recommendation framework in an online model. In this paper, we propose a novel interactive learning framework to formulate the problem of recommending patent partners into a factor graph model. The framework involves three phases: 1) candidate generation, where we identify the potential set of collaborators; 2) candidate refinement, where a factor graph model is used to adjust the candidate rankings; 3) interactive learning method to efficiently update the existing recommendation model based on inventors' feedback. We evaluate our proposed model on large enterprise patent networks. Experimental results demonstrate that the recommendation accuracy of the proposed model significantly outperforms several baselines methods using content similarity, collaborative filtering and SVM-Rank. We also demonstrate the effectiveness and efficiency of the interactive learning, which performs almost as well as offline re-training, but with only 1 percent of the running time.

[1]  Ronald J. Mann,et al.  A New Look at Patent Quality: Relating Patent Prosecution to Validity , 2010 .

[2]  W. Freeman,et al.  Generalized Belief Propagation , 2000, NIPS.

[3]  Ruoming Jin,et al.  Topic level expertise search over heterogeneous networks , 2010, Machine Learning.

[4]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[5]  Eric Gilbert,et al.  Predicting tie strength with social media , 2009, CHI.

[6]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[7]  Andrew McCallum,et al.  Expertise modeling for matching papers with reviewers , 2007, KDD '07.

[8]  Hector Garcia-Molina,et al.  Collaborative Creation of Communal Hierarchical Taxonomies in Social Tagging Systems , 2006 .

[9]  Bo Gao,et al.  On optimization of expertise matching with various constraints , 2012, Neurocomputing.

[10]  Bo Gao,et al.  PatentMiner: topic-driven patent analysis and mining , 2012, KDD.

[11]  M. de Rijke,et al.  Formal models for expert finding in enterprise corpora , 2006, SIGIR.

[12]  Jie Tang,et al.  Inferring social ties across heterogenous networks , 2012, WSDM '12.

[13]  Abhinandan Das,et al.  Google news personalization: scalable online collaborative filtering , 2007, WWW '07.

[14]  D. Sculley,et al.  Combined regression and ranking , 2010, KDD.

[15]  X. Jin Factor graphs and the Sum-Product Algorithm , 2002 .

[16]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[17]  David Ye,et al.  A large scale machine learning system for recommending heterogeneous content in social networks , 2011, SIGIR '11.

[18]  Yossi Matias,et al.  Suggesting friends using the implicit social graph , 2010, KDD.

[19]  Jimeng Sun,et al.  Cross-domain collaboration recommendation , 2012, KDD.

[20]  Theodoros Lappas,et al.  Finding a team of experts in social networks , 2009, KDD.

[21]  Li Chen,et al.  Factorization vs. regularization: fusing heterogeneous social relationships in top-n recommendation , 2011, RecSys '11.

[22]  Bart Selman,et al.  Referral Web: combining social networks and collaborative filtering , 1997, CACM.

[23]  Thorsten Joachims,et al.  Making large scale SVM learning practical , 1998 .

[24]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[25]  Jure Leskovec,et al.  Supervised random walks: predicting and recommending links in social networks , 2010, WSDM '11.

[26]  Juan-Zi Li,et al.  Expert Finding in a Social Network , 2007, DASFAA.

[27]  Xin Jin,et al.  Patent Maintenance Recommendation with Patent Information Network Model , 2011, 2011 IEEE 11th International Conference on Data Mining.

[28]  Yuen-Hsien Tseng,et al.  Text mining techniques for patent analysis , 2007, Inf. Process. Manag..

[29]  Jie Tang,et al.  Who will follow you back?: reciprocal relationship prediction , 2011, CIKM '11.

[30]  Yan Liu,et al.  Latent graphical models for quantifying and predicting patent quality , 2011, KDD.

[31]  J. M. Hammersley,et al.  Markov fields on finite graphs and lattices , 1971 .

[32]  Dan Cosley,et al.  Inferring social ties from geographic coincidences , 2010, Proceedings of the National Academy of Sciences.