ZemPod: A semantic web approach to podcasting
✍ Scribed by Òscar Celma; Yves Raimond
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 621 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1570-8268
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we present a semantic web approach to solve some current limitations of podcasting. The main shortcomings of podcasts are two. The first one is that there is no formal description of the contents of a podcast session, apart from a textual description only available in HTML. The second problem is that a podcast session consists of a single audio file. Thus, it is very difficult to seek into one of the music tracks that compose a podcast.
Our proposal to cope with these problems uses traditional audio signal processing -such as speech versus music segmentation, and audio identification -, and semantic web techniques to automatically describe and decompose the audio content of a podcast session. Yet, we believe that adding semantics to the podcast to explain its content, and decomposing it into smaller and meaningful chunks (that permits seeking into the inner parts of the file) will ease important music information retrieval tasks, such as recommendation, filtering and discovery.
📜 SIMILAR VOLUMES
This paper describes the use of semantic web technology and Description Logic (DL) for facilitating the integration of molecular pathway data, which is illustrated by an Web Ontology Language (OWL)-based transformation of a more complex pathway structure (Reactome) into a simpler one (HPRD). The pro
One of the key issues in dynamic research areas, such as that of biomedical sciences, is the development of tools capable to retrieve and provide users relevant resources from large repositories according to their information needs. In this paper, we present a filtering and recommender system that a
Order-sorted rewriting builds a nice framework to handle partially defined functions and subtypes. To be able to prove a critical-pair lemma and Birkhoff's completeness theorem, order-sorted rewriting was restricted to sort decreasing term rewriting systems. However, natural examples show that this