Search (59 results, page 1 of 3)

0.089170754 = product of:
  0.13375613 = sum of:
    0.11678971 = weight(_text_:interest in 2259) [ClassicSimilarity], result of:
      0.11678971 = score(doc=2259,freq=4.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.46577424 = fieldWeight in 2259, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=2259)
    0.016966416 = product of:
      0.03393283 = sum of:
        0.03393283 = weight(_text_:classification in 2259) [ClassicSimilarity], result of:
          0.03393283 = score(doc=2259,freq=2.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.21111822 = fieldWeight in 2259, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=2259)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

An ontology is "an explicit conceptualization of a domain of discourse, and thus provides a shared and common understanding of the domain." We have been producing ontologies for millennia to understand and explain our rationale and environment. From Plato's philosophical framework to modern day classification systems, ontologies are, in most cases, the product of extensive analysis and categorization. Only recently has the process of building ontologies become a research topic of interest. Today, ontologies are built very much ad-hoc. A terminology is first developed providing a controlled vocabulary for the subject area or domain of interest, then it is organized into a taxonomy where key concepts are identified, and finally these concepts are defined and related to create an ontology. The intent of this paper is to show that domain analysis methods can be used for building ontologies. Domain analysis aims at generic models that represent groups of similar systems within an application domain. In this sense, it deals with categorization of common objects and operations, with clear, unambiguous definitions of them and with defining their relationships.

0.04582061 = product of:
  0.06873091 = sum of:
    0.055055197 = weight(_text_:interest in 1163) [ClassicSimilarity], result of:
      0.055055197 = score(doc=1163,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.21956807 = fieldWeight in 1163, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.03125 = fieldNorm(doc=1163)
    0.013675713 = product of:
      0.027351426 = sum of:
        0.027351426 = weight(_text_:22 in 1163) [ClassicSimilarity], result of:
          0.027351426 = score(doc=1163,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.15476047 = fieldWeight in 1163, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=1163)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

This paper addresses the problem of information discovery in large collections of text. For users, one of the key problems in working with such collections is determining where to focus their attention. In selecting documents for examination, users must be able to formulate reasonably precise queries. Queries that are too broad will greatly reduce the efficiency of information discovery efforts by overwhelming the users with peripheral information. In order to formulate efficient queries, a mechanism is needed to automatically alert users regarding potentially interesting information contained within the collection. This paper presents the results of an experiment designed to test one approach to generation of such alerts. The technique of latent semantic indexing (LSI) is used to identify relationships among entities of interest. Entity extraction software is used to pre-process the text of the collection so that the LSI space contains representation vectors for named entities in addition to those for individual terms. In the LSI space, the cosine of the angle between the representation vectors for two entities captures important information regarding the degree of association of those two entities. For appropriate choices of entities, determining the entity pairs with the highest mutual cosine values yields valuable information regarding the contents of the text collection. The test database used for the experiment consists of 150,000 news articles. The proposed approach for alert generation is tested using a counterterrorism analysis example. The approach is shown to have significant potential for aiding users in rapidly focusing on information of potential importance in large text collections. The approach also has value in identifying possible use of aliases.

Source

Proceedings of the Fourth Workshop on Link Analysis, Counterterrorism, and Security, SIAM Data Mining Conference, Bethesda, MD, 20-22 April, 2006. [http://www.siam.org/meetings/sdm06/workproceed/Link%20Analysis/15.pdf]

0.04164443 = product of:
  0.12493329 = sum of:
    0.12493329 = sum of:
      0.056554716 = weight(_text_:classification in 3280) [ClassicSimilarity], result of:
        0.056554716 = score(doc=3280,freq=2.0), product of:
          0.16072905 = queryWeight, product of:
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.05046903 = queryNorm
          0.35186368 = fieldWeight in 3280, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.078125 = fieldNorm(doc=3280)
      0.06837857 = weight(_text_:22 in 3280) [ClassicSimilarity], result of:
        0.06837857 = score(doc=3280,freq=2.0), product of:
          0.17673394 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05046903 = queryNorm
          0.38690117 = fieldWeight in 3280, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.078125 = fieldNorm(doc=3280)
  0.33333334 = coord(1/3)

Source

Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou

0.038929906 = product of:
  0.11678971 = sum of:
    0.11678971 = weight(_text_:interest in 2091) [ClassicSimilarity], result of:
      0.11678971 = score(doc=2091,freq=4.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.46577424 = fieldWeight in 2091, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=2091)
  0.33333334 = coord(1/3)

Abstract

The ever growing popularity of the Internet as a source of information, coupled with the accompanying growth in the number of documents made available through the World Wide Web, is leading to an increasing demand for more efficient and accurate information retrieval tools. Numerous techniques have been proposed and tried for improving the effectiveness of searching the World Wide Web for documents relevant to a given topic of interest. The specification of appropriate keywords and phrases by the user is crucial for the successful execution of a query as measured by the relevance of documents retrieved. Lack of users' knowledge an the search topic and their changing information needs often make it difficult for them to find suitable keywords or phrases for a query. This results in searches that fail to cover all likely aspects of the topic of interest. We describe a scheme that attempts to remedy this situation by automatically expanding the user query through the analysis of initially retrieved documents. Experimental results to demonstrate the effectiveness of the query expansion scheure are presented.

0.038929906 = product of:
  0.11678971 = sum of:
    0.11678971 = weight(_text_:interest in 5147) [ClassicSimilarity], result of:
      0.11678971 = score(doc=5147,freq=4.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.46577424 = fieldWeight in 5147, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=5147)
  0.33333334 = coord(1/3)

Abstract

A model of browsing-based conceptual information retrieval is proposed employing two different types of dictionaries, a global dictionary and a local dictionary. A global dictionary with the authorized terms is utilized to capture the commonly acknowledgeable conceptual relation between a query and a document by replacing their keywords with the dictionary terms. The documents are ranked by the conceptual closeness to a query, and are arranged in the form of a user's personal digital library, or pDL. In a pDL a user can browse the arranged documents based an a suggestion about which documents are worth examining. This suggestion is made by the information in a local dictionary that is organized so as to reflect a user's interest and the association of keywords with the documents. Experiments for testing the retrieval performance of utilizing the two types of dictionaries were also performed using Standard test collections.

0.027527599 = product of:
  0.082582794 = sum of:
    0.082582794 = weight(_text_:interest in 2876) [ClassicSimilarity], result of:
      0.082582794 = score(doc=2876,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.3293521 = fieldWeight in 2876, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=2876)
  0.33333334 = coord(1/3)

Abstract

In this paper, we propose a linguistically-motivated query expansion framework that recognizes and encodes significant query constituents characterizing query intent in order to improve retrieval performance. Concepts-of-Interest are recognized as the core concepts that represent the gist of the search goal whilst the remaining query constituents which serve to specify the search goal and complete the query structure are classified as descriptive, relational or structural. Acknowledging the need to form semantically-associated base pairs for the purpose of extracting related potential expansion concepts, an algorithm which capitalizes on syntactical dependencies to capture relationships between adjacent and non-adjacent query concepts is proposed. Lastly, a robust weighting scheme that duly emphasizes the importance of query constituents based on their linguistic role within the expanded query is presented. We demonstrate improvements in retrieval effectiveness in terms of increased mean average precision garnered by the proposed linguistic-based query expansion framework through experimentation on the TREC ad hoc test collections.

0.022939665 = product of:
  0.068818994 = sum of:
    0.068818994 = weight(_text_:interest in 580) [ClassicSimilarity], result of:
      0.068818994 = score(doc=580,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.27446008 = fieldWeight in 580, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.0390625 = fieldNorm(doc=580)
  0.33333334 = coord(1/3)

Abstract

In our query language introduced in Part I (Journal of the American Society for Information Science and Technology. 58(2007) no.11, S.1559-1568) the user can formulate queries to find out (possibly complex) semantic relationships among entities. In this article we demonstrate the usage of our query language and discuss the new applications that it supports. We categorize several query types and give sample queries. The query types are categorized based on whether the entities specified in a query are known or unknown to the user in advance, and whether text information in documents is utilized. Natural language is used to represent the results of queries in order to facilitate correct interpretation by the user. We discuss briefly the issues related to the prototype implementation of the query language and show that an independent operation like Rho (Sheth et al., 2005; Anyanwu & Sheth, 2002, 2003), which presupposes entities of interest to be known in advance, is exceedingly inefficient in emulating the behavior of our query language. The discussion also covers potential problems, and challenges for future work.

0.022939665 = product of:
  0.068818994 = sum of:
    0.068818994 = weight(_text_:interest in 4913) [ClassicSimilarity], result of:
      0.068818994 = score(doc=4913,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.27446008 = fieldWeight in 4913, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4913)
  0.33333334 = coord(1/3)

Content

Table of contents 1. Introduction 2. Query Intent 3. Personal Interest 4. Document Quality 5. Contextual Search Evaluation 6. Conclusions Acknowledgements References A. Implementations

0.016116984 = product of:
  0.04835095 = sum of:
    0.04835095 = product of:
      0.0967019 = sum of:
        0.0967019 = weight(_text_:22 in 1352) [ClassicSimilarity], result of:
          0.0967019 = score(doc=1352,freq=4.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.54716086 = fieldWeight in 1352, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=1352)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 2.2003 17:25:39
22. 2.2003 18:17:40

0.016057767 = product of:
  0.0481733 = sum of:
    0.0481733 = weight(_text_:interest in 1164) [ClassicSimilarity], result of:
      0.0481733 = score(doc=1164,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.19212207 = fieldWeight in 1164, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.02734375 = fieldNorm(doc=1164)
  0.33333334 = coord(1/3)

Abstract

Multilingual text retrieval can be defined as selection of useful documents from collections that may contain several languages (English, French, Chinese, etc.). This formulation allows for the possibility that individual documents might contain more than one language, a common occurrence in some applications. Both cross-language and within-language retrieval are included in this formulation, but it is the cross-language aspect of the problem which distinguishes multilingual text retrieval from its well studied monolingual counterpart. At the SIGIR 96 workshop on "Cross-Linguistic Information Retrieval" the participants discussed the proliferation of terminology being used to describe the field and settled on "Cross-Language" as the best single description of the salient aspect of the problem. "Multilingual" was felt to be too broad, since that term has also been used to describe systems able to perform within-language retrieval in more than one language but that lack any cross-language capability. "Cross-lingual" and "cross-linguistic" were felt to be equally good descriptions of the field, but "crosslanguage" was selected as the preferred term in the interest of standardization. Unfortunately, at about the same time the U.S. Defense Advanced Research Projects Agency (DARPA) introduced "translingual" as their preferred term, so we are still some distance from reaching consensus on this matter.

0.015955 = product of:
  0.047864996 = sum of:
    0.047864996 = product of:
      0.09572999 = sum of:
        0.09572999 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
          0.09572999 = score(doc=2134,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.5416616 = fieldWeight in 2134, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=2134)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

30. 3.2001 13:32:22

0.011396429 = product of:
  0.034189284 = sum of:
    0.034189284 = product of:
      0.06837857 = sum of:
        0.06837857 = weight(_text_:22 in 2751) [ClassicSimilarity], result of:
          0.06837857 = score(doc=2751,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.38690117 = fieldWeight in 2751, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=2751)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

1. 2.2016 18:25:22

0.011396429 = product of:
  0.034189284 = sum of:
    0.034189284 = product of:
      0.06837857 = sum of:
        0.06837857 = weight(_text_:22 in 2754) [ClassicSimilarity], result of:
          0.06837857 = score(doc=2754,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.38690117 = fieldWeight in 2754, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=2754)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

1. 2.2016 18:25:22

0.011396429 = product of:
  0.034189284 = sum of:
    0.034189284 = product of:
      0.06837857 = sum of:
        0.06837857 = weight(_text_:22 in 3279) [ClassicSimilarity], result of:
          0.06837857 = score(doc=3279,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.38690117 = fieldWeight in 3279, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=3279)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou

0.011281889 = product of:
  0.033845667 = sum of:
    0.033845667 = product of:
      0.06769133 = sum of:
        0.06769133 = weight(_text_:22 in 5295) [ClassicSimilarity], result of:
          0.06769133 = score(doc=5295,freq=4.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.38301262 = fieldWeight in 5295, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5295)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 7.2006 17:56:22

0.01053835 = product of:
  0.03161505 = sum of:
    0.03161505 = product of:
      0.0632301 = sum of:
        0.0632301 = weight(_text_:classification in 1083) [ClassicSimilarity], result of:
          0.0632301 = score(doc=1083,freq=10.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.39339557 = fieldWeight in 1083, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1083)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Researchers in indexing and retrieval systems have been advocating the inclusion of more contextual information to improve results. The proliferation of full-text databases and advances in computer storage capacity have made it possible to carry out text analysis by means of linguistic and extra-linguistic knowledge. Since the mid 80s, research has tended to pay more attention to context, giving discourse analysis a more central role. The research presented in this paper aims to check whether discourse variables have an impact on modern information retrieval and classification algorithms. In order to evaluate this hypothesis, a functional framework for information analysis in an automated environment has been proposed, where the n-grams (filtering) and the k-means and Chen's classification algorithms have been tested against sub-collections of documents based on the following discourse variables: "Genre", "Register", "Domain terminology", and "Document structure". The results obtained with the algorithms for the different sub-collections were compared to the MeSH information structure. These demonstrate that n-grams does not appear to have a clear dependence on discourse variables, though the k-means classification algorithm does, but only on domain terminology and document structure, and finally Chen's algorithm has a clear dependence on all of the discourse variables. This information could be used to design better classification algorithms, where discourse variables should be taken into account. Other minor conclusions drawn from these results are also presented.

0.01053835 = product of:
  0.03161505 = sum of:
    0.03161505 = product of:
      0.0632301 = sum of:
        0.0632301 = weight(_text_:classification in 2299) [ClassicSimilarity], result of:
          0.0632301 = score(doc=2299,freq=10.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.39339557 = fieldWeight in 2299, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2299)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Subjects in a classification scheme are often related to other subjects belonging to different hierarchies. This problem was identified already by Hugh of Saint Victor (1096?-1141). Still with present-time bibliographic classifications, a user browsing the class of architecture under the hierarchy of arts may miss relevant items classified in building or in civil engineering under the hierarchy of applied sciences. To face these limitations we have developed SciGator, a browsable interface to explore the collections of all scientific libraries at the University of Pavia. Besides showing subclasses of a given class, the interface points users to related classes in the Dewey Decimal Classification, or in other local schemes, and allows for expanded queries that include them. This is made possible by using a special field for related classes in the database structure which models classification authority data. Ontologically, many relationships between classes in different hierarchies are cases of existential dependence. Dependence can occur between disciplines in such disciplinary classifications as Dewey (e.g. architecture existentially depends on building), or between phenomena in such phenomenon-based classifications as the Integrative Levels Classification (e.g. fishing as a human activity existentially depends on fish as a class of organisms). We provide an example of its representation in OWL and discuss some details of it.

Source

Classification and authority control: expanding resource discovery: proceedings of the International UDC Seminar 2015, 29-30 October 2015, Lisbon, Portugal. Eds.: Slavic, A. u. M.I. Cordeiro

0.009975315 = product of:
  0.029925944 = sum of:
    0.029925944 = product of:
      0.05985189 = sum of:
        0.05985189 = weight(_text_:classification in 1254) [ClassicSimilarity], result of:
          0.05985189 = score(doc=1254,freq=14.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.37237754 = fieldWeight in 1254, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03125 = fieldNorm(doc=1254)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Knowledge management in digital libraries is a universal problem. Keyword-based searching is applied everywhere no matter whether the resources are indexed databases or full-text Web pages. In keyword matching, the valuable content description and indexing of the metadata, such as the subject descriptors and the classification notations, are merely treated as common keywords to be matched with the user query. Without the support of vocabulary control tools, such as classification systems and thesauri, the intelligent labor of content analysis, description and indexing in metadata production are seriously wasted. New retrieval paradigms are needed to exploit the potential of the metadata resources. Could classification and thesauri, which contain the condensed intelligence of generations of librarians, be used in a digital library to organize the networked information, especially metadata, to facilitate their usability and change the digital library into a knowledge management environment? To examine that question, we designed and implemented a new paradigm that incorporates a classification system, a thesaurus and metadata. The classification and the thesaurus are merged into a concept network, and the metadata are distributed into the nodes of the concept network according to their subjects. The abstract concept node instantiated with the related metadata records becomes a knowledge node. A coherent and consistent knowledge network is thus formed. It is not only a framework for resource organization but also a structure for knowledge navigation, retrieval and learning. We have built an experimental system based on the Chinese Classification and Thesaurus, which is the most comprehensive and authoritative in China, and we have incorporated more than 5000 bibliographic records in the computing domain from the Peking University Library. The result is encouraging. In this article, we review the tools, the architecture and the implementation of our experimental system, which is called Vision.

0.009795565 = product of:
  0.029386694 = sum of:
    0.029386694 = product of:
      0.058773387 = sum of:
        0.058773387 = weight(_text_:classification in 1251) [ClassicSimilarity], result of:
          0.058773387 = score(doc=1251,freq=6.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.3656675 = fieldWeight in 1251, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=1251)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

This paper presents an evaluation study of the navigation effectiveness of a multifaceted organizational taxonomy that was built on the Dewey Decimal Classification and several domain thesauri in the area of library and information science education. The objective of the evaluation was to detect deficiencies in the taxonomy and to infer problems of applied construction steps from users' navigation difficulties. The evaluation approach included scenario-based navigation exercises and postexercise interviews. Navigation exercise errors and underlying reasons were analyzed in relation to specific components of the taxonomy and applied construction steps. Guidelines for the construction of the hierarchical structure and categories of an organizational taxonomy using existing general classification schemes and domain thesauri were derived from the evaluation results.

0.009795565 = product of:
  0.029386694 = sum of:
    0.029386694 = product of:
      0.058773387 = sum of:
        0.058773387 = weight(_text_:classification in 3102) [ClassicSimilarity], result of:
          0.058773387 = score(doc=3102,freq=6.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.3656675 = fieldWeight in 3102, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=3102)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Dewey Decimal Classification has been used to organize materials owned by the three scientific libraries at the University of Pavia, and to allow integrated browsing in their union catalogue through SciGator, a home built web-based user interface. Classification acts as a bridge between collections located in different places and shelved according to different local schemes. Furthermore, cross-discipline relationships recorded in the system allow for expanded queries that increase recall. Advantages and possible improvements of such a system are discussed.