Search (81 results, page 1 of 5)

  • × theme_ss:"Klassifikationssysteme im Online-Retrieval"
  1. Poynder, R.: Web research engines? (1996) 0.12 
    0.12309804 = product of:
  0.18464705 = sum of:
    0.0986154 = weight(_text_:search in 5698) [ClassicSimilarity], result of:
      0.0986154 = score(doc=5698,freq=12.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.5643796 = fieldWeight in 5698, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=5698)
    0.08603165 = product of:
      0.1720633 = sum of:
        0.1720633 = weight(_text_:engines in 5698) [ClassicSimilarity], result of:
          0.1720633 = score(doc=5698,freq=8.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.67362815 = fieldWeight in 5698, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.046875 = fieldNorm(doc=5698)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Describes the shortcomings of search engines for the WWW comparing their current capabilities to those of the first generation CD-ROM products. Some allow phrase searching and most are improving their Boolean searching. Few allow truncation, wild cards or nested logic. They are stateless, losing previous search criteria. Unlike the indexing and classification systems for today's CD-ROMs, those for Web pages are random, unstructured and of variable quality. Considers that at best Web search engines can only offer free text searching. Discusses whether automatic data classification systems such as Infoseek Ultra can overcome the haphazard nature of the Web with neural network technology, and whether Boolean search techniques may be redundant when replaced by technology such as the Euroferret search engine. However, artificial intelligence is rarely successful on huge, varied databases. Relevance ranking and automatic query expansion still use the same simple inverted indexes. Most Web search engines do nothing more than word counting. Further complications arise with foreign languages
  2. Van der Walt, M.: ¬The structure of classification schemes used in Internet search engines (1998) 0.11 
    0.108549975 = product of:
  0.16282496 = sum of:
    0.07501928 = weight(_text_:search in 84) [ClassicSimilarity], result of:
      0.07501928 = score(doc=84,freq=10.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.4293381 = fieldWeight in 84, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=84)
    0.08780568 = product of:
      0.17561136 = sum of:
        0.17561136 = weight(_text_:engines in 84) [ClassicSimilarity], result of:
          0.17561136 = score(doc=84,freq=12.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.68751884 = fieldWeight in 84, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=84)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    The purpose of this paper is to determine some of the structural features of the classification schemes used in the directories (guides, channels) of search engines to organise information sources on the Internet. Ten search engines were examined at the main class level and the full hierarchies of a sample of three specific subjects were analysed in four of these engines, namely Excite, Infoseek, Lycos and Yahoo! It was found that there are major differences between the main classes of the search engines and those found in standard library schemes like Dewey, UDC and LCC. There are large gaps in subject coverage at main class level in the search engines and the general tendency is to use a topic-based approach in the formation of classes, rather than a discipline-based approach. The subdivision of the main classes is according to hierarchical tree structures, but a number of anomalies in this regard were identified. Another deviation from library classification theory is that various principles of division are employed to form classes at the same hierarchical level. In an analysis of citation orders many examples were found that conform to the principles followed in library classifications, but a number of inconsistencies in this regard were also noted
  3. Tunkelang, D.: Faceted search (2009) 0.09 
    0.08902081 = product of:
  0.13353121 = sum of:
    0.0929755 = weight(_text_:search in 26) [ClassicSimilarity], result of:
      0.0929755 = score(doc=26,freq=24.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.5321022 = fieldWeight in 26, product of:
          4.8989797 = tf(freq=24.0), with freq of:
            24.0 = termFreq=24.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.03125 = fieldNorm(doc=26)
    0.04055571 = product of:
      0.08111142 = sum of:
        0.08111142 = weight(_text_:engines in 26) [ClassicSimilarity], result of:
          0.08111142 = score(doc=26,freq=4.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.31755137 = fieldWeight in 26, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.03125 = fieldNorm(doc=26)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more effective information-seeking support to users than best-first search. Indeed, faceted search has become increasingly prevalent in online information access systems, particularly for e-commerce and site search. In this lecture, we explore the history, theory, and practice of faceted search. Although we cannot hope to be exhaustive, our aim is to provide sufficient depth and breadth to offer a useful resource to both researchers and practitioners. Because faceted search is an area of interest to computer scientists, information scientists, interface designers, and usability researchers, we do not assume that the reader is a specialist in any of these fields. Rather, we offer a self-contained treatment of the topic, with an extensive bibliography for those who would like to pursue particular aspects in more depth.
    LCSH
    Web search engines / Research
    Subject
    Web search engines / Research
  4. Chowdhury, S.; Chowdhury, G.G.: Using DDC to create a visual knowledge map as an aid to online information retrieval (2004) 0.08 
    0.083620235 = product of:
  0.12543035 = sum of:
    0.08487463 = weight(_text_:search in 2643) [ClassicSimilarity], result of:
      0.08487463 = score(doc=2643,freq=20.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.48574063 = fieldWeight in 2643, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.03125 = fieldNorm(doc=2643)
    0.04055571 = product of:
      0.08111142 = sum of:
        0.08111142 = weight(_text_:engines in 2643) [ClassicSimilarity], result of:
          0.08111142 = score(doc=2643,freq=4.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.31755137 = fieldWeight in 2643, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.03125 = fieldNorm(doc=2643)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Selection of search terms in an online search environment can be facilitated by the visual display of a knowledge map showing the various concepts and their links. This paper reports an a preliminary research aimed at designing a prototype knowledge map using DDC and its visual display. The prototype knowledge map created using the Protégé and TGViz freeware has been demonstrated, and further areas of research in this field are discussed.
    Content
    1. Introduction Web search engines and digital libraries usually expect the users to use search terms that most accurately represent their information needs. Finding the most appropriate search terms to represent an information need is an age old problem in information retrieval. Keyword or phrase search may produce good search results as long as the search terms or phrase(s) match those used by the authors and have been chosen for indexing by the concerned information retrieval system. Since this does not always happen, a large number of false drops are produced by information retrieval systems. The retrieval results become worse in very large systems that deal with millions of records, such as the Web search engines and digital libraries. Vocabulary control tools are used to improve the performance of text retrieval systems. Thesauri, the most common type of vocabulary control tool used in information retrieval, appeared in the late fifties, designed for use with the emerging post-coordinate indexing systems of that time. They are used to exert terminology control in indexing, and to aid in searching by allowing the searcher to select appropriate search terms. A large volume of literature exists describing the design features, and experiments with the use, of thesauri in various types of information retrieval systems (see for example, Furnas et.al., 1987; Bates, 1986, 1998; Milstead, 1997, and Shiri et al., 2002).
  5. Ellis, D.; Vasconcelos, A.: Ranganathan and the Net : using facet analysis to search and organise the World Wide Web (1999) 0.08 
    0.08235665 = product of:
  0.12353496 = sum of:
    0.08051914 = weight(_text_:search in 726) [ClassicSimilarity], result of:
      0.08051914 = score(doc=726,freq=8.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.460814 = fieldWeight in 726, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=726)
    0.043015826 = product of:
      0.08603165 = sum of:
        0.08603165 = weight(_text_:engines in 726) [ClassicSimilarity], result of:
          0.08603165 = score(doc=726,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.33681408 = fieldWeight in 726, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.046875 = fieldNorm(doc=726)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    This paper documents the continuing relevance of facet analysis as a technique for searching and organising WWW based materials. The 2 approaches underlying WWW searching and indexing - word and concept based indexing - are outlined. It is argued that facet analysis as an a posteriori approach to classification using words from the subject field as the concept terms in the classification derived represents an excellent approach to searching and organising the results of WWW searches using either search engines or search directories. Finally it is argued that the underlying philosophy of facet analysis is better suited to the disparate nature of WWW resources and searchers than the assumptions of contemporaray IR research.
    This article gives a cheerfully brief and undetailed account of how to make a faceted classification system, then describes information retrieval and searching on the web. It concludes by saying that facets would be excellent in helping users search and browse the web, but offers no real clues as to how this can be done.
  6. Dodd, D.G.: Grass-roots cataloging and classification : food for thought from World Wide Web subject-oriented hierarchical lists (1996) 0.08 
    0.07774002 = product of:
  0.11661003 = sum of:
    0.0664249 = weight(_text_:search in 7270) [ClassicSimilarity], result of:
      0.0664249 = score(doc=7270,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.38015217 = fieldWeight in 7270, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7270)
    0.05018513 = product of:
      0.10037026 = sum of:
        0.10037026 = weight(_text_:engines in 7270) [ClassicSimilarity], result of:
          0.10037026 = score(doc=7270,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.39294976 = fieldWeight in 7270, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7270)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    The explosion of the use of the Internet by the genral public, particularly via the WWW, has given rise to the proliferation of semiprofessional attempts to give some subject based access to Internet resources via hierarchical guides (hotlists) on Web search engines such as Yahoo and Magellan. Examines the structure and principles of various hierachical lists, and compares them, when possible, to broad LCC and DDC schemes, and to LCSH. Explores the approaches taken by non librarians in their efforts to organize and provide access to materials on the Internet. Focuses on the dichotomy between the hierarchical 'browse' and the analytical 'search' approaches to finding materials, as exemplified by these various attempts to organize the Internet
  7. Wheatley, A.: Subject trees on the Internet : a new role for bibliographic classification? (2000) 0.07 
    0.074022576 = product of:
  0.11103386 = sum of:
    0.053679425 = weight(_text_:search in 6108) [ClassicSimilarity], result of:
      0.053679425 = score(doc=6108,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.30720934 = fieldWeight in 6108, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=6108)
    0.057354435 = product of:
      0.11470887 = sum of:
        0.11470887 = weight(_text_:engines in 6108) [ClassicSimilarity], result of:
          0.11470887 = score(doc=6108,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.44908544 = fieldWeight in 6108, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0625 = fieldNorm(doc=6108)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Internet information retrieval is largely the preserve of search engines and the even more popular subject trees. Subject trees have adapted principles of conventional bibliographic classification for structuring hierarchic browsing interfaces, thus providing easily used pathways to their selected resources. This combination of browsing and selectivity is especially valuable to untrained users. For the forseeable future, it appears that subject trees will remain the Internet's only practicable use of classificatory methods for information retrieval
  8. Lardera, M.; Gnoli, C.; Rolandi, C.; Trzmielewski, M.: Developing SciGator, a DDC-based library browsing tool (2017) 0.05 
    0.051579654 = product of:
  0.07736948 = sum of:
    0.056935627 = weight(_text_:search in 4144) [ClassicSimilarity], result of:
      0.056935627 = score(doc=4144,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.3258447 = fieldWeight in 4144, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=4144)
    0.020433856 = product of:
      0.040867712 = sum of:
        0.040867712 = weight(_text_:22 in 4144) [ClassicSimilarity], result of:
          0.040867712 = score(doc=4144,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.23214069 = fieldWeight in 4144, 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=4144)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Exploring collections by their subject matter is an important functionality for library users. We developed an online tool called SciGator in order to allow users to browse the Dewey Decimal Classification (DDC) classes used in different libraries at the University of Pavia and to perform different types of search in the OPAC. Besides navigation of DDC hierarchies, SciGator suggests "see-also" relationships with related classes and maps equivalent classes in local shelving schemes, thus allowing the expansion of search queries to include subjects contiguous to the initial one. We are developing new features, including the possibility to expand searches even more to national and international catalogues.
    Content
    Beitrag eines Special Issue: ISKO-Italy: 8' Incontro ISKO Italia, Università di Bologna, 22 maggio 2017, Bologna, Italia.
  9. Devadason, F.J.; Intaraksa, N.; Patamawongjariya, P.; Desai, K.: Faceted indexing application for organizing and accessing internet resources (2003) 0.05 
    0.05010998 = product of:
  0.07516497 = sum of:
    0.04648775 = weight(_text_:search in 3966) [ClassicSimilarity], result of:
      0.04648775 = score(doc=3966,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.2660511 = fieldWeight in 3966, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.03125 = fieldNorm(doc=3966)
    0.028677218 = product of:
      0.057354435 = sum of:
        0.057354435 = weight(_text_:engines in 3966) [ClassicSimilarity], result of:
          0.057354435 = score(doc=3966,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.22454272 = fieldWeight in 3966, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.03125 = fieldNorm(doc=3966)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Organizing and providing access to the resources an the Internet has been a problem area in spite of the availability of sophisticated search engines and other Software tools. There have been several attempts to organize the resources an the WWW. Some of them have tried to use traditional library classification schemes such as the Library of Congress Classification, the Dewey Decimal Classification and others. However there is a need to assign proper subject headings to them and present them in a logical or hierarchical sequence to cater to the need for browsing. This paper attempts to describe an experimental system designed to organize and provide access to web documents using a faceted pre-coordinate indexing system based an the Deep Structure Indexing System (DSIS) derived from POPSI (Postulate based Permuted Subject Indexing) of Bhattacharyya, and the facet analysis and chain indexing System of Ranganathan. A prototype software system has been designed to create a database of records specifying Web documents according to the Dublin Core and input a faceted subject heading according to DSIS. Synonymous terms are added to the standard terms in the heading using appropriate symbols. Once the data are entered along with a description and URL of the Web document, the record is stored in the system. More than one faceted subject heading can be assigned to a record depending an the content of the original document. The system stores the surrogates and keeps the faceted subject headings separately after establishing a link. Search is carried out an index entries derived from the faceted subject heading using chain indexing technique. If a single term is input, the system searches for its presence in the faceted subject headings and displays the subject headings in a sorted sequence reflecting an organizing sequence. If the number of retrieved headings is too large (running into more than a page) then the user has the option of entering another search term to be searched in combination. The system searches subject headings already retrieved and look for those containing the second term. The retrieved faceted subject headings can be displayed and browsed. When the relevant subject heading is selected the system displays the records with their URLs. Using the URL the original document an the web can be accessed. The prototype system developed under Windows NT environment using ASP and web server is under rigorous testing. The database and indexes management routines need further development.
  10. Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998) 0.05 
    0.047206 = product of:
  0.070809 = sum of:
    0.0469695 = weight(_text_:search in 1673) [ClassicSimilarity], result of:
      0.0469695 = score(doc=1673,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.2688082 = fieldWeight in 1673, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1673)
    0.0238395 = product of:
      0.047679 = sum of:
        0.047679 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
          0.047679 = score(doc=1673,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.2708308 = fieldWeight in 1673, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1673)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    The Wolverhampton Web Library (WWLib) is a WWW search engine that provides access to UK based information. The experimental version developed in 1995, was a success but highlighted the need for a much higher degree of automation. An interesting feature of the experimental WWLib was that it organised information according to DDC. Discusses the advantages of classification and describes the automatic classifier that is being developed in Java as part of the new, fully automated WWLib
    Date
    1. 8.1996 22:08:06
  11. Alex, H.; Heiner-Freiling, M.: Melvil (2005) 0.05 
    0.047206 = product of:
  0.070809 = sum of:
    0.0469695 = weight(_text_:search in 4321) [ClassicSimilarity], result of:
      0.0469695 = score(doc=4321,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.2688082 = fieldWeight in 4321, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4321)
    0.0238395 = product of:
      0.047679 = sum of:
        0.047679 = weight(_text_:22 in 4321) [ClassicSimilarity], result of:
          0.047679 = score(doc=4321,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.2708308 = fieldWeight in 4321, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4321)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Ab Januar 2006 wird Die Deutsche Bibliothek ein neues Webangebot mit dem Namen Melvil starten, das ein Ergebnis ihres Engagements für die DDC und das Projekt DDC Deutsch ist. Der angebotene Webservice basiert auf der Übersetzung der 22. Ausgabe der DDC, die im Oktober 2005 als Druckausgabe im K. G. Saur Verlag erscheint. Er bietet jedoch darüber hinausgehende Features, die den Klassifizierer bei seiner Arbeit unterstützen und erstmals eine verbale Recherche für Endnutzer über DDCerschlossene Titel ermöglichen. Der Webservice Melvil gliedert sich in drei Anwendungen: - MelvilClass, - MelvilSearch und - MelvilSoap.
    Object
    Melvil Search
  12. Broughton, V.; Lane, H.: Classification schemes revisited : applications to Web indexing and searching (2000) 0.05 
    0.04626411 = product of:
  0.06939616 = sum of:
    0.03354964 = weight(_text_:search in 2476) [ClassicSimilarity], result of:
      0.03354964 = score(doc=2476,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.19200584 = fieldWeight in 2476, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2476)
    0.03584652 = product of:
      0.07169304 = sum of:
        0.07169304 = weight(_text_:engines in 2476) [ClassicSimilarity], result of:
          0.07169304 = score(doc=2476,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.2806784 = fieldWeight in 2476, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2476)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Basic skills of classification and subject indexing have been little taught in British library schools since automation was introduced into libraries. However, development of the Internet as a major medium of publication has stretched the capability of search engines to cope with retrieval. Consequently, there has been interest in applying existing systems of knowledge organization to electronic resources. Unfortunately, the classification systems have been adopted without a full understanding of modern classification principles. Analytico-synthetic schemes have been used crudely, as in the case of the Universal Decimal Classification (UDC). The fully faceted Bliss Bibliographical Classification, 2nd edition (BC2) with its potential as a tool for electronic resource retrieval is virtually unknown outside academic libraries
  13. Schallier, W.: Why organize information if you can find it? : UDC and libraries in an Internet world (2007) 0.05 
    0.04626411 = product of:
  0.06939616 = sum of:
    0.03354964 = weight(_text_:search in 549) [ClassicSimilarity], result of:
      0.03354964 = score(doc=549,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.19200584 = fieldWeight in 549, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=549)
    0.03584652 = product of:
      0.07169304 = sum of:
        0.07169304 = weight(_text_:engines in 549) [ClassicSimilarity], result of:
          0.07169304 = score(doc=549,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.2806784 = fieldWeight in 549, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=549)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    The Belgians Otlet and LaFontaine created the Universal Decimal Classification in order to collect and organize the world's knowledge. This happened in an age when information was almost exclusively made available by libraries. Since the internet, the quantity of information outside libraries is enormous and keeps growing every day. The internet is accessible to anybody, it is fundamentally unorganized and its content changes constantly. Collecting and organizing the world's knowledge seem to have become an impossible ambition. Perhaps it is even unnecessary, since search engines make information retrievable now. And why would we organize information if we can find it? So what will be the role of UDC and libraries in this internet environment? Libraries can still play a role as a major information provider, if they adapt fully to the expectations of a modern end user. The design and the functionalities of online catalogues should allow maximal accessibility, usability and active participation of the end user in the internet environment. Metadata, like UDC, should maximize the visibility of information, enrich it and invite the end user to assign metadata himself.
  14. Devadason, F.J.; Intaraksa, N.; Patamawongjariya, P.; Desai, K.: Faceted indexing based system for organizing and accessing Internet resources (2002) 0.04 
    0.04384623 = product of:
  0.065769345 = sum of:
    0.040676784 = weight(_text_:search in 97) [ClassicSimilarity], result of:
      0.040676784 = score(doc=97,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.23279473 = fieldWeight in 97, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.02734375 = fieldNorm(doc=97)
    0.025092565 = product of:
      0.05018513 = sum of:
        0.05018513 = weight(_text_:engines in 97) [ClassicSimilarity], result of:
          0.05018513 = score(doc=97,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.19647488 = fieldWeight in 97, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.02734375 = fieldNorm(doc=97)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Organizing and providing access to the resources an the Internet has been a problem area in spite of the availability of sophisticated search engines and other Software tools. There have been several attempts to organize the resources an the World Wide Web. Some of them have tried to use traditional library classification schemes such as the Library of Congress Classification, the Dewey Decimal Classification and others. However there is a need to assign proper subject headings to them and present them in a logical or hierarchical sequence to cater to the need for browsing. This paper attempts to describe an experimental system designed to organize and provide access to web documents using a faceted pre-coordinate indexing system based an the Deep Structure Indexing System (DSIS) derived from POPSI (Postulate based Permuted Subject Indexing) of Bhattacharyya, and the facet analysis and chain indexing system of Ranganathan. A prototype Software System has been designed to create a database of records specifying Web documents according to the Dublin Core and to input a faceted subject heading according to DSIS. Synonymous terms are added to the Standard terms in the heading using appropriate symbols. Once the data are entered along with a description and the URL of the web document, the record is stored in the System. More than one faceted subject heading can be assigned to a record depending an the content of the original document. The System stores the Surrogates and keeps the faceted subject headings separately after establishing a link. The search is carried out an index entries derived from the faceted subject heading using the chain indexing technique. If a single term is Input, the System searches for its presence in the faceted subject headings and displays the subject headings in a sorted sequence reflecting an organizing sequence. If the number of retrieved Keadings is too large (running into more than a page) the user has the option of entering another search term to be searched in combination. The System searches subject headings already retrieved and looks for those containing the second term. The retrieved faceted subject headings can be displayed and browsed. When the relevant subject heading is selected the system displays the records with their URLs. Using the URL, the original document an the web can be accessed. The prototype system developed in a Windows NT environment using ASP and a web server is under rigorous testing. The database and Index management routines need further development.
  15. Ardo, A.; Lundberg, S.: ¬A regional distributed WWW search and indexing service : the DESIRE way (1998) 0.04 
    0.040462285 = product of:
  0.060693428 = sum of:
    0.04025957 = weight(_text_:search in 4190) [ClassicSimilarity], result of:
      0.04025957 = score(doc=4190,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.230407 = fieldWeight in 4190, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=4190)
    0.020433856 = product of:
      0.040867712 = sum of:
        0.040867712 = weight(_text_:22 in 4190) [ClassicSimilarity], result of:
          0.040867712 = score(doc=4190,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.23214069 = fieldWeight in 4190, 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=4190)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Date
    1. 8.1996 22:08:06
  16. Frâncu, V.; Sabo, C.-N.: Implementation of a UDC-based multilingual thesaurus in a library catalogue : the case of BiblioPhil (2010) 0.04 
    0.040462285 = product of:
  0.060693428 = sum of:
    0.04025957 = weight(_text_:search in 3697) [ClassicSimilarity], result of:
      0.04025957 = score(doc=3697,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.230407 = fieldWeight in 3697, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=3697)
    0.020433856 = product of:
      0.040867712 = sum of:
        0.040867712 = weight(_text_:22 in 3697) [ClassicSimilarity], result of:
          0.040867712 = score(doc=3697,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.23214069 = fieldWeight in 3697, 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=3697)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    In order to enhance the use of Universal Decimal Classification (UDC) numbers in information retrieval, the authors have represented classification with multilingual thesaurus descriptors and implemented this solution in an automated way. The authors illustrate a solution implemented in a BiblioPhil library system. The standard formats used are UNIMARC for subject authority records (i.e. the UDC-based multilingual thesaurus) and MARC XML support for data transfer. The multilingual thesaurus was built according to existing standards, the constituent parts of the classification notations being used as the basis for search terms in the multilingual information retrieval. The verbal equivalents, descriptors and non-descriptors, are used to expand the number of concepts and are given in Romanian, English and French. This approach saves the time of the indexer and provides more user-friendly and easier access to the bibliographic information. The multilingual aspect of the thesaurus enhances information access for a greater number of online users
    Date
    22. 7.2010 20:40:56
  17. Gödert, W.: Klassifikationssysteme und Online-Katalog (1987) 0.03 
    0.030007713 = product of:
  0.09002314 = sum of:
    0.09002314 = weight(_text_:search in 5138) [ClassicSimilarity], result of:
      0.09002314 = score(doc=5138,freq=10.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.51520574 = fieldWeight in 5138, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=5138)
  0.33333334 = coord(1/3)
    Abstract
    Free text searching with keywords in a complete data store is not necessarily the best automatic retrieval method. There must be a proper classification of documents and concepts and the use of a proper classification system avoids problems of terminological deficiency. The dialogue search form makes the on-line catalogue a new information medium. A bibliographic unit must be created with as many search access points as possible, using verbal and classificatory search elements. Verbal search categories must include free text elements for individual search access requirements and a controlled vocabulary with syntactic connections. Classified data should consist of a universal classification system with clear structural notation for access and surface searching, together with several specialist subject classifications for differentiated documentation and retrieval. The universal classification needs no detailed subdivision: it serves mainly as a guide and entry to the detailed sub-systems
  18. Loth, K.; Funk, H.: Subject search on ETHICS on the basis of the UDC (1990) 0.03 
    0.026839714 = product of:
  0.08051914 = sum of:
    0.08051914 = weight(_text_:search in 256) [ClassicSimilarity], result of:
      0.08051914 = score(doc=256,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.460814 = fieldWeight in 256, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.09375 = fieldNorm(doc=256)
  0.33333334 = coord(1/3)
  19. Vizine-Goetz, D.; Thompson, R.: Towards DDC-classified displays of Netfirst search results : subject access issues (2003) 0.03 
    0.026839714 = product of:
  0.08051914 = sum of:
    0.08051914 = weight(_text_:search in 3815) [ClassicSimilarity], result of:
      0.08051914 = score(doc=3815,freq=8.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.460814 = fieldWeight in 3815, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=3815)
  0.33333334 = coord(1/3)
    Abstract
    To determine the potential benefits of providing classified displays of search results, we analyzed the classification features of the OCLC NetFirst database using criteria developed by the Subject Analysis Committee (SAC) subcommittee an Metadata and Classification. We also studied NetFirst search logs to better understand how the classification-based searching and limiting functions implemented in the system are being used. Our findings suggest that to increase the use of classification-based features in systems for general users, classificatory functions must be well integrated with the basic search and display functions.
  20. Lee, H.-L.; Olson, H.A.: Hierarchical navigation : an exploration of Yahoo! directories (2005) 0.03 
    0.026839714 = product of:
  0.08051914 = sum of:
    0.08051914 = weight(_text_:search in 3991) [ClassicSimilarity], result of:
      0.08051914 = score(doc=3991,freq=8.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.460814 = fieldWeight in 3991, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=3991)
  0.33333334 = coord(1/3)
    Abstract
    Although researchers have theorized the critical importance of classification in the organization of information, the classification approach seems to have given way to the alphabetical subject approach in retrieval tools widely used in libraries, and research an how users utilize classification or classification-like arrangements in information seeking has been scant. To better understand whether searchers consider classificatory structures a viable alternative to information retrieval, this article reports an a study of how 24 library and information science students used Yahoo! directories, a popular search service resembling classification, in completing an assigned simple task. Several issues emerged from the students' reporting of their search process and a comparison between hierarchical navigation and keyword searching: citation order of facets, precision vs. recall, and other factors influencing searchers' successes and preferences. The latter included search expertise, knowledge of the discipline, and time required to complete the search. Without a definitive conclusion, we suggest a number of directoons for further research.

Authors

Years

Languages

  • e 70
  • d 8
  • nl 2
  • es 1
  • More… Less…

Types

  • a 70
  • el 13
  • m 3
  • s 2
  • p 1
  • More… Less…

Themes

Subjects

Classifications