Search (79 results, page 4 of 4)

  • × theme_ss:"Konzeption und Anwendung des Prinzips Thesaurus"
  • × type_ss:"a"
  • × year_i:[1990 TO 2000}
  1. Harter, S.P.; Cheng, Y.-R.: Colinked descriptors : improving vocabulary selection for end-user searching (1996) 0.00 
    0.0036413912 = product of:
  0.014565565 = sum of:
    0.014565565 = weight(_text_:information in 4216) [ClassicSimilarity], result of:
      0.014565565 = score(doc=4216,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.16457605 = fieldWeight in 4216, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=4216)
  0.25 = coord(1/4)
    Abstract
    This article introduces a new concept and technique for information retrieval called 'colinked descriptors'. Borrowed from an analogous idea in bibliometrics - cocited references - colinked descriptors provide a theory and method for identifying search terms that, by hypothesis, will be superior to those entered initially by a searcher. The theory suggests a means of moving automatically from 2 or more initial search terms, to other terms that should be superior in retrieval performance to the 2 original terms. A research project designed to test this colinked descriptor hypothesis is reported. The results suggest that the approach is effective, although methodological problems in testing the idea are reported. Algorithms to generate colinked descriptors can be incorporated easily into system interfaces, front-end or pre-search systems, or help software, in any database that employs a thesaurus. The potential use of colinked descriptors is a strong argument for building richer and more complex thesauri that reflect as many legitimate links among descriptors as possible
    Source
    Journal of the American Society for Information Science. 47(1996) no.4, S.311-325
  2. Srinivasan, P.: Thesaurus construction (1992) 0.00 
    0.0036413912 = product of:
  0.014565565 = sum of:
    0.014565565 = weight(_text_:information in 3504) [ClassicSimilarity], result of:
      0.014565565 = score(doc=3504,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.16457605 = fieldWeight in 3504, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3504)
  0.25 = coord(1/4)
    Abstract
    Thesauri are valuable structures for Information Retrieval systems. A thesaurus provides a precise and controlled vocabulary which serves to coordinate dacument indexing and document retrieval. In both indexing and retrieval, a thesaurus may be used to select the most appropriate terms. Additionally, the thesaurus can assist the searcher in reformulating search strategies if required. Examines the important features of thesauri. This should allow the reader to differentiate between thesauri. Next, a brief overview of the manual thesaurus construction process is given. 2 major approaches for automatic thesaurus construction have been selected for detailed examination. The first is on thesaurus construction from collections of documents,a nd the 2nd, on thesaurus construction by merging existing thesauri. These 2 methods were selected since they rely on statistical techniques alone and are also significantly different from each other. Programs written in C language accompany the discussion of these approaches
    Source
    Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
  3. Chen, H.; Martinez, J.; Kirchhoff, A.; Ng, T.D.; Schatz, B.R.: Alleviating search uncertainty through concept associations : automatic indexing, co-occurence analysis, and parallel computing (1998) 0.00 
    0.0036413912 = product of:
  0.014565565 = sum of:
    0.014565565 = weight(_text_:information in 5202) [ClassicSimilarity], result of:
      0.014565565 = score(doc=5202,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.16457605 = fieldWeight in 5202, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=5202)
  0.25 = coord(1/4)
    Abstract
    In this article, we report research on an algorithmic approach to alleviating search uncertainty in a large information space. Grounded on object filtering, automatic indexing, and co-occurence analysis, we performed a large-scale experiment using a parallel supercomputer (SGI Power Challenge) to analyze 400.000+ abstracts in an INSPEC computer engineering collection. Two system-generated thesauri, one based on a combined object filtering and automatic indexing method, and the other based on automatic indexing only, were compaed with the human-generated INSPEC subject thesaurus. Our user evaluation revealed that the system-generated thesauri were better than the INSPEC thesaurus in 'concept recall', but in 'concept precision' the 3 thesauri were comparable. Our analysis also revealed that the terms suggested by the 3 thesauri were complementary and could be used to significantly increase 'variety' in search terms the thereby reduce search uncertainty
    Source
    Journal of the American Society for Information Science. 49(1998) no.3, S.206-216
  4. Spiteri, L.F.: ¬The essential elements of faceted thesauri (1999) 0.00 
    0.0036413912 = product of:
  0.014565565 = sum of:
    0.014565565 = weight(_text_:information in 5362) [ClassicSimilarity], result of:
      0.014565565 = score(doc=5362,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.16457605 = fieldWeight in 5362, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=5362)
  0.25 = coord(1/4)
    Abstract
    The goal of this study is to evaluate, compare, and contrast how facet analysis is used to construct the systematic or faceted displays of a selection of information retrieval thesauri. More specifically, the study seeks to examine which principles of facet analysis are used in the thesauri, and the extent to which different thesauri apply these principles in the same way. A measuring instrument was designed for the purpose of evaluating the structure of faceted thesauri. This instrument was applied to fourteen faceted information retrieval thesauri. The study reveals that the thesauri do not share a common definition of what constitutes a facet. In some cases, the thesauri apply both enumerative-style classification and facet analysis to arrange their indexing terms. A number of the facets used in the thesauri are not homogeneous or mutually exclusive. The principle of synthesis is used in only 50% of the thesauri, and no one citation order is used consistently by the thesauri.
  5. Pollard, R.: Hypertext presentation of thesauri used in on-line searching (1990) 0.00 
    0.0034331365 = product of:
  0.013732546 = sum of:
    0.013732546 = weight(_text_:information in 4892) [ClassicSimilarity], result of:
      0.013732546 = score(doc=4892,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.1551638 = fieldWeight in 4892, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=4892)
  0.25 = coord(1/4)
    Abstract
    Explores the strengths and limitations of hypertext for the online presentation of thesauri used in information retrieval. Examines the ability of hypertext to support each of 3 common types of thesaurus display: graphic, alphabetical, and hierarchical. Presents a design for a hypertext-based hierarchical display that addresses many inadequacies of printed hierarchical displays. Ullustrates how the design might be implemented using a commercially available hypertext system. Considers issues related to the implementation and evaluation of hypertext-based thesauri
  6. Krooks, D.A.; Lancaster, F.W.: ¬The evolution of guidelines for thesaurus construction (1993) 0.00 
    0.0034331365 = product of:
  0.013732546 = sum of:
    0.013732546 = weight(_text_:information in 7128) [ClassicSimilarity], result of:
      0.013732546 = score(doc=7128,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.1551638 = fieldWeight in 7128, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=7128)
  0.25 = coord(1/4)
    Abstract
    This piece of research traces the evolution of guidelines and principles for the construction of information retrieval thesauri from 1959 to 1993. We conclude that the majority of the basic problems of thesaurus construction has already been identified and solved by 1967 and that Eugene Wall, more than any other individual, has profoundly influenced the entire development in this area
  7. Rorvig, M.E.; Turner, C.H.; Moncada, J.: ¬The NASA Image Collection Visual Thesaurus (1999) 0.00 
    0.0034331365 = product of:
  0.013732546 = sum of:
    0.013732546 = weight(_text_:information in 3919) [ClassicSimilarity], result of:
      0.013732546 = score(doc=3919,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.1551638 = fieldWeight in 3919, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=3919)
  0.25 = coord(1/4)
    Source
    Journal of the American Society for Information Science. 50(1999) no.9, S.794-798
  8. Schmitz-Esser, W.: ¬Ein Thesaurus als Teil eines terminologischen Lexikons (1995) 0.00 
    0.0034331365 = product of:
  0.013732546 = sum of:
    0.013732546 = weight(_text_:information in 2075) [ClassicSimilarity], result of:
      0.013732546 = score(doc=2075,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.1551638 = fieldWeight in 2075, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=2075)
  0.25 = coord(1/4)
    Abstract
    Der Beitrag enthält die Vorstellung des Entwurfs eines neuen Thesaurus-Konzepts, der vom Komitee für Thesaurusforschung der Deutschen Gesellschaft für Dokumentation entwickelt worden ist. In diesem Konzept soll der Thesaurus nicht allein dem Information Retrieval dienen, es soll als terminologisches Werkzeug auf möglichst allen Feldern des 'Linguistic engineering' eingesetzt werden können.
  9. Zimmermann, H.H.: Überlegungen zu einem multilingualen Thesaurus-Konzept (1995) 0.00 
    0.0034331365 = product of:
  0.013732546 = sum of:
    0.013732546 = weight(_text_:information in 2076) [ClassicSimilarity], result of:
      0.013732546 = score(doc=2076,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.1551638 = fieldWeight in 2076, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=2076)
  0.25 = coord(1/4)
    Abstract
    Die Thesaurus-Thematik wird zunächst in den Zusammenhang der gesamten Erschließungs- und Retrievalmöglichkeiten eines Information-Retrieval-Systems gestellt. Auf dieser Grundlage wird ein multilinguales Thesaurus-Konzept entwickelt. Wichtige Elemente sind: die Ermöglichung des Zugangs anhand des Benutzervokabulars, eine systematische, transparente Bedeutungsdifferenzierung und eine Basis-Relationierung anhand einer einzigen ("ausgezeichneten") natürlichen Sprache.
  10. Schmitz-Esser, W.: New approaches in thesaurus application (1991) 0.00 
    0.0030039945 = product of:
  0.012015978 = sum of:
    0.012015978 = weight(_text_:information in 2111) [ClassicSimilarity], result of:
      0.012015978 = score(doc=2111,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13576832 = fieldWeight in 2111, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2111)
  0.25 = coord(1/4)
    Abstract
    To show the difference and explain the move to a new kind of thesauri in the information science area, some of the main characteristics of conventional thesauri are pointed out as well as their side-effects. The new approaches for thesauri apllication are seen to exist in (1) expert systems, (2) interface systems, (3) object oriented design and programming, (4) hypertext systems, (5) machine translation, and (6) machine abstracting. These areas are shortly described including also the new problem which they might create. A discussion of the limitations of the new thesaurus application areas finishes the article which challenges, finally, an awareness to meet the new possibilities of a thesaural retrieval
  11. Jones, S.; Gatford, M.; Robertson, S.; Hancock-Beaulieu, M.; Secker, J.; Walker, S.: Interactive thesaurus navigation : intelligence rules OK? (1995) 0.00 
    0.0030039945 = product of:
  0.012015978 = sum of:
    0.012015978 = weight(_text_:information in 180) [ClassicSimilarity], result of:
      0.012015978 = score(doc=180,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13576832 = fieldWeight in 180, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=180)
  0.25 = coord(1/4)
    Source
    Journal of the American Society for Information Science. 46(1995) no.1, S.52-59
  12. Cote, C.: Creation d'un thesaurus bilingue en gerontologie et geriatrie : rapport d'etape (1997) 0.00 
    0.0030039945 = product of:
  0.012015978 = sum of:
    0.012015978 = weight(_text_:information in 985) [ClassicSimilarity], result of:
      0.012015978 = score(doc=985,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13576832 = fieldWeight in 985, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=985)
  0.25 = coord(1/4)
    Abstract
    The ageing of the world population has focused attention on both geriatrics and gerontology and the past few years have seen the emergence of a holistic approach to serving the needs of elderly people. This has resulted in a need to harmonize the terminology of both domains. Reports developments in the creation of a bilingual controlled vocabulary in gerontology and geriatrics, a project undertaken jointly by the Graduate School of Library and Information Studies at McGill University and the Centre hospitalier Côte-des-Neiges in Quebec focusing on: the definition and purpose of the thesaurus; methodology; the user; communication between the 2 participants; choice of software; and verification of the vocabulary
  13. Hudon, M.: Multilingual thesaurus construction : integrating the views of different cultures in one gateway to knowledge and concepts (1997) 0.00 
    0.0030039945 = product of:
  0.012015978 = sum of:
    0.012015978 = weight(_text_:information in 1804) [ClassicSimilarity], result of:
      0.012015978 = score(doc=1804,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13576832 = fieldWeight in 1804, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1804)
  0.25 = coord(1/4)
    Source
    Information services and use. 17(1997) nos.2/3, S.111-123
  14. Sator, K.: ¬Die Pressedokumentation beim Deutschen Bundestag : Probleme der Einführung eines Thesaurus (1998) 0.00 
    0.0030039945 = product of:
  0.012015978 = sum of:
    0.012015978 = weight(_text_:information in 2104) [ClassicSimilarity], result of:
      0.012015978 = score(doc=2104,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13576832 = fieldWeight in 2104, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2104)
  0.25 = coord(1/4)
    Source
    nfd Information - Wissenschaft und Praxis. 49(1998) H.6, S.353-360
  15. Chmielewska-Gorczycy, E.: Funkcje tezaurusa w systemie informacy jno-wyszzukiwawczm (1995) 0.00 
    0.0030039945 = product of:
  0.012015978 = sum of:
    0.012015978 = weight(_text_:information in 3227) [ClassicSimilarity], result of:
      0.012015978 = score(doc=3227,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13576832 = fieldWeight in 3227, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3227)
  0.25 = coord(1/4)
    Footnote
    Übers. d. Titels: Functions of thesaurus in information retrievals systems
  16. Chen, H.; Ng, T.: ¬An algorithmic approach to concept exploration in a large knowledge network (automatic thesaurus consultation) : symbolic branch-and-bound search versus connectionist Hopfield Net Activation (1995) 0.00 
    0.0025748524 = product of:
  0.01029941 = sum of:
    0.01029941 = weight(_text_:information in 2203) [ClassicSimilarity], result of:
      0.01029941 = score(doc=2203,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.116372846 = fieldWeight in 2203, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=2203)
  0.25 = coord(1/4)
    Source
    Journal of the American Society for Information Science. 46(1995) no.5, S.348-369
  17. Fischer, D.H.; Möhr, W.; Rostek, L.: ¬A modular, object-oriented and generic approach for building terminology maintenance systems (1996) 0.00 
    0.0025748524 = product of:
  0.01029941 = sum of:
    0.01029941 = weight(_text_:information in 6345) [ClassicSimilarity], result of:
      0.01029941 = score(doc=6345,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.116372846 = fieldWeight in 6345, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=6345)
  0.25 = coord(1/4)
    Abstract
    Five years ago, we raised the question: is there a data model which is general enough such that all existing thesauri can be represented by a specialization of this general model without loss of information? The answer was not given at that time, but we referred to the principle of abstraction, well supported in object-oriented data modelling. We gained the empirical basis for that process of abstraction by modelling existing thesauri and a terminological dictionary; an abstracting view was afterwards presented in a paper to the TKE'93 conference. The present paper reports on a third step of abstraction with its very concrete consequences, embodies in a software called TerminologyFramework(TFw)
  18. Sarre, F.; Güntzer, U.; Myka, A.; Jüttner, G.: Maschinelles Lernen von Relationen für Thesauri und Hypertext (1992) 0.00 
    0.0021457102 = product of:
  0.008582841 = sum of:
    0.008582841 = weight(_text_:information in 1368) [ClassicSimilarity], result of:
      0.008582841 = score(doc=1368,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.09697737 = fieldWeight in 1368, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1368)
  0.25 = coord(1/4)
    Abstract
    Fortschrittliche Informationssysteme stellen ihren Benutzern 2 wichtige Suchmethoden zur Verfügung: die gezielte (Volltext-) Suche und das Navigieren im Objektbestand mit Hilfe von Hypertext-Links. Der Grund, warum diese beiden Konzepte aber auf breiter Basis noch nicht in jedem Informationssystem Anwendung gefunden haben, ist darin zu sehen, daß der manuelle Aufbau von umfassenden Hypertext-Strukturen auf der einen Seite und von großen Thesauri, die den Erfolg von Volltextsuchen wesentlich steigern, auf der anderen Seite bislang enormen Aufwand und damit hohe Kosten verursachte. Langfristig werden Informationssysteme aber nur dann große Akzeptanz bei der Benutzerschaft erzielen, wenn sie ihre Benutzer mit diesen beiden Techniken unterstützen und wenn sie dynamisch neuen Informationsbedürfnissen anpassen können, also lernfähig sind. Für den einzelnen Benutzer ergibt sich daraus der wesentliche Vorteil, daß er von den Recherche-Erfahrungen anderer Benutzer profitieren kann. In diesem Papier stellen wir eine Lernkomponente vor, die für das Hypertextsystem 'HyperMan' an der TU München entwickelt und implementiert wurde. Wir zeigen beispielhaft, wie Volltext-Suchanfragen der HyperMan-Benutzer von der Lernkomponente untersucht werden, um Thesauruseinträge zu gewinnen. Bei der Entwicklung dieser Lerntechniken zum (automatischen) Thesaurusaufbau konnte auf Erfahrungen mit dem lernfähigen Information Retrieval System 'Tegen' zurückgegriffen werden. In dem HyperMan System werden aber nicht nur Beziehungen (Relationen) zwischen Begriffen erlernt, sondern auch zwischen Textstücken. Wir gehen daher auch darauf ein, wie aufgrund einer Analyse des Benutzerverhaltens sowohl neue Hypertext-Links erlernt als auch vorhandene Links, die zuvor von HyperMans Generierungskomponente automatisch erzeugt wurden, modifiziert werden
  19. Chen, H.; Yim, T.; Fye, D.: Automatic thesaurus generation for an electronic community system (1995) 0.00 
    0.0021457102 = product of:
  0.008582841 = sum of:
    0.008582841 = weight(_text_:information in 2918) [ClassicSimilarity], result of:
      0.008582841 = score(doc=2918,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.09697737 = fieldWeight in 2918, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2918)
  0.25 = coord(1/4)
    Source
    Journal of the American Society for Information Science. 46(1995) no.3, S.175-193

Authors

Languages

  • e 58
  • d 11
  • f 5
  • sp 4
  • pl 1
  • More… Less…

Themes