Skip to main content

Subtopic Mining via Modifier Graph Clustering

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2014)

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

Included in the following conference series:

Abstract

Understanding the information need encoded in a user query has long been regarded as a crucial step of effective information retrieval. In this paper, we focus on subtopic mining that aims at generating a ranked list of subtopic strings for a given topic. We propose the modifier graph based approach, under which the problem of subtopic mining reduces to that of graph clustering over the modifier graph. Compared with the existing methods, the experimental results show that our modifier-graph based approaches are robust to the sparseness problem. In particular, our approaches that perform subtopic mining at a fine-grained term-level outperform the baseline methods that perform subtopic mining at a whole query-level in terms of I-rec, D-nDCG and D#-nDCG.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Gollapudi, S., Halverson, A., Ieong, S.: Diversifying search results. In: Proceedings of the 2nd WSDM, pp. 5–14 (2009)

    Google Scholar 

  2. Beeferman, D., Berger, A.: Agglomerative clustering of a search engine query log. In: Proceedings of the 6th KDD, pp. 407–416 (2000)

    Google Scholar 

  3. Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics (2008)

    Google Scholar 

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

    Google Scholar 

  5. Bonchi, F., Perego, R., Silvestri, F., Vahabi, H., Venturini, R.: Recommendations for the long tail by term-query graph. In: Proceedings of the 20th WWW, pp. 15–16 (2011)

    Google Scholar 

  6. Bonchi, F., Perego, R., Silvestri, F., Vahabi, H., Venturini, R.: Efficient query recommendations in the long tail via center-piece subgraphs. In: Proceedings of the 35th SIGIR, pp. 345–354 (2012)

    Google Scholar 

  7. Cao, B., Sun, J.T., Xiang, E.W., Hu, D.H., Yang, Q., Chen, Z.: PQC: personalized query classification. In: Proceedings of the 18th CIKM, pp. 1217–1226 (2009)

    Google Scholar 

  8. Carbonell, J., Goldstein, J.: The use of mmr, diversity-based reranking for reordering documents and producing summaries. In: Proceedings of the 21st SIGIR, pp. 335–336 (1998)

    Google Scholar 

  9. Deng, H., King, I., Lyu, M.R.: Entropy-biased models for query representation on the click graph. In: Proceedings of the 32nd SIGIR, pp. 339–346 (2009)

    Google Scholar 

  10. Hu, Y., Qian, Y., Li, H., Jiang, D., Pei, J., Zheng, Q.: Mining query subtopics from search log data. In: Proceedings of the 35th SIGIR, pp. 305–314 (2012)

    Google Scholar 

  11. Jones, R., Klinkner, K.L.: Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs. In: Proceedings of the 17th CIKM, pp. 699–708 (2008)

    Google Scholar 

  12. Noack, A.: Energy models for graph clustering. Journal of Graph Algorithms and Applications 11(2), 453–480 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Radlinski, F., Dumais, S.: Improving personalized web search using result diversification. In: Proceedings of the 29th SIGIR, pp. 691–692 (2006)

    Google Scholar 

  14. Radlinski, F., Szummer, M., Craswell, N.: Inferring query intent from reformulations and clicks. In: Proceedings of the 19th WWW, pp. 1171–1172 (2010)

    Google Scholar 

  15. Ren, F., Sohrab, M.G.: Class-indexing-based term weighting for automatic text classification. Information Sciences 236, 109–125 (2013)

    Article  Google Scholar 

  16. Sadikov, E., Madhavan, J., Wang, L., Halevy, A.: Clustering query refinements by user intent. In: Proceedings of the 19th WWW, pp. 841–850 (2010)

    Google Scholar 

  17. Sakai, T., Dou, Z., Yamamoto, T., Liu, Y., Zhang, M., Song, R.: Overview of the NTCIR-10 INTENT-2 task. In: Proceedings of NTCIR-10 Workshop, pp. 94–123 (2013)

    Google Scholar 

  18. Sakai, T., Song, R.: Evaluating diversified search results using per-intent graded relevance. In: Proceedings of the 34th SIGIR, pp. 1043–1052 (2011)

    Google Scholar 

  19. Song, R., Zhang, M., Sakai, T., Kato, M.P., Liu, Y., Sugimoto, M., Wang, Q., Orii, N.: Overview of the NTCIR-9 INTENT task. In: Proceedings of NTCIR-9 Workshop Meeting, pp. 82–105 (2011)

    Google Scholar 

  20. Song, Y., Zhou, D., He, L.: Query suggestion by constructing term-transition graphs. In: Proceedings of the 5th WSDM, pp. 353–362 (2012)

    Google Scholar 

  21. Wang, X., Chakrabarti, D., Punera, K.: Mining broad latent query aspects from search sessions. In: Proceedings of the 15th KDD, pp. 867–876 (2009)

    Google Scholar 

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

    Google Scholar 

  23. Yin, X., Shah, S.: Building taxonomy of web search intents for name entity queries. In: Proceedings of the 19th WWW, pp. 1001–1010 (2010)

    Google Scholar 

  24. Yu, H., Ren, F.: Role-explicit query identification and intent role annotation. In: Proceedings of the 21st CIKM, pp. 1163–1172 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Yu, HT., Ren, F. (2014). Subtopic Mining via Modifier Graph Clustering. In: Tseng, V.S., Ho, T.B., Zhou, ZH., Chen, A.L.P., Kao, HY. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2014. Lecture Notes in Computer Science(), vol 8443. Springer, Cham. https://doi.org/10.1007/978-3-319-06608-0_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06608-0_28

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06607-3

  • Online ISBN: 978-3-319-06608-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics