{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:05:13Z","timestamp":1754157913488,"version":"3.41.2"},"reference-count":47,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2011,11,22]],"date-time":"2011-11-22T00:00:00Z","timestamp":1321920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11,22]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>Search engine users are faced with long lists of search results, each entry being of a varying degree of relevance. Often users' expectations based on the short text of a search result hold false expectations about the linked web page. This leads users to skip relevant information, missing valuable insights, and click on irrelevant web pages wasting time. The purpose of this paper is to propose a new summary generation technique, ReClose, which combines query\u2010independent and query\u2010biased summary techniques to improve the accuracy of users' expectations.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The authors tested the effectiveness of ReClose summaries against Google summaries by surveying 34 participants. Participants were randomly assigned to use one type of summary approach. Summary effectiveness was judged based on the accuracy of each user's expectations.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>It was found that individuals using ReClose summaries showed a 10 per cent increase in the expectation accuracy over individuals using Google summaries, and therefore better user satisfaction.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Practical implications<\/jats:title><jats:p>The survey demonstrates the effectiveness of using ReClose summaries to improve the accuracy of user expectations.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>This paper presents a novel summary generation technique called ReClose, a new approach to summary evaluation and improvements upon previously proposed summary generation techniques.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17440081111187547","type":"journal-article","created":{"date-parts":[[2011,11,26]],"date-time":"2011-11-26T07:18:32Z","timestamp":1322291912000},"page":"333-359","source":"Crossref","is-referenced-by-count":2,"title":["ReClose: web page summarization combining summary techniques"],"prefix":"10.1108","volume":"7","author":[{"given":"Brent","family":"Wenerstrom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmed","family":"Kantardzic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022021920082358800_b1","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N. and Hullender, G. (2005), \u201cLearning to rank using gradient descent\u201d, ICML '05: Proceedings of the 22nd International Conference on Machine Learning, ACM, New York, NY, pp. 89\u201096.","DOI":"10.1145\/1102351.1102363"},{"key":"key2022021920082358800_b2","doi-asserted-by":"crossref","unstructured":"Carbonell, J. and Goldstein, J. (1998), \u201cThe use of MMR, diversity\u2010based reranking for reordering documents and producing summaries\u201d, Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '98, ACM, New York, NY, pp. 335\u20106.","DOI":"10.1145\/290941.291025"},{"key":"key2022021920082358800_b3","doi-asserted-by":"crossref","unstructured":"Cutrell, E. and Guan, Z. (2007), \u201cWhat are you looking for? An eye\u2010tracking study of information usage in web search\u201d, ACM Conference on Human Factors in Computing Systems (CHI 2007\u2009), ACM Press, New York, NY, pp. 407\u201016.","DOI":"10.1145\/1240624.1240690"},{"key":"key2022021920082358800_b4","doi-asserted-by":"crossref","unstructured":"D\u00edaz, A. and Gerv\u00e1s, P. (2007), \u201cUser\u2010model based personalized summarization\u201d, Information Processing & Management, Vol. 43 No. 6, pp. 1715\u201034.","DOI":"10.1016\/j.ipm.2007.01.009"},{"key":"key2022021920082358800_b5","doi-asserted-by":"crossref","unstructured":"Erkan, G. and Radev, D. (2004), \u201cLexRank: graph\u2010based lexical centrality as salience in text summarization\u201d, Journal of Artificial Intelligence Research, Vol. 22 No. 1, pp. 457\u201079.","DOI":"10.1613\/jair.1523"},{"key":"key2022021920082358800_b6","unstructured":"Ferreira, C. (2001), \u201cGene expression programming: a new adaptive algorithm for solving problems\u201d, Complex Systems, Vol. 13 No. 2, pp. 87\u2010129."},{"key":"key2022021920082358800_b7","doi-asserted-by":"crossref","unstructured":"Freeman, L.C. (1978\u20101979), \u201cCentrality in social networks conceptual clarification\u201d, Social Networks, Vol. 1 No. 3, pp. 215\u201039.","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"key2022021920082358800_b8","doi-asserted-by":"crossref","unstructured":"Friedman, J. (2001), \u201cGreedy function approximation: a gradient boosting machine\u201d, Annals of Statistics, Vol. 29 No. 5, pp. 1189\u2010232.","DOI":"10.1214\/aos\/1013203451"},{"key":"key2022021920082358800_b9","doi-asserted-by":"crossref","unstructured":"Friedman, J. (2002), \u201cStochastic gradient boosting\u201d, Computational Statistics & Data Analysis, Vol. 38 No. 4, pp. 367\u201078.","DOI":"10.1016\/S0167-9473(01)00065-2"},{"key":"key2022021920082358800_b10","unstructured":"Google (2009), \u201cChanging your site's title and description in search results\u201d, available at: www.google.com\/support\/webmasters\/bin\/answer.py?hl=en&answer=35264 (accessed 28 April 2011)."},{"key":"key2022021920082358800_b11","unstructured":"Google (2010), \u201cSearch results page: Google search basics\u201d, available at: www.google.com\/support\/websearch\/bin\/answer.py?answer=35891#results (accessed 28 April 2011)."},{"key":"key2022021920082358800_b12","doi-asserted-by":"crossref","unstructured":"Granka, L.A., Joachims, T. and Gay, G. (2004), \u201cEyetracking analysis of user behavior in WWW search\u201d, ACM Conference on Research and Development in Information Retrieval (SIGIR), ACM, New York, NY, pp. 478\u20109.","DOI":"10.1145\/1008992.1009079"},{"key":"key2022021920082358800_b13","doi-asserted-by":"crossref","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P. and Witten, I.H. (2009), \u201cThe WEKA data mining software: an update\u201d, ACM SIGKDD Explorations Newsletter, Vol. 11 No. 1, pp. 10\u201018.","DOI":"10.1145\/1656274.1656278"},{"key":"key2022021920082358800_b14","doi-asserted-by":"crossref","unstructured":"Herings, P.J., van der Laan, G. and Talman, D. (2001), \u201cMeasuring the power of nodes in digraphs\u201d, Technical Report, Tinbergen Institute, Amsterdam.","DOI":"10.2139\/ssrn.288088"},{"key":"key2022021920082358800_b15","doi-asserted-by":"crossref","unstructured":"Huang, Y., Liu, Z. and Chen, Y. (2008), \u201cQuery biased snippet generation in XML search\u201d, Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD '08, ACM, New York, NY, pp. 315\u201026.","DOI":"10.1145\/1376616.1376651"},{"key":"key2022021920082358800_b16","unstructured":"Jaccard, P. (1901), \u201c\u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura\u201d, Bulletin del la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles, Vol. 37, pp. 547\u201079."},{"key":"key2022021920082358800_b17","doi-asserted-by":"crossref","unstructured":"Jacobson, D. (1999), \u201cImpression formation in cyberspace: online expectations and offline experiences in text\u2010based virtual communities\u201d, Journal of Computer\u2010Mediated Communication, Vol. 5 No. 1.","DOI":"10.1111\/j.1083-6101.1999.tb00333.x"},{"key":"key2022021920082358800_b18","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M. (1999), \u201cAuthoritative sources in a hyperlinked environment\u201d, Journal of the ACM, Vol. 46 No. 5, pp. 604\u201032.","DOI":"10.1145\/324133.324140"},{"key":"key2022021920082358800_b19","doi-asserted-by":"crossref","unstructured":"Kupiec, J., Pedersen, J. and Chen, F. (1995), \u201cA trainable document summarizer\u201d, SIGIR '95: Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, ACM, New York, NY, pp. 68\u201073.","DOI":"10.1145\/215206.215333"},{"key":"key2022021920082358800_b20","doi-asserted-by":"crossref","unstructured":"Lawrence, S., Bollacker, K. and Giles, C.L. (1999), \u201cIndexing and retrieval of scientic literature\u201d, Proceedings of the Eighth International Conference on Information and Knowledge Management, CIKM '99, ACM, New York, NY, pp. 139\u201046.","DOI":"10.1145\/319950.319970"},{"key":"key2022021920082358800_b21","doi-asserted-by":"crossref","unstructured":"Lin, C.\u2010Y. and Hovy, E. (2003), \u201cAutomatic evaluation of summaries using n\u2010gram co\u2010occurrence statistics\u201d, NAACL '03: Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology, Association for Computational Linguistics, Morristown, NJ, pp. 71\u20108.","DOI":"10.3115\/1073445.1073465"},{"key":"key2022021920082358800_b22","doi-asserted-by":"crossref","unstructured":"Luhn, P.H. (1958), \u201cAutomatic creation of literature abstracts\u201d, IBM Journal, Vol. 2 No. 2, pp. 159\u201065.","DOI":"10.1147\/rd.22.0159"},{"key":"key2022021920082358800_b23","unstructured":"Maizell, R., Smith, J. and Singer, T. (1971), Abstracting Scientific and Technical Literature: An Introductory Guide and Text for Scientists, Abstractors, and Management, Wiley\u2010Interscience, New York, NY."},{"key":"key2022021920082358800_b24","doi-asserted-by":"crossref","unstructured":"Manning, C., Raghavan, P. and Sch\u00fctze, H. (2008), Introduction to Information Retrieval, Cambridge University Press, New York, NY.","DOI":"10.1017\/CBO9780511809071"},{"key":"key2022021920082358800_b25","unstructured":"Metzler, D. and Kanungo, T. (2008), \u201cMachine learned sentence selection strategies for query\u2010biased summarization\u201d, Proceedings of the SIGIR Learning to Rank Workshop, ACM, Singapore, pp. 40\u20107."},{"key":"key2022021920082358800_b26","unstructured":"Microsoft (2010), \u201cAnatomy of a bing caption\u201d, available at: www.bing.com\/community\/site_blogs\/b\/webmaster\/archive\/2010\/10\/25\/anatomy\u2010of\u2010a\u2010bing\u2010caption.aspx (accessed 28 April 2011)."},{"key":"key2022021920082358800_b27","doi-asserted-by":"crossref","unstructured":"Mihalcea, R. (2004), \u201cGraph\u2010based ranking algorithms for sentence extraction, applied to text summarization\u201d, Proceedings of the ACL 2004 on Interactive Poster and Demonstration Sessions, Association for Computational Linguistics, Morristown, NJ, p. 20.","DOI":"10.3115\/1219044.1219064"},{"key":"key2022021920082358800_b28","unstructured":"Orgnet.com (2009), Social Network Analysis, A Brief Introduction, available at: www.orgnet.com\/sna.html (accessed 21 September 2011)."},{"key":"key2022021920082358800_b29","doi-asserted-by":"crossref","unstructured":"Otterbacher, J., Erkan, G. and Radev, D.R. (2009), \u201cBiased LexRank: passage retrieval using random walks with question\u2010based priors\u201d, Information Processing & Management, Vol. 45 No. 1, pp. 42\u201054.","DOI":"10.1016\/j.ipm.2008.06.004"},{"key":"key2022021920082358800_b30","unstructured":"Page, L., Brin, S., Motwani, R. and Winograd, T. (1998), \u201cThe PageRank citation ranking: bringing order to the web\u201d, Technical Report, Stanford University, Palo Alto, CA."},{"key":"key2022021920082358800_b31","unstructured":"Patil, K. and Brazdil, P. (2007), \u201cSumGraph: text summarization using centrality in the pathfinder network\u201d, International Journal on Computer Science and Information Systems, Vol. 2 No. 1, pp. 18\u201032."},{"key":"key2022021920082358800_b32","doi-asserted-by":"crossref","unstructured":"Porter, M. (1980), \u201cAn algorithm for suffix stripping\u201d, Program, Vol. 14 No. 3, pp. 130\u20107.","DOI":"10.1108\/eb046814"},{"key":"key2022021920082358800_b33","doi-asserted-by":"crossref","unstructured":"Quinlan, J. (1987), \u201cSimplifying decision trees\u201d, International Journal of Man\u2010Machine Studies, Vol. 27 No. 3, pp. 221\u201034.","DOI":"10.1016\/S0020-7373(87)80053-6"},{"key":"key2022021920082358800_b34","unstructured":"Ratkiewicz, J. and Menczer, F. (2008), \u201cText snippets from the DomGraph\u201d, Proceedings of the SIGIR 2008 Workshop on Focused Retrieval, University of Otago, Singapore, pp. 45\u201050."},{"key":"key2022021920082358800_b35","unstructured":"Ridgeway, G. (2007), \u201cGeneralized boosted models: a guide to the gbm package\u201d, available at: http:\/\/cran.r\u2010project.org\/web\/packages\/gbm\/vignettes\/gbm.pdf (accessed 28 April 2011)."},{"key":"key2022021920082358800_b36","doi-asserted-by":"crossref","unstructured":"Rose, D.E., Orr, D. and Kantamneni, R.G.P. (2007), \u201cSummary attributes and perceived search quality\u201d, WWW '07: Proceedings of the 16th International Conference on World Wide Web, ACM, New York, NY, pp. 1201\u20102.","DOI":"10.1145\/1242572.1242765"},{"key":"key2022021920082358800_b37","doi-asserted-by":"crossref","unstructured":"Sabidussi, G. (1966), \u201cThe centrality index of a graph\u201d, Psychometrika, Vol. 31 No. 4, pp. 581\u2010603.","DOI":"10.1007\/BF02289527"},{"key":"key2022021920082358800_b38","doi-asserted-by":"crossref","unstructured":"Song, F. and Croft, W.B. (1999), \u201cA general language model for information retrieval\u201d, CIKM '99: Proceedings of the Eighth International Conference on Information and Knowledge Management, ACM, New York, NY, pp. 316\u201021.","DOI":"10.1145\/319950.320022"},{"key":"key2022021920082358800_b39","unstructured":"Svore, K.M., Vanderwende, L. and Burges, C.J. (2007), \u201cEnhancing single\u2010document summarization by combining RankNet and third\u2010party sources\u201d, Proceedings of the Joint Conference on Empirical Methods on Natural Language Processing and Computational Natural Language Learning (EMNLP\u2010CoNLL), The Association for Computational Linguistics, Stroudsburg, PA, pp. 448\u201057."},{"key":"key2022021920082358800_b40","doi-asserted-by":"crossref","unstructured":"Tombros, A. and Sanderson, M. (1998), \u201cAdvantages of query biased summaries in information retrieval\u201d, SIGIR '98: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, ACM, New York, NY, pp. 2\u201010.","DOI":"10.1145\/290941.290947"},{"key":"key2022021920082358800_b41","doi-asserted-by":"crossref","unstructured":"Varadarajan, R., Hristidis, V. and Li, T. (2008), \u201cBeyond single\u2010page web search results\u201d, IEEE Transactions on Knowledge and Data Engineering, Vol. 20 No. 3, pp. 411\u201024.","DOI":"10.1109\/TKDE.2007.190703"},{"key":"key2022021920082358800_b42","unstructured":"Watabe, M. (1998), \u201cExercise for chapter 6: centrality answers\u201d, available at: www.sscnet.ucla.edu\/soc\/faculty\/mcfarland\/soc112\/cent\u2010ans.htm (accessed 21 September 2011)."},{"key":"key2022021920082358800_b43","unstructured":"Wenerstrom, B. and Kantardzic, M. (2010), \u201cSentence ranking for search document summarization based on the wisdom of three search engines\u201d, Proceedings of the 2010 International Conference on Internet Computing, ICOMP 2010, IEEE Computer Society, Los Alamitos, CA, pp. 277\u201083."},{"key":"key2022021920082358800_b44","doi-asserted-by":"crossref","unstructured":"White, R., Jose, J.M. and Ruthven, I. (2001), \u201cQuery\u2010biased web page summarisation: a task\u2010oriented evaluation\u201d, Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '01, ACM, New York, NY, pp. 412\u201013.","DOI":"10.1145\/383952.384062"},{"key":"key2022021920082358800_b45","unstructured":"Wibisono, Y. and Widyantoro, D. (2007), \u201cGenerating indicative and informative summaries for search engine results\u201d, Proceedings of the International Conference on Electrical Engineering and Informatics, Institut Teknologi, Bandung, pp. 630\u20103."},{"key":"key2022021920082358800_b46","unstructured":"Xie, Z. (2006), \u201cMachine learning in automatic text summarization: from extracting to abstracting\u201d, PhD thesis, University of Illinois, Chicago, IL, Adviser\u2010Eugenio, Barbara Di."},{"key":"key2022021920082358800_b47","unstructured":"Yahoo! (2007), \u201cHow to change a page title or description in Yahoo! Search results\u201d, available at: http:\/\/help.yahoo.com\/l\/us\/yahoo\/search\/indexing\/indexing\u201011.html (accessed 28 April 2011)."}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17440081111187547","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17440081111187547\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17440081111187547\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:25:04Z","timestamp":1753403104000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/7\/4\/333-359\/165148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,22]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11,22]]}},"alternative-id":["10.1108\/17440081111187547"],"URL":"https:\/\/doi.org\/10.1108\/17440081111187547","relation":{},"ISSN":["1744-0084"],"issn-type":[{"type":"print","value":"1744-0084"}],"subject":[],"published":{"date-parts":[[2011,11,22]]}}}