Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 226))

Abstract

Merging information can be of key importance in several XML-based applications. For instance, merging the RSS news from different sources and providers can be beneficial for end-users (journalists, economists, etc.) in various scenarios. In this work, we address this issue and mainly explore the relatedness relationships between RSS entities/elements. To validate our approach, we also provide a set of experimental tests showing satisfactory results.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science 337(1-3), 217–239 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Budanitsky, A., Hirst, G.: Evaluating WordNet-based measures of lexical semantic relatedness. Computational Linguistics 32(1), 13–47 (2006)

    Article  Google Scholar 

  3. Chawathe, S.S.: Comparing hierarchical data in external memory. In: VLDB 1999: Proceedings of the 25th International Conference on Very Large Data Bases, pp. 90–101. Morgan Kaufmann Publishers Inc., San Francisco (1999)

    Google Scholar 

  4. Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB Journal 10(4), 334–350 (2001)

    Article  MATH  Google Scholar 

  5. Flesca, S., Manco, G., Masciari, E., Pontieri, L.: Fast detection of xml structural similarity. IEEE Transactions on Knowledge and Data Engineering 17(2), 160–175 (2005) (Student Member-Andrea Pugliese)

    Article  Google Scholar 

  6. Getahun, F., Tekli, J., Atnafu, S., Chbeir, R.: Towards efficient horizontal multimedia database fragmentation using semantic-based predicates implication. In: XXII Simposio Brasileiro de Banco de Dados (SBBD 2007), Joao Pessoa, Brazil, October 15-19, pp. 68–82 (2007)

    Google Scholar 

  7. Grabs, T., Schek, H.-J.: Generating Vector Spaces On-the-fly for Flexible XML Retrieval. In: Proceedings of the ACM SIGIR Workshop on XML and Information Retrieval, Tampere, Finland, pp. 4–13. ACM Press, New York (2002)

    Google Scholar 

  8. Kade, A.M., Heuser, C.A.: Matching XML documents in highly dynamic applications. In: Proceeding of the eighth ACM symposium on Document engineering, Sao Paulo, Brazil, pp. 191–198 (2008) ISBN:978-1-60558-081-4

    Google Scholar 

  9. La Fontaine, R.: Merging XML files: A new approach providing intelligent merge of XML data sets. In: Proceedings of XML Europe 2002 (2002)

    Google Scholar 

  10. Lin, D.: An Information-Theoretic Definition of Similarity. In: Proceedings of the 15th International Conference on Machine Learning, pp. 296–304. Morgan Kaufmann Publishers Inc., San Francisco (1998)

    Google Scholar 

  11. McGill, M.J.: Introduction to Modern Information Retrieval. McGraw-Hill, New York (1983)

    MATH  Google Scholar 

  12. Nierman, A., Jagadish, H.V.: Evaluating structural similarity in XML documents. In: Proceedings of the Fifth International Workshop on the Web and Databases, WebDB 2002, pp. 61–66. University of California (2002)

    Google Scholar 

  13. Porter, M.F.: An algorithm for suffix stripping. Program 14(3), 130–137 (1980)

    Google Scholar 

  14. Princeton University Cognitive Science Laboratory. WordNet: a lexical database for the English language, http://wordnet.princeton.edu/

  15. Resnik, P.: Semantic Similarity in a Taxonomy: An Information-based Measure and its Application to Problems of Ambiguity in Natural Language. Journal of Artificial Intelligence Research 11, 95–130 (1999)

    MATH  Google Scholar 

  16. Richardson, R., Smeaton, A.F.: Using wordnet in a knowledge-based approach to information retrieval. Technical Report CA-0395, School of Computer Applications, Trinity College, Dublin, Ireland (1995)

    Google Scholar 

  17. RSS Advisory Board. RSS 2.0 Specification, http://www.rssboard.org/

  18. Tekli, J., Chbeir, R., Ytongnon, K.: A hybrid approach for xml similarity. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plasil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 783–795. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Wu, Z., Palmer, M.: V Verbs semantics and lexical selection. In: Proceedings of the 32nd annual meeting on Association for Computational Linguistics, Morristown, NJ, USA, pp. 133–138. Association for Computational Linguistics (1994)

    Google Scholar 

  20. WWW Consortium. The Document Object Model, http://www.w3.org/DOM

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Getahun, F., Tekli, J., Viviani, M., Chbeir, R., Yetongnon, K. (2009). Towards Semantic-based RSS Merging. In: Damiani, E., Jeong, J., Howlett, R.J., Jain, L.C. (eds) New Directions in Intelligent Interactive Multimedia Systems and Services - 2. Studies in Computational Intelligence, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02937-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02937-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02936-3

  • Online ISBN: 978-3-642-02937-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics