Skip to main content

Clustering-Based Schema Matching of Web Data for Constructing Digital Library

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3481))

Abstract

The abundant information on the web attracts many researches on reusing the valuable web data in other information applications, for example, digital libraries. Web information published by various contributors in different ways, schema matching is a basic problem for the heterogeneous data sources integration. Web information integration arises new challenges from the following ways: web data are short of intact schema definition; and the schema matching between web data can not be simplified as 1-1 mapping problem. In this paper we propose an algorithm, COSM, to automatic the web data schema matching process. The matching process is transformed into a clustering problem: the data elements clustered into one cluster are viewed as mapping ones. COSM is mainly instance-level matching approach, also combined with a partial name matcher in calculating the elements distance metrics. A pretreatment for data is carried out to give rational distance metrics between elements before clustering step. The experiment of algorithm testing and application (applied in the Chinese folk music digital library construction) proves the algorithm’s efficiency.

This is a preview of subscription content, log in via an institution.

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rahm, E., Bernstein, P.A.: On Matching Schemas Automatically. VLDB Journal 10(4) (2001)

    Google Scholar 

  2. Lawrence, S., Giles, C.L., Bollacker, K.: Digital libraries and Autonomous Citation Indexing. IEEE Computer 32(6), 67–71 (1999)

    Google Scholar 

  3. He, B., Chang, K.C.-C.: Statistical Schema Matching across Web Query Interfaces. In: ACM SIGMOD 2003, San Diego, CA (2003)

    Google Scholar 

  4. Calado, P.P., Goncalves, M.A., et al.: The Web-DL Environment for Building Digital Libraries from the Web. In: Proceedings of the 3th ACM/IEEE Joint Conference on Digital Libraries, JCDL 2003, Houston, Texas USA, May 27 - 31 (2003)

    Google Scholar 

  5. Madhavan, J., Bernstein, P., Rahm, E.: Generic Schema Matching with Cupid. In: The Proceeding s of VLDB (2001)

    Google Scholar 

  6. Ashish, N., Knoblock, C.: Wrapper Generation for Semi-Structured Internet Sources. In: Proc. of the ACM SIGMOD Workshop on Management of Semistructured Data, Tucson, Arizona (May 1997)

    Google Scholar 

  7. Xu, L., Embley, D.W.: Discovering Direct and Indirect Matches for Schema Elements. In: The IEEE conference of DASFAA 2003, Japan (2003)

    Google Scholar 

  8. Doan, A., Domingos, P., Halevy, A.: Reconciling schemas of Disparate Data Sources: A machine Learning Approach. In: SIGMOD 2001, Santa Barbara, California, USA (2001)

    Google Scholar 

  9. Kang, J., Naughton, J.F.: On Schema Matching with Opaque Column Names and Data Values. In: ACM SIGMOD 2003, San Diego, CA (2003)

    Google Scholar 

  10. Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An introduction to Cluster Analysis. John Wiley & Sons, New York (1990)

    Google Scholar 

  11. Hai, H., Rahm, E.: COMA – A System for Flexible Combination of Schema Matching Approaches. In: Proc. of the 28th VLDB (2002)

    Google Scholar 

  12. Doan, A.,, J.: Learning to Map between Ontologies on the Semantic Web. In: Proc. of the 11th WWW (2002)

    Google Scholar 

  13. Melnik, S., Garcia-monina, H., Rahm, E.: Similarity Flooding: A Versatile Graph Matching Algorithm. In: Proce. of the 18th ICDE (2002)

    Google Scholar 

  14. Crescenzi, V., Mecca, G., Merialdo, P.: ROADRUNNER: Towards automatic data extraction from large web sites. In: Proc. of the 2001 Intl. Conf. on Very Large Data Bases, pp. 109–118 (2001)

    Google Scholar 

  15. Arasu, A., Garcia-Monina, H.: Extracting structured data from web pages. In: ACM SIGMOD 2003, San Diego, CA (2003)

    Google Scholar 

  16. Song, H., Ma, F., Suraj, G.: Data Extraction and Annotation for Dynamic Web Pages. In: Proceeding of IEEE conference EEE 2004, Taibei (2004)

    Google Scholar 

  17. Cohen, W., Hirsh, H.: Joins that generalize: Text classification using whirl. In: Proc. of the fourth Int. Conf. on KDD (1998)

    Google Scholar 

  18. http://www.cogsci.princeton.edu/~wn/

  19. http://www.keenage.com/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Song, H., Ma, F., Wang, C. (2005). Clustering-Based Schema Matching of Web Data for Constructing Digital Library. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424826_116

Download citation

  • DOI: https://doi.org/10.1007/11424826_116

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25861-2

  • Online ISBN: 978-3-540-32044-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics