Skip to main content

Discovering and Analyzing Multi-granular Web Search Results

  • Conference paper
Flexible Query Answering Systems (FQAS 2011)

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

Included in the following conference series:

  • 612 Accesses

Abstract

In this paper, we propose an approach based on the use of soft aggregation operators and multi-granular graphs for discovering and analyzing the results of Web searches, organized into granules of distinct resolution. This practice enables user-driven explorations of the topics retrieved in a search process on the Internet, being based on the graphical representation of both the information granules, and their discovered relationships. We further present the application of both the soft operators and multi-granular graphs within the meta-search system Matrioshka, and discuss their semantics and usefulness.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bordogna, G., Campi, A., Psaila, G., Ronchi, S.: A language for manipulating clustered web documents results. In: Proceedings of CIKM 2008, Int. Conf. on Information and Knowledge Management, pp. 23–32 (2008)

    Google Scholar 

  2. Bordogna, G., Campi, A., Psaila, G., Ronchi, S.: A cluster manipulation paradigm for mobile web search interaction. In: Proceedings of IIR-2010, 1st Italian Workshop on Information Retrieval, Padova, Italy (January 2010)

    Google Scholar 

  3. Bordogna, G., Campi, A., Psaila, G., Ronchi, S.: Disambiguated query suggestions and personalized content-similarity and novelty ranking of clustered results to optimize web searches. Information Processing and Management (in press, 2011)

    Google Scholar 

  4. Bordogna, G., Psaila, G.: Soft operators for exploring information granules of web search results. In: Proceedings of WCSC-2011, 1st World Congress on Soft Computing, San Francisco, CA, USA (May 2011)

    Google Scholar 

  5. Carpineto, C., Osinski, S., Romano, G., Weiss, D.: A survey of web clustering engines. ACM Computer Survey 41(3), 1–38 (2009)

    Article  Google Scholar 

  6. de Graaf, E., Kok, J., Kosters, W.: Clustering improves the exploration of graph mining results. In: Artificial Intelligence and Innovations 2007: from Theory to Applications. IFIP, vol. 247, pp. 13–20. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Fellbaum, C.: WordNet: an Electronic Lexical Database. The MIT Press, Cambridge (1998)

    MATH  Google Scholar 

  8. Goldstein, J., Mittal, V., Carbonell, J., Kantrowitz, M.: Multi-document summarization by sentence extraction. In: Proceedings of NAACL-ANLP-2000, the 2000 NAACL-ANLP Workshop on Automatic Summarization, pp. 40–48. ACL, Seattle (2000)

    Chapter  Google Scholar 

  9. Jansen, B.J., Spink, A.: How are we searching the world wide web? a comparison of nine search engine transaction logs. Information Processing and Management 43, 248–263 (2006)

    Article  Google Scholar 

  10. Litvak, M., Last, M.: Graph-based keyword extraction for single-document summarization. In: Proceedings of MMIES-2008, Workshop on Multi-source Multilingual Information Extraction and Summarization, pp. 17–24. Association for Computational Linguistics, Manchester (2008)

    Chapter  Google Scholar 

  11. Liu, Y., Zhang, M., Ma, S., Ru, L.: User browsing graph: Structure, evolution and application. In: Proceedings of WSDM 2009, 2nd Int. Conf. on Web Search and Web Data Mining, Barcelona, Spain (February 2009)

    Google Scholar 

  12. Markov, A., Last, M., Kandel, A.: Fast categorization of web documents represented by graphs. In: Nasraoui, O., Spiliopoulou, M., Srivastava, J., Mobasher, B., Masand, B. (eds.) WebKDD 2006. LNCS (LNAI), vol. 4811, pp. 56–71. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Osinski, S., Weiss, D.: A concept-driven algorithm for clustering search results. IEEE Intelligent Systems 20, 48–54 (2005)

    Article  Google Scholar 

  14. Roussinov, D.G., Chen, H.: Information navigation on the web by clustering and summarizing query results. Information Proc. and Manag. 37, 789–816 (2001)

    Article  MATH  Google Scholar 

  15. Schenker, A.: Graph-theoretic techniques for web content mining. PhD thesis, Tampa, FL, USA (2003)

    Google Scholar 

  16. Schenker, A., Last, M., Bunke, H., Kandel, A.: Classification of web documents using a graph model. In: Proceedings of ICDAR-2003, Int. Conf. on Document Analysis and Recognition, Los Alamitos, CA, USA, vol. 1, pp. 240–244 (August 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bordogna, G., Psaila, G. (2011). Discovering and Analyzing Multi-granular Web Search Results. In: Christiansen, H., De Tré, G., Yazici, A., Zadrozny, S., Andreasen, T., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 2011. Lecture Notes in Computer Science(), vol 7022. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24764-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24764-4_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24763-7

  • Online ISBN: 978-3-642-24764-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics