Learning to Rank in Entity Relationship Graphs

References

• Adomavicius G, Tuzhilin A (2015) Context-aware recommender systems. Ricci F, Rokach L, Shapira B, eds. Recommender Systems Handbook, 2nd ed. (Springer, Boston), 191–226.Google Scholar
• Bahmani B, Chakrabarti K, Xin D (2011) Fast Personalized PageRank on MapReduce (ACM, New York).Crossref, Google Scholar
• Bahmani B, Chowdhury A, Goel A (2010) Fast incremental and personalized PageRank. Proc. VLDB Endow. 4(3):173–184.Crossref, Google Scholar
• Balmin A, Hristidis V, Papakonstantinou Y (2004) Objectrank: Authority-based keyword search in databases. Proc. 2004 VLDB Conf. (Morgan Kaufmann, St. Louis), 564–575.Google Scholar
• Baltrunas L, Ludwig B, Ricci F (2011) Matrix factorization techniques for context aware recommendation. Proc. 5th ACM Conf. Recommender Systems (RecSys’11) (ACM, New York), 301–304.Crossref, Google Scholar
• Burges C, et al.. (2005) Learning to rank using gradient descent, Proc. 22nd Internat. Conf. Machine Learn. (ICML’05), J. Machine Learn. Res. 89–96.Crossref, Google Scholar
• Burton K, Java A, Soboroff I (2009) The icwsm 2009 spinn3r dataset. Proc. Conf. Weblogs Social Media (ICWSM'09) (Association for the Advancement of Artificial Intelligence, Palo Alto, CA).Google Scholar
• Cao Z, Liu T (2007) Learning to rank: From pairwise approach to listwise approach. Proc. 24th Internat. Conf. Machine Learn., J. Machine Learn. Res., 129–136.Crossref, Google Scholar
• Chakrabarti S (2007) Dynamic personalized pagerank in entity-relation graphs. Proc. 16th Internat. Conf. World Wide Web (WWW’07) (ACM, New York), 571–580.Crossref, Google Scholar
• Chakrabarti S, Agarwal A (2006) Learning parameters in entity relationship graphs from ranking preferences. Eur. Conf. Machine Learn. Principles Practice Knowledge Discovery Databases (Springer, Berlin), 91–102.Crossref, Google Scholar
• Cooley R, Mobasher B, Srivastava J (1999) Data preparation for mining world wide web browsing patterns. Knowledge Inform. Systems 1(1):5–32.Crossref, Google Scholar
• Cortes C, Mohri M, Rastogi A (2007) Magnitude-preserving ranking algorithms. Proc. 24th Internat. Conf. Machine Learn. (ICML’07) (ACM, New York), 169–176,Crossref, Google Scholar
• Croft B, Metzler D, Strohman T (2009) Search Engines: Information Retrieval in Practice, 1st ed. (Addison-Wesley Publishing Company, Boston).Google Scholar
• Deng W, Ma J (2017) Leveraging heterogeneous information network for community recommendation. Proc. Internat. Conf. Inform. Systems (Association of Information Systems, Atlanta)Google Scholar
• Fakas G, Cai Z, Mamoulis N (2014) Versatile size- object summaries for relational keyword search. IEEE Trans. Knowledge Data Engrg. 26(4):1026–1038.Crossref, Google Scholar
• Fakas G, Cai Z, Mamoulis N (2015) Diverse and proportional size-l object summaries for keyword search. Proc. 2015 ACM SIGMOD Internat. Conf. Management Data (ACM, New York), 363–375.Crossref, Google Scholar
• Fakas G, Cai Z, Mamoulis N (2016) Diverse and proportional size-l object summaries using pairwise relevance. VLDB J. 25(6):791–816.Crossref, Google Scholar
• Fogaras D, Rácz B, Csalogány K, Sarlós T (2005) Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Math. 2(3):333–358.Crossref, Google Scholar
• Gao J, Qi H, Xia X, yun Nie J (2005) Linear discriminant model for information retrieval. Proc. 28th Internat. ACM SIGIR Conf. (ACM, New York), 290–297.Crossref, Google Scholar
• Geerts F, Mannila H, Terzi E (2004) Relational link-based ranking. Proc. 2004 VLDB Conf. (Morgan Kaufmann, St. Louis), 552–563.Crossref, Google Scholar
• Getoor L, Taskar B (2007) Introduction to statistical relational learning. Adaptive Computation and Machine Learning (MIT Press, Cambridge, MA).Crossref, Google Scholar
• Haveliwala T (2002) Topic-sensitive pagerank. Proc. 11th Internat. Conf. World Wide Web (WWW’02) (ACM, New York).Crossref, Google Scholar
• Hristidis V, Hwang H, Papakonstantinou Y (2008) Authority-based keyword search in databases. ACM Trans. Database System 33(1):1–40.Crossref, Google Scholar
• Hristidis V, Wu Y, Raschid L (2014) Efficient ranking on entity graphswith personalized relationships. IEEE Trans. Knowledge Data Engrg. 26(4):850–863.Crossref, Google Scholar
• Hwang H, Balmin A, Reinwald B, Nijkamp E (2009) Binrank: Scaling dynamic authority-based search using materialized subgraphs. Proc. Internat. Conf. Data Engrg. (IEEE, Piscataway, NJ) 66–77.Crossref, Google Scholar
• Jeh G, Widom J (2003) Scaling personalized web search. Proc. 12th Internat. Conf. World Wide Web (WWW’03) (ACM, New York), 271–279.Crossref, Google Scholar
• Ji M, Han J, Danilevsky M (2011) Ranking-based classification of heterogeneous information networks. Proc. 17th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 1298–1306.Crossref, Google Scholar
• Kashyap A, Hristidis V (2012) Logrank: Summarizing social activity logs. WebDB (ACM, New York), 1–6.Google Scholar
• KDD Cup 2003 (2016) Datasets. http://www.cs.cornell.edu/projects/kddcup/datasets.html.Google Scholar
• Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J. ACM 46(5):604–632.Crossref, Google Scholar
• Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30–37.Crossref, Google Scholar
• Kritikopoulos A, Sideri M (2003) The compass filter: Search engine result personalization using web communities. Mobasher B, Anand SS, eds. Intelligent Techniques for Web Personalization: IJCAI 2003 Workshop, ITWP 2003, Acapulco, Mexico, August 11, 2003, Revised Selected Papers, Lecture Notes in Computer Science, vol. 3169 (Springer, Berlin), 229–240.Google Scholar
• Lao N, Cohen WW (2010) Relational retrieval using a combination of path-constrained random walks. Machine Learn. 81(1):53–67.Crossref, Google Scholar
• Li P, Burges C, Wu Q (2007) Mcrank: Learning to rank using multiple classification and gradient boosting. Platt JC, Koller D, Singer Y, Roweis ST, eds. Advances in Neural Information Processing Systems, vol. 20 (Morgan Kauffman, San Francisco).Crossref, Google Scholar
• Liu Y, Fu Y (2007) Automatic search engine performance evaluation with click-through data analysis. Proc. 16th Internat. Conf. World Wide Web (WWW'07) (ACM, New York).Crossref, Google Scholar
• Manning C, Raghavan P, Schutze H (2008) Introduction to Information Retrieval (Cambridge University Press, New York).Crossref, Google Scholar
• Mobasher B, Cooley R, Srivastava J (2000) Automatic personalization based on web usage mining. Commun. ACM 43(8):142–151.Crossref, Google Scholar
• Nallapati R (2004) Discriminative models for information retrieval. Proc. 27th Annual Internat. Conf. Res. Development Inform. Retrieval (SIGIR’04) (ACM, New York), 64–71.Crossref, Google Scholar
• Nie Z, Zhang Y, Wen JR, Ma WY (2005) Object-level ranking: Bringing order to web objects. Proc. 14th Internat. Conf. World Wide Web (WWW’05) (ACM, New York), 567–574.Crossref, Google Scholar
• Page L, Brin S, Motwani R, Winograd T (1998) The pagerank citation ranking: Bringing order to the web. Stanford Technical Report, Stanford University, Palo Alto, CA.Google Scholar
• Prawesh S, Padmanabhan B (2012) Probabilistic news recommender systems with feedback. Proc. 6th ACM Conf. Recommender Systems (RecSys’12) (ACM, New York), 257–260.Crossref, Google Scholar
• Resnick P, Iacovou N, Suchak M, Bergstrom P, Riedl J (1994) Grouplens: An open architecture for collaborative filtering of netnews. Proc. 1994 ACM Conf. Comput. Supported Cooperative Work (CSCW’94) (ACM, New York), 175–186.Crossref, Google Scholar
• Salton G, Wong A, Yang C (1975) A vector space model for automatic indexing. Commun. ACM 18(11):613–620.Crossref, Google Scholar
• Sayyadi H, Getoor L (2009) Future rank: Ranking scientific articles by predicting their future pagerank. 2009 SIAM Internat. Conf. Data Mining (SDM'09) (SIAM, Philadelphia).Crossref, Google Scholar
• Schloss Dagstuhl - Leibniz Center for Informatics and University of Trier (2017) DBLP Computer Science Bibliography. https://dblp.uni-trier.de/.Google Scholar
• Sen P, Namata GM, Bilgic M, Getoor L, Gallagher B, Eliassi-Rad T (2008) Collective classification in network data. AI Magazine 29(3):93–106.Crossref, Google Scholar
• Shi C, Li Y, Zhang J, Sun Y, Yu P (2017) A survey of heterogeneous information network analysis. IEEE Trans. Knowledge Data Engrg. 29(1):17–37.Crossref, Google Scholar
• Spiliopoulou M, Faulstich LC (1999) WUM: A tool for web utilization analysis. The World Wide Web and Databases International Workshop WebDB'98, Valencia, Spain, March 27–28, 1998. Selected Papers, Lecture Notes in Computer Science, vol. 1590 (Springer, Berlin), 184–203.Google Scholar
• Sugiyama K, Hatano K, Yoshikawa M (2004) Adaptive web search based on user profile constructed without any effort from users. Proc. 13th Conf. World Wide Web (WWW ’04) (ACM, New York), 675–684.Crossref, Google Scholar
• Sun Y, Han J (2012a) Mining heterogeneous information networks: A structural analysis approach. SigKDD Explorations 14(2):20.Crossref, Google Scholar
• Sun Y, Han J (2012b) Mining Heterogeneous Information Networks: Principles and Methodologies (Morgan & Claypool, San Rafael, CA), 1–159.Crossref, Google Scholar
• Sun Y, Norick B, Yan JHX, Yu P, Yu X (2012) Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. Proc. 18th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 1348–1356.Crossref, Google Scholar
• Sun Y, Yu Y, Han J (2009) Ranking-based clustering of heterogeneous information networks with star network schema. Proc. 15th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 797–806.Crossref, Google Scholar
• Symeonidis P (2016) Matrix and tensor decomposition in recommender systems. Proc. 10th ACM Conf. Recommender Systems (RecSys ’16) (ACM, New York), 429–430.Crossref, Google Scholar
• Taskar B, fai Wong M, Abbeel P, Koller D (2003) Link prediction in relational data. Thrun S, Saul LK, Schölkopf B, eds. Advances in Neural Information Processing Systems, vol. 16 (Morgan Kauffman, San Francisco).Google Scholar
• Teevan J, Dumais ST, Horvitz E (2005) Personalizing search via automated analysis of interests and activities. Proc. 28th Annual Internat. ACM SIGIR Conf. Res. Dev. Inform. Retrieval (SIGIR’05) (ACM, New York).Crossref, Google Scholar
• Varadarajan R, Hristidis V, Raschid L (2008) Explaining and reformulating authority flow queries. IEEE 24th Internat. Conf. Data Engrg. (IEEE, Piscataway, NJ) 883–892.Crossref, Google Scholar
• Xia F, Liu T, Wang J, Zhang W, Li H (2008) Listwise approach to learning to rank: Theory and algorithm. Internat. Conf. Machine Learn., J. Machine Learn. Res., 1192–1199.Crossref, Google Scholar
• Yedidia J (2011) Message-passing algorithms for inference and optimization. J. Statist. Phys. 145(4):860–890.Crossref, Google Scholar
• Yu X, Ren X, Sun Y, Gu Q, Sturt B, Khandelwal U, Norick B, Han J (2014) Personalized entity recommendation: A heterogeneous information network approach. Proc. 7th ACM Conf. Web Search Data Mining (ACM, New York).Crossref, Google Scholar
• Zeng X, Li Y, Leung S, Lin Z, Liu X (2016) Investment behavior prediction in heterogeneous information network. Neurocomputing 217:125–132.Crossref, Google Scholar
• Zhao H, Yao Q, Li J, Song Y, Lee DL (2017) Meta-graph based recommendation fusion over heterogeneous information networks. Proc. ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York).Crossref, Google Scholar
• Zheng Z, Zha H, Zhang T, Chapelle O, Chen K, Sun G (2008) A general boosting method and its application to learning ranking functions for web search. Platt JC, Koller D, Singer Y, Roweis ST, eds. Advances in Neural Information Processing Systems, vol. 20 (Morgan Kauffman, San Francisco), 1697–1704.Google Scholar
• Zhou D, Orshanskiy SA, Zha H, Giles CL (2007) Co-ranking authors and documents in a heterogeneous network. 7th IEEE Internat. Conf. Data Mining (ICDM 2007) (IEEE, Piscataway, NJ).Crossref, Google Scholar