Abstract
Query-biased summary is a query-centered document brief representation. In many scenarios, query-biased summarization can be accomplished by implementing query-customized ranking of sentences within the web page. However, it is a tough work to generate this summary since it is hard to consider the similarity between the query and the sentences of a particular document for lacking of information and background knowledge behind these short texts. We focused on this problem and improved the summary generation effectiveness by involving semantic information in the machine learning process. And we found these improvements are more significant when query term occurrences are relatively low in the document.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Amini, M.-R., Gallinari, P.: The use of unlabeled data to improve supervised learning for text summarization. In: SIGIR, pp. 105–112 (2002)
Chuang, W.T., Yang, J.: Extracting sentence segments for text summarization: a machine learning approach. In: SIGIR, pp. 152–159 (2000)
Deerwester, S.C., Dumais, S.T., Landauer, T.K., Furnas, G.W., Harshman, R.A.: Indexing by latent semantic analysis. JASIS 41(6), 391–407 (1990)
Jerome, H.: Friedman. Greedy function approximation: A gradient boosting machine. Annals of Statistics 29, 1189–1232 (2000)
Gabrilovich, E., Markovitch, S.: Computing semantic relatedness using wikipedia-based explicit semantic analysis. In: IJCAI 2007: Proceedings of the 20th international joint inproceedings on Artifical intelligence, pp. 1606–1611. Morgan Kaufmann Publishers Inc., San Francisco (2007)
Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst. 20(4), 422–446 (2002)
Metzler, D., Kanungo, T.: Machine Learned Sentence Selection Strategies for Query-Biased Summarization. Learning to Rank for Information Retrieval, 40
Song, F., Bruce Croft, W.: A general language model for information retrieval. In: Proceedings of the 1999 ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 279–280 (1999)
Tombros, A., Sanderson, M.: Advantages of query biased summaries in information retrieval. In: SIGIR 1998: Proceedings of the 21st annual international ACM SIGIR inproceedings on Research and development in information retrieval, pp. 2–10. ACM, New York (1998)
Turpin, A., Tsegay, Y., Hawking, D., Williams, H.E.: Fast generation of result snippets in web search. In: SIGIR, pp. 127–134 (2007)
Wang, C., Jing, F., Zhang, L., Zhang, H.-J.: Learning query-biased web page summarization. In: CIKM 2007: Proceedings of the sixteenth ACM inproceedings on Conference on information and knowledge management, pp. 555–562. ACM, New York (2007)
Zhai, C.X., Lafferty, J.D.: A study of smoothing methods for language models applied to ad hoc information retrieval. In: SIGIR, pp. 334–342 (2001)
Zheng, Z., Zha, H., Zhang, T., Chapelle, O., Chen, K., Sun, G.: A general boosting method and its application to learning ranking functions for web search. In: NIPS (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, Y., Guo, Z., Ren, P., Yu, Y. (2010). Applying Wikipedia-Based Explicit Semantic Analysis for Query-Biased Document Summarization. In: Huang, DS., Zhao, Z., Bevilacqua, V., Figueroa, J.C. (eds) Advanced Intelligent Computing Theories and Applications. ICIC 2010. Lecture Notes in Computer Science, vol 6215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14922-1_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-14922-1_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14921-4
Online ISBN: 978-3-642-14922-1
eBook Packages: Computer ScienceComputer Science (R0)