Skip to main content

Bring User Interest to Related Entity Recommendation

  • Conference paper
  • First Online:
Graph Structures for Knowledge Representation and Reasoning (GKR 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9501))

  • 562 Accesses

Abstract

Most existing approaches to query recommendation focus on query-term or click based analysis over the user session log or click-through data. For entity query, however, finding the relevant queries from these resources is far from trivial. Entity query is a special kind of short queries that commonly appear in image search, video search or object search. Focusing on related entity recommendation, this paper proposes to collect rich related entities of interest from a large number of entity-oriented web pages. During the collection, we maintain a large-scale and general-purpose related entity network (REN), based upon a special co-occurrence relation between the related entity and target entity. Benefiting from the REN, we can easily incorporate various types of related entity into recommendation. Different ranking methods are employed to recommend related and diverse entities of interest. Extensive experiments are conducted to assess the recommendation performance in term of Accuracy and Serendipity. Experimental results show that the REN is a good recommendation resource with high quality of related entities. For recommending related entity, the proposed REN-based method achieves good performance compared with a state-of-the-art relatedness measurement and two famous recommendation systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://www.movies.com/amazing-spider-man-2/m68476.

  2. 2.

    The co-occurrence relation limits one of the two entities to be in the title while the other appears in the body text of the same article.

  3. 3.

    http://wikipedia-miner.sourceforge.net.

  4. 4.

    This work uses enwiki dump progress on 20130503.

  5. 5.

    Probase data is publicly available at http://probase.msra.cn/dataset.aspx.

  6. 6.

    This work uses enwiki dump progress on 20130503.

References

  1. Baeza-Yates, R., Hurtado, C.A., Mendoza, M.: Query recommendation using query logs in search engines. In: Lindner, W., Fischer, F., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol. 3268, pp. 588–596. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Beeferman, D., Berger, A.: Agglomerative clustering of a search engine query log. In: SIGKDD, pp. 407–416. ACM (2000)

    Google Scholar 

  3. Boldi, P., Bonchi, F., Castillo, C., Donato, D., Gionis, A., Vigna, S.: The query-flow graph: model and applications. In: CIKM, pp. 609–618. ACM (2008)

    Google Scholar 

  4. Bollacker, K., Evans, C., Paritosh, P., Sturge, T., Taylor, J.: Freebase: a collaboratively created graph database for structuring human knowledge. In: SIGMOD, pp. 1247–1250. ACM (2008)

    Google Scholar 

  5. Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1), 107–117 (1998)

    Article  Google Scholar 

  6. Cao, H., Jiang, D., Pei, J., He, Q., Liao, Z., Chen, E., Li, H.: Context-aware query suggestion by mining click-through and session data. In: SIGKDD, pp. 875–883. ACM (2008)

    Google Scholar 

  7. Dalvi, N., Kumar, R., Soliman, M.: Automatic wrappers for large scale web extraction. VLDB 4(4), 219–230 (2011)

    Google Scholar 

  8. Dang, V., Croft, W.B.: Diversity by proportionality: an election-based approach to search result diversification. In: SIGIR, pp. 65–74. ACM (2012)

    Google Scholar 

  9. Ge, M., Delgado-Battenfeld, C., Jannach, D.: Beyond accuracy: evaluating recommender systems by coverage and serendipity. In: RecSys, pp. 257–260. ACM (2010)

    Google Scholar 

  10. He, J., Hollink, V., de Vries, A.: Combining implicit and explicit topic representations for result diversification. In: SIGIR, pp. 851–860. ACM (2012)

    Google Scholar 

  11. He, Q., Jiang, D., Liao, Z., Hoi, S.C., Chang, K., Lim, E.-P., Li, H.: Web query recommendation via sequential query prediction. In: ICDE, pp. 1443–1454. IEEE (2009)

    Google Scholar 

  12. Huang, C.-K., Chien, L.-F., Oyang, Y.-J.: Relevant term suggestion in interactive web search based on contextual information in query session logs. JASIST 54(7), 638–649 (2003)

    Article  Google Scholar 

  13. Joachims, T.: Training linear svms in linear time. In: KDD, pp. 217–226. ACM (2006)

    Google Scholar 

  14. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. JACM 46(5), 604–632 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lee, S., Song, S.-I., Kahng, M., Lee, D., Lee, S.-G.: Random walk based entity ranking on graph for multidimensional recommendation. In: RecSys, pp. 93–100. ACM (2011)

    Google Scholar 

  16. Li, R. Kao, B., Bi, B., Cheng, R., Lo, E.: Dqr: a probabilistic approach to diversified query recommendation. In: CIKM, pp. 16–25. ACM (2012)

    Google Scholar 

  17. Milne, D., Witten, I.H.: An open-source toolkit for mining wikipedia. Artif. Intell. 194, 222–239 (2013)

    Article  MathSciNet  Google Scholar 

  18. Nie, Z., Wen, J.-R., Ma, W.-Y.: Object-level vertical search. In: CIDR, pp. 235–246 (2007)

    Google Scholar 

  19. Szpektor, I., Gionis, A., Maarek, Y.: Improving recommendation for long-tail queries via templates. In: WWW, pp. 47–56. ACM (2011)

    Google Scholar 

  20. Vahabi, H., Ackerman, M., Loker, D., Baeza-Yates, R., Lopez-Ortiz, A.: Orthogonal query recommendation. In: RecSys, pp. 33–40. ACM (2013)

    Google Scholar 

  21. Vargas, S., Castells, P.: Rank and relevance in novelty and diversity metrics for recommender systems. In: RecSys, pp. 109–116. ACM (2011)

    Google Scholar 

  22. Wen, J.-R., Nie, J.-Y., Zhang, H.-J.: Clustering user queries of a search engine. In: WWW, pp. 162–168. ACM (2001)

    Google Scholar 

  23. Wu, W., Li, H., Haixun, W., Zhu, K.Q.: Probase: a probabilistic taxonomy for text understanding. In: SIGMOD, pp. 481–492. ACM (2012)

    Google Scholar 

  24. Zhang, Z., Nasraoui, O.: Mining search engine query logs for query recommendation. In: WWW, pp. 1039–1040. ACM (2006)

    Google Scholar 

Download references

Acknowledgments

This work was partially supported by the National Key Basic Research Program (973 Program) of China under grant No. 2014CB340403 and the Fundamental Research Funds for the Central Universities & the Research Funds of Renmin University of China. This work was also supported in part by NSFC (Nos. 61170189, 61370126, 61202239), National High Technology Research and Development Program of China under grant No.2015AA016004, the Fund of the State Key Laboratory of Software Development Environment (No. SKLSDE-2015ZX-16), and Microsoft Research Asia Fund (No. FY14-RES-OPP-105).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhongyuan Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Wang, Z., Wang, F., Wen, JR., Li, Z. (2015). Bring User Interest to Related Entity Recommendation. In: Croitoru, M., Marquis, P., Rudolph, S., Stapleton, G. (eds) Graph Structures for Knowledge Representation and Reasoning. GKR 2015. Lecture Notes in Computer Science(), vol 9501. Springer, Cham. https://doi.org/10.1007/978-3-319-28702-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28702-7_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28701-0

  • Online ISBN: 978-3-319-28702-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics