Abstract
Nowadays the popularity of data quality is increasing notably in linked data. Linked data consuming applications need to be aware that changes in a dataset. Changes such as update, remove or creation links may occur for a time so is necessary to detect them to update local data dependencies where this annotation is made by detecting changes systems. Updated or removed links can be detected using a syntactic change similarity measure, and it can be done simply using the Levenshtein distance measure. However, a specific event subclassification of updated event and removed event, which iscreated by detecting changes systems developed, does not exist based on content analysis. A semantic signature and Maximum Similarity Measure (MaSiMe) combination approach is developed to create a more specific subclassification of the initial updated and removed event when its meaning has been changed. It is used to enrich the resources, annotating the new subclassification of the initial updated event and removed event, and will be annotated the author who created this annotation, adding provenance information. Annotations on the modification time are made in linked data resource, and making an average time study about when these specific events changes, could be improved the crawling techniques for a domain.
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
Tim Berners-Lee. Linked Data. World Wide Web Consortium (2006), http://www.w3.org/DesignIssue/LinkedData.html (retrieved August 08,2008)
Umbrich, J., Hausenblas, M., Hogan, A., Polleres, A., Decker, S.: Toward Dataset Dynamics: Change Frequency of Linked Open Data Sources. In: LDOW 2010, Raleigh, USA (2010)
Harth, A., Umbrich, J., Decker, S.: A Pipelined Architecture for Crawling and Indexing Semantic Web Data. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 258–271. Springer, Heidelberg (2006)
Auer, S., Dietzold, S., Lehmann, J., Helmann, S., Aumülle, D.: Triplify: light-weight linked data publication from relational databased. In: WWW 2009. ACM, New York (2009)
Morishima, A., Nakamizo, A., Iida, T., Sugimoto, S., Kitagawa, H.: Bringing your dead links back to life: a comprehensive approach and lessons learned. In: Proceedings of the 20 th ACM conference on Hypertext and hypermedia, HT 2009, pp. 15–24. ACM, New York (2009)
Van de Sompel, H., Sanderson, R., Nelson, M.L.: An HTTP-Based Versioning Mechanism for Linked Data. In: LDOW 2010, Raleigh, North Carolina, USA. ACM, New York (2010)
Popitsch, N.P., Haslhofer, B.: DSNotify: Handing Brokeb Links in the Web of Data. In: WWW 2010, Raleigh, North Carolina, USA. ACM, New York (2010)
Urdiales-Nieto, D., Martínez Gil y, J., Aldana-Montes, J.F.: MaSiMe: a customized similarity measure and its application for tag cloud refactoring. In: Meersman, R., Herrero, P., Dillon, T. (eds.) OTM 2009 Workshops. LNCS, vol. 5872, pp. 937–946. Springer, Heidelberg (2009)
Levenshtein, V.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics-Doklady 10, 707–710 (1966)
Ziegler, P., Kiefer, C., Sturm, C., Dittrich, K.R., Bernstein, A.: Detecting Similarities in Ontologies with the SOQA-SimPack Toolkit. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 59–76. Springer, Heidelberg (2006)
Ukkonen, E.: Approximate String Matching with q-grams and Maximal Matches. Theor. Comput. Sci. 92(1), 191–211 (1992)
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
Urdiales-Nieto, D., Aldana-Montes, J.F. (2010). A More Specific Events Classification to Improve Crawling Techniques. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2010 Workshops. OTM 2010. Lecture Notes in Computer Science, vol 6428. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16961-8_86
Download citation
DOI: https://doi.org/10.1007/978-3-642-16961-8_86
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16960-1
Online ISBN: 978-3-642-16961-8
eBook Packages: Computer ScienceComputer Science (R0)