Search (126 results, page 3 of 7)

0.0092261685 = product of:
  0.04613084 = sum of:
    0.04613084 = weight(_text_:system in 4431) [ClassicSimilarity], result of:
      0.04613084 = score(doc=4431,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.34448233 = fieldWeight in 4431, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4431)
  0.2 = coord(1/5)

Abstract

This paper describes the Laurin thesaurus, which is used for indexing and searching in the Laurin system, a software package for digital clipping archives. As a multilingual thesaurus it complies with the corresponding standards, though presenting some approaches going beyond some of the standards' recommendations. The Laurin thesaurus integrates all kind of indexing terms, not only keywords, but proper names as well. The system of categories and relationships is described in detail.

0.008970084 = product of:
  0.044850416 = sum of:
    0.044850416 = weight(_text_:index in 1462) [ClassicSimilarity], result of:
      0.044850416 = score(doc=1462,freq=2.0), product of:
        0.18579477 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.04251826 = queryNorm
        0.24139762 = fieldWeight in 1462, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1462)
  0.2 = coord(1/5)

Abstract

A thesaurus is a controlled vocabulary designed to allow for effective information retrieval. It con- sists of different kinds of semantic relationships, with the aim of guiding users to the choice of the most suitable index and search terms for expressing a certain concept. The relational semantics of a thesaurus deal with methods to connect terms with related meanings and arc intended to enhance information recall capabilities. In this paper, focused on hierarchical relations, different aspects of the relational semantics of thesauri, and among them the possibility of developing richer structures, are analyzed. Thesauri are viewed as semantic tools providing, for operational purposes, the representation of the meaning of the terms. The paper stresses how theories of semantics, holding different perspectives about the nature of meaning and how it is represented, affect the design of the relational semantics of thesauri. The need for tools capable of representing the complexity of knowledge and of the semantics of terms as it occurs in the literature of their respective subject fields is advocated. It is underlined how this would contribute to improving the retrieval of information. To achieve this goal, even though in a preliminary manner, we explore the possibility of setting against the framework of thesaurus design the notions of language games and hermeneutic horizon.

0.008970084 = product of:
  0.044850416 = sum of:
    0.044850416 = weight(_text_:index in 2913) [ClassicSimilarity], result of:
      0.044850416 = score(doc=2913,freq=2.0), product of:
        0.18579477 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.04251826 = queryNorm
        0.24139762 = fieldWeight in 2913, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2913)
  0.2 = coord(1/5)

Abstract

The information retrieval thesaurus emerged in the 1950s, settled down to a more-or-less standard format in the 1970s and has continued to evolve marginally since then. Throughout its whole lifetime, doubts have been expressed about its efficacy with emphasis latterly on cost-effectiveness. Prolonged testing of different styles of index language in the 1970s failed to settle the doubts. The arena occupied by the debate has moved from small isolated databases in the post-war era to diverse situations nowadays with the whole Internet at one extreme and small in-house collections at the other. Sophisticated statistical techniques now dominate the retrieval landscape on the Internet but leave opportunities for the thesaurus and other knowledge organization techniques in niches such as image libraries and corporate intranets. The promise of an ontology-driven semantic web with linked data resources opens another opportunity. Thus much scope remains for research to establish the usefulness of the thesaurus in these places and to inspire its continuing evolution.

0.008069678 = product of:
  0.040348392 = sum of:
    0.040348392 = weight(_text_:context in 3222) [ClassicSimilarity], result of:
      0.040348392 = score(doc=3222,freq=2.0), product of:
        0.17622331 = queryWeight, product of:
          4.14465 = idf(docFreq=1904, maxDocs=44218)
          0.04251826 = queryNorm
        0.22896172 = fieldWeight in 3222, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.14465 = idf(docFreq=1904, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3222)
  0.2 = coord(1/5)

Abstract

The use of thesaurus-based indexing is a common approach for increasing the performance of information retrieval. In this thesis, we examine the suitability of a thesaurus for a given set of information and evaluate improvements of existing thesauri to get better search results. On this area, we focus on two aspects: 1. We demonstrate an analysis of the indexing results achieved by an automatic document indexer and the involved thesaurus. 2. We propose a method for thesaurus evaluation which is based on a combination of statistical measures and appropriate visualization techniques that support the detection of potential problems in a thesaurus. In this chapter, we give an overview of the context of our work. Next, we briefly outline the basics of thesaurus-based information retrieval and describe the Collexis Engine that was used for our experiments. In Chapter 3, we describe two experiments in automatically indexing documents in the areas of medicine and economics with corresponding thesauri and compare the results to available manual annotations. Chapter 4 describes methods for assessing thesauri and visualizing the result in terms of a treemap. We depict examples of interesting observations supported by the method and show that we actually find critical problems. We conclude with a discussion of open questions and future research in Chapter 5.

0.007908144 = product of:
  0.03954072 = sum of:
    0.03954072 = weight(_text_:system in 5279) [ClassicSimilarity], result of:
      0.03954072 = score(doc=5279,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.29527056 = fieldWeight in 5279, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=5279)
  0.2 = coord(1/5)

Abstract

This paper demonstrates the application of conventional database design techniques to thesaurus representation. The thesaurus is considered as a printed document, as a semantic net, and as a relational database to be used in conjunction with an intelligent information retrieval system. Some issues raised by analysis of two standard thesauri include: the prevalence of compound terms and the representation of term structure; thesaurus redundancy and the extent to which it can be eliminated in machine-readable versions; the difficulty of exploiting thesaurus knowledge originally designed for human rather than automatic interpretation; deriving 'strength of association' measures between terms in a thesaurus considered as a semantic net; facet representation and the need for variations in the data model to cater for structural differences between thesauri. A complete schema of database tables is presented, with an outline suggestion for using the stored information when matching one or more thesaurus terms with a user's query

0.007908144 = product of:
  0.03954072 = sum of:
    0.03954072 = weight(_text_:system in 5202) [ClassicSimilarity], result of:
      0.03954072 = score(doc=5202,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.29527056 = fieldWeight in 5202, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=5202)
  0.2 = coord(1/5)

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

0.007908144 = product of:
  0.03954072 = sum of:
    0.03954072 = weight(_text_:system in 4708) [ClassicSimilarity], result of:
      0.03954072 = score(doc=4708,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.29527056 = fieldWeight in 4708, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=4708)
  0.2 = coord(1/5)

Abstract

The need for thesauri to help users in their search for information in online information systems has been discussed for several decades. Many wide-ranging contributions have been made to solve this problem. Nevertheless, investigation is needed to design a thesaurus structure based on what is relevant for users and generators of information within a specific subject domain. Explores the possibility of creating a thesaurus from the cognitive viewpoint. This approach is based on a system that organizes its representation of knowledge or its classification as closely as possible to the authors' and users' images of the subject domain with the objective of increasing the interaction between users and texts, and thus the communication in a given information retrieval system. Discourse analysis is used as a main method to identify the categories and its relevance for building such a structure is discussed

0.007908144 = product of:
  0.03954072 = sum of:
    0.03954072 = weight(_text_:system in 2826) [ClassicSimilarity], result of:
      0.03954072 = score(doc=2826,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.29527056 = fieldWeight in 2826, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=2826)
  0.2 = coord(1/5)

Abstract

This paper is aimed at assessing the potential of interoperable knowledge organization systems to respond to search strategies in order to retrieve information from databases in the areas of health and biomedicine. An analysis was done on the semantic consistency of synonym grouping of a term selected from the Metathesaurus, the Unified Medical Language System of the National Library of Medicine, based on the characteristics of equivalence proposed in ISO 25964: 2: 2011 and based on the following categories: semantic, morphological, syntactic and typographical variations. This paper highlights the importance of understanding the results of automatic mapping as well as the need for characterization, evaluation and selection of equivalences for preparation of consistent search strategies and presentation of search results in scientific work methodologies.

0.007908144 = product of:
  0.03954072 = sum of:
    0.03954072 = weight(_text_:system in 254) [ClassicSimilarity], result of:
      0.03954072 = score(doc=254,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.29527056 = fieldWeight in 254, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=254)
  0.2 = coord(1/5)

Abstract

Objetivo: Este estudo tem como objetivo compreender como o modelo de dados Simple Knowledge Organization System e seus modelos de extensão tem sido utilizado para promover a interoperabilidade com outros vocabulários e refinar as relações semânticas em tesauros na web. Metodologia: Utiliza a pesquisa documental nos guias de referência dos modelos de dados utilizados para representar os tesauros na web. Resultados: os modelos de dados têm sido utilizados para representar os termos e suas variações linguísticas, os relacionamentos entre grupos e subgrupos de conceitos, numa perspectiva intra-vocabulários, e os relacionamentos entre conceitos de vocabulários distintos, numa perspectiva inter-vocabulários. Conclusões: O uso do Simple Knowledge Organization System, e dos seus modelos de extensão contribuem para uma melhor estruturação dos conceitos em tesauros. Os modelos de extensão são apropriados para a representação dos relacionamentos de equivalência compostos, ou para a estruturação de grupos e subgrupos de conceitos em tesauros.

0.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 4892) [ClassicSimilarity], result of:
      0.03727935 = score(doc=4892,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 4892, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=4892)
  0.2 = coord(1/5)

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

0.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 5169) [ClassicSimilarity], result of:
      0.03727935 = score(doc=5169,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 5169, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=5169)
  0.2 = coord(1/5)

Abstract

Open system protocols for search and retrieval have not provided explicit ways in which to implement thesaurus-aided searching. A number of different approaches within the existing protocols, as well as a proposed service, are evaluated. A general approach to implementing thesaurus-aided searching, particularly during consultation of a thesaurus, requires an entirely new service, whose main features are described

0.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 3744) [ClassicSimilarity], result of:
      0.03727935 = score(doc=3744,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 3744, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=3744)
  0.2 = coord(1/5)

Abstract

Describes a specific application of domain analysis to the construction of thesauri to exploit domain analysis' ability to construct valid domain representations and determine fuzzy limits that normally define specific domains. The system employs a structure, called a Software Thesaurus (developed from a descriptor thesaurus), as a repository to store the information regarding specific domains. The domain representation is constructued semi automatically and can be used as a means of semiautomatic thesaurus generation

0.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 3919) [ClassicSimilarity], result of:
      0.03727935 = score(doc=3919,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 3919, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=3919)
  0.2 = coord(1/5)

Abstract

This article is an unpublished manuscript of a paper presented at the 17th Annual Mid-Year Meeting of the ASIS at Ann Arbor, Mich., May 15-18, 1988. It is the first recorded proposal for visual support of indexing. The system itself was built and developed at NASA in the Johnson space Center Image Archives from 1989 to 1992

0.0071760663 = product of:
  0.03588033 = sum of:
    0.03588033 = weight(_text_:index in 3081) [ClassicSimilarity], result of:
      0.03588033 = score(doc=3081,freq=2.0), product of:
        0.18579477 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.04251826 = queryNorm
        0.1931181 = fieldWeight in 3081, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.03125 = fieldNorm(doc=3081)
  0.2 = coord(1/5)

Abstract

Die Arbeit analysiert die dynamische Entwicklung und den Gebrauch von Thesaurusbegriffen. Zusätzlich konzentriert sie sich auf die Faktoren, die die Zahl von Indexbegriffen pro Dokument oder Zeitschrift beeinflussen. Als Untersuchungsobjekt dienten der MeSH und die entsprechende Datenbank "MEDLINE". Die wichtigsten Konsequenzen sind: 1. Der MeSH-Thesaurus hat sich durch drei unterschiedliche Phasen jeweils logarithmisch entwickelt. Solch einen Thesaurus sollte folgenden Gleichung folgen: "T = 3.076,6 Ln (d) - 22.695 + 0,0039d" (T = Begriffe, Ln = natürlicher Logarithmus und d = Dokumente). Um solch einen Thesaurus zu konstruieren, muss man demnach etwa 1.600 Dokumente von unterschiedlichen Themen des Bereiches des Thesaurus haben. Die dynamische Entwicklung von Thesauri wie MeSH erfordert die Einführung eines neuen Begriffs pro Indexierung von 256 neuen Dokumenten. 2. Die Verteilung der Thesaurusbegriffe erbrachte drei Kategorien: starke, normale und selten verwendete Headings. Die letzte Gruppe ist in einer Testphase, während in der ersten und zweiten Kategorie die neu hinzukommenden Deskriptoren zu einem Thesauruswachstum führen. 3. Es gibt ein logarithmisches Verhältnis zwischen der Zahl von Index-Begriffen pro Aufsatz und dessen Seitenzahl für die Artikeln zwischen einer und einundzwanzig Seiten. 4. Zeitschriftenaufsätze, die in MEDLINE mit Abstracts erscheinen erhalten fast zwei Deskriptoren mehr. 5. Die Findablity der nicht-englisch sprachigen Dokumente in MEDLINE ist geringer als die englische Dokumente. 6. Aufsätze der Zeitschriften mit einem Impact Factor 0 bis fünfzehn erhalten nicht mehr Indexbegriffe als die der anderen von MEDINE erfassten Zeitschriften. 7. In einem Indexierungssystem haben unterschiedliche Zeitschriften mehr oder weniger Gewicht in ihrem Findability. Die Verteilung der Indexbegriffe pro Seite hat gezeigt, dass es bei MEDLINE drei Kategorien der Publikationen gibt. Außerdem gibt es wenige stark bevorzugten Zeitschriften."

0.0065901205 = product of:
  0.032950602 = sum of:
    0.032950602 = weight(_text_:system in 1368) [ClassicSimilarity], result of:
      0.032950602 = score(doc=1368,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.24605882 = fieldWeight in 1368, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1368)
  0.2 = coord(1/5)

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

0.0065901205 = product of:
  0.032950602 = sum of:
    0.032950602 = weight(_text_:system in 6050) [ClassicSimilarity], result of:
      0.032950602 = score(doc=6050,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.24605882 = fieldWeight in 6050, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6050)
  0.2 = coord(1/5)

Content

Enthält die Beiträge: SCHMITZ-ESSER, W.: Language of general communication and concept compatibility; RIESTHUIS, G.: Theory of compatibility of information languages; DAHLBERG, I.: The compatibility guidelines - a re-evaluation; SOERGEL, D.: Data structure and software support for integrated thesauri; MURASZKIEWICZ, M., H. RYBINSKI u. W. STRUK: Software problems of merging multilingual thesauri; CHMIELEWSKA-GORCZYCA, E.: Compatibility of indexing tools in multidatabase environment; NEGRINI, G.: Towards structural compatibility between concept systems; SCIBOR, E.: Some remarks on the establishment of concordances between a universal classification system and an interdisciplinary thesaurus; HOPPE, S.: The UMLS - a model for knowledge integration in a subject field; DEXTRE-CLARKE, S.: Integrating thesauri in the agricultural sciences; ROULIN, C.: Bringing multilingual thesauri together: a feasibility study; ZIMMERMANN, H.: Conception and application possibilities of classification concordances in an OPAC environment; SOSINSKA-KALATA, B.: The Universal Decimal Classification as an international standard for knowledge organization in bibliographic databases and library catalogues; WOZNIAK, J. u. T. GLOWACKA: KABA Subject Authority File - an example of an integrated Polish-French-English subject headings system; BABIK, W.: Terminology as a level for the compatibility of indexing languages - some remarks; STANCIKOVA, P.: International integrated database systems linked to multilingual thesauri covering the field of environment and agriculture; SAMEK, T.: Indexing languages integration and the EUROVOC Thesaurus in the Czech Republic; SIWEK, K.: Compatibility discrepancies between Polish and foreign databases; GLINSKI, W. u. M. MURASZKIEWICZ: An intelligent front-end processor for accessing information systems

0.0065901205 = product of:
  0.032950602 = sum of:
    0.032950602 = weight(_text_:system in 5902) [ClassicSimilarity], result of:
      0.032950602 = score(doc=5902,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.24605882 = fieldWeight in 5902, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5902)
  0.2 = coord(1/5)

Abstract

With networked information access to heterogeneous data sources, the problem of terminology provision and interoperability of controlled vocabulary schemes such as thesauri becomes increasingly urgent. Solutions are needed to improve the performance of full-text retrieval systems and to guide the design of controlled terminology schemes for use in structured data, including metadata. Thesauri are created in different languages, with different scope and points of view and at different levels of abstraction and detail, to accomodate access to a specific group of collections. In any wider search accessing distributed collections, the user would like to start with familiar terminology and let the system find out the correspondences to other terminologies in order to retrieve equivalent results from all addressed collections. This paper investigates possible semantic differences that may hinder the unambiguous mapping and transition from one thesaurus to another. It focusses on the differences of meaning of terms and their relations as intended by their creators for indexing and querying a specific collection, in contrast to methods investigating the statistical relevance of terms for objects in a collection. It develops a notion of optimal mapping, paying particular attention to the intellectual quality of mappings between terms from different vocabularies and to problems of polysemy. Proposals are made to limit the vagueness introduced by the transition from one vocabulary to another. The paper shows ways in which thesaurus creators can improve their methodology to meet the challenges of networked access of distributed collections created under varying conditions. For system implementers, the discussion will lead to a better understanding of the complexity of the problem

0.0065901205 = product of:
  0.032950602 = sum of:
    0.032950602 = weight(_text_:system in 5828) [ClassicSimilarity], result of:
      0.032950602 = score(doc=5828,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.24605882 = fieldWeight in 5828, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5828)
  0.2 = coord(1/5)

Abstract

Some of the fundamental activities of the software development process are related to the discipline of Requirements Engineering, whose objective is the discovery, analysis, documentation and verification of the requirements that will be part of the system. Requirements are the conditions or capabilities that software must have or perform to meet the users needs. The present study is being developed to propose a model of cooperation between Information Science and Requirements Engineering. Aims to present the analysis results on the possibilities of using the knowledge organization systems: taxonomies, thesauri and ontologies during the activities of Requirements Engineering: design, survey, elaboration, negotiation, specification, validation and requirements management. From the results obtained it was possible to identify in which stage of the Requirements Engineering process, each type of knowledge organization system could be used. We expect that this study put in evidence the need for new researchs and proposals to strengt the exchange between Information Science, as a science that has information as object of study, and the Requirements Engineering which has in the information the raw material to identify the informational needs of software users.

0.006523886 = product of:
  0.03261943 = sum of:
    0.03261943 = weight(_text_:system in 180) [ClassicSimilarity], result of:
      0.03261943 = score(doc=180,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.2435858 = fieldWeight in 180, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=180)
  0.2 = coord(1/5)

Abstract

We discuss whether it is feasible to build intelligent rule- or weight-based algorithms into general-purpose software for interactive thesaurus navigation. We survey some approaches to the problem reported in the literature, particularly those involving the assignement of 'link weights' in a thesaurus network, and point out some problems of both principle and practice. We then describe investigations which entailed logging the behavior of thesaurus users and testing the effect of thesaurus-based query enhancement in an IR system using term weighting, in an attempt to identify successful strategies to incorporate into automatic procedures. The results cause us to question many of the assumptions made by previous researchers in this area

0.006523886 = product of:
  0.03261943 = sum of:
    0.03261943 = weight(_text_:system in 1872) [ClassicSimilarity], result of:
      0.03261943 = score(doc=1872,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.2435858 = fieldWeight in 1872, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1872)
  0.2 = coord(1/5)

Abstract

The Unified Medical Language System knowledge source provide detailed information about biomedical naming systems and databases. The Metathesaurus contains biomedical terminology from an increasing number of biomedical thesauri, and the Semantic Netowrk provides a structure that encompasses and unifies the thesauri that are included in the Metathesaurus. Addresses some fundamental principles underlying the design and development of the Metathesaurus and Semantic Network. Describes the formal properties of the semantic network. Considers the principle of semantic locality and how this is reflected in the UMLS knowledge sources. Discusses the issues involved in attempting to reuse knowledge and the potential for reuse of the UMLS knowledge sources