-
Doerr, M.; Gradmann, S.; Hennicke, S.; Isaac, A.; Meghini, C.; Van de Sompel, H.: ¬The Europeana Data Model (EDM) (2010)
0.01
0.012583166 = product of:
0.025166333 = sum of:
0.025166333 = product of:
0.050332665 = sum of:
0.050332665 = weight(_text_:indexing in 3967) [ClassicSimilarity], result of:
0.050332665 = score(doc=3967,freq=2.0), product of:
0.19835205 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.051817898 = queryNorm
0.2537542 = fieldWeight in 3967, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.046875 = fieldNorm(doc=3967)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Content
- Vortrag im Rahmen der Session 93. Cataloguing der WORLD LIBRARY AND INFORMATION CONGRESS: 76TH IFLA GENERAL CONFERENCE AND ASSEMBLY, 10-15 August 2010, Gothenburg, Sweden - 149. Information Technology, Cataloguing, Classification and Indexing with Knowledge Management
-
Place, E.: Internationale Zusammenarbeit bei Internet Subject Gateways (1999)
0.01
0.010530914 = product of:
0.021061828 = sum of:
0.021061828 = product of:
0.042123657 = sum of:
0.042123657 = weight(_text_:22 in 4189) [ClassicSimilarity], result of:
0.042123657 = score(doc=4189,freq=2.0), product of:
0.18145745 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051817898 = queryNorm
0.23214069 = fieldWeight in 4189, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=4189)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 22. 6.2002 19:35:09
-
Severiens, T.; Hohlfeld, M.; Zimmermann, K.; Hilf, E.R.: PhysDoc - a distributed network of physics institutions documents : collecting, indexing, and searching high quality documents by using harvest (2000)
0.01
0.010485971 = product of:
0.020971943 = sum of:
0.020971943 = product of:
0.041943885 = sum of:
0.041943885 = weight(_text_:indexing in 6470) [ClassicSimilarity], result of:
0.041943885 = score(doc=6470,freq=2.0), product of:
0.19835205 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.051817898 = queryNorm
0.21146181 = fieldWeight in 6470, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.0390625 = fieldNorm(doc=6470)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Kirriemuir, J.; Brickley, D.; Welsh, S.; Knight, J.; Hamilton, M.: Cross-searching subject gateways : the query routing and forward knowledge approach (1998)
0.01
0.010485971 = product of:
0.020971943 = sum of:
0.020971943 = product of:
0.041943885 = sum of:
0.041943885 = weight(_text_:indexing in 1252) [ClassicSimilarity], result of:
0.041943885 = score(doc=1252,freq=2.0), product of:
0.19835205 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.051817898 = queryNorm
0.21146181 = fieldWeight in 1252, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.0390625 = fieldNorm(doc=1252)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- A subject gateway, in the context of network-based resource access, can be defined as some facility that allows easier access to network-based resources in a defined subject area. The simplest types of subject gateways are sets of Web pages containing lists of links to resources. Some gateways index their lists of links and provide a simple search facility. More advanced gateways offer a much enhanced service via a system consisting of a resource database and various indexes, which can be searched and/or browsed through a Web-based interface. Each entry in the database contains information about a network-based resource, such as a Web page, Web site, mailing list or document. Entries are usually created by a cataloguer manually identifying a suitable resource, describing the resource using a template, and submitting the template to the database for indexing. Subject gateways are also known as subject-based information gateways (SBIGs), subject-based gateways, subject index gateways, virtual libraries, clearing houses, subject trees, pathfinders and other variations thereof. This paper describes the characteristics of some of the subject gateways currently accessible through the Web, and compares them to automatic "vacuum cleaner" type search engines, such as AltaVista. The application of WHOIS++, centroids, query routing, and forward knowledge to searching several of these subject gateways simultaneously is outlined. The paper concludes with looking at some of the issues facing subject gateway development in the near future. The paper touches on many of the issues mentioned in a previous paper in D-Lib Magazine, especially regarding resource-discovery related initiatives and services.
-
Birmingham, W.; Pardo, B.; Meek, C.; Shifrin, J.: ¬The MusArt music-retrieval system (2002)
0.01
0.008388777 = product of:
0.016777555 = sum of:
0.016777555 = product of:
0.03355511 = sum of:
0.03355511 = weight(_text_:indexing in 1205) [ClassicSimilarity], result of:
0.03355511 = score(doc=1205,freq=2.0), product of:
0.19835205 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.051817898 = queryNorm
0.16916946 = fieldWeight in 1205, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.03125 = fieldNorm(doc=1205)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Music websites are ubiquitous, and music downloads, such as MP3, are a major source of Web traffic. As the amount of musical content increases and the Web becomes an important mechanism for distributing music, we expect to see a rising demand for music search services. Many currently available music search engines rely on file names, song title, composer or performer as the indexing and retrieval mechanism. These systems do not make use of the musical content. We believe that a more natural, effective, and usable music-information retrieval (MIR) system should have audio input, where the user can query with musical content. We are developing a system called MusArt for audio-input MIR. With MusArt, as with other audio-input MIR systems, a user sings or plays a theme, hook, or riff from the desired piece of music. The system transcribes the query and searches for related themes in a database, returning the most similar themes, given some measure of similarity. We call this "retrieval by query." In this paper, we describe the architecture of MusArt. An important element of MusArt is metadata creation: we believe that it is essential to automatically abstract important musical elements, particularly themes. Theme extraction is performed by a subsystem called MME, which we describe later in this paper. Another important element of MusArt is its support for a variety of search engines, as we believe that MIR is too complex for a single approach to work for all queries. Currently, MusArt supports a dynamic time-warping search engine that has high recall, and a complementary stochastic search engine that searches over themes, emphasizing speed and relevancy. The stochastic search engine is discussed in this paper.
-
Blosser, J.; Michaelson, R.; Routh. R.; Xia, P.: Defining the landscape of Web resources : Concluding Report of the BAER Web Resources Sub-Group (2000)
0.01
0.0070206095 = product of:
0.014041219 = sum of:
0.014041219 = product of:
0.028082438 = sum of:
0.028082438 = weight(_text_:22 in 1447) [ClassicSimilarity], result of:
0.028082438 = score(doc=1447,freq=2.0), product of:
0.18145745 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051817898 = queryNorm
0.15476047 = fieldWeight in 1447, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=1447)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 21. 4.2002 10:22:31
