Search (42 results, page 1 of 3)

0.011750447 = product of:
  0.054835416 = sum of:
    0.030062785 = weight(_text_:system in 2836) [ClassicSimilarity], result of:
      0.030062785 = score(doc=2836,freq=10.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.38905317 = fieldWeight in 2836, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2836)
    0.0072343214 = weight(_text_:information in 2836) [ClassicSimilarity], result of:
      0.0072343214 = score(doc=2836,freq=6.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.16796975 = fieldWeight in 2836, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2836)
    0.017538311 = weight(_text_:retrieval in 2836) [ClassicSimilarity], result of:
      0.017538311 = score(doc=2836,freq=4.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.23632148 = fieldWeight in 2836, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2836)
  0.21428572 = coord(3/14)

Abstract

Classification is the process of assigning objects to pre-defined classes based on observations or characteristics of those objects, and there are many approaches to performing this task. The overall objective of this study is to demonstrate the use of two learning techniques to analyze the results of a manual classification system. Our sample consisted of 1,026 documents, from the ACM Computing Classification System, classified by their authors as belonging to one of the groups of the classification system: "H.3 Information Storage and Retrieval." A singular value decomposition of the documents' weighted term-frequency matrix was used to represent each document in a 50-dimensional vector space. The analysis of the representation using both supervised (decision tree) and unsupervised (clustering) techniques suggests that two pairs of the ACM classes are closely related to each other in the vector space. Class 1 (Content Analysis and Indexing) is closely related to Class 3 (Information Search and Retrieval), and Class 4 (Systems and Software) is closely related to Class 5 (Online Information Services). Further analysis was performed to test the diffusion of the words in the two classes using both cosine and Euclidean distance.

Object

Computing Classification System

0.006806179 = product of:
  0.031762168 = sum of:
    0.011050607 = weight(_text_:information in 1107) [ClassicSimilarity], result of:
      0.011050607 = score(doc=1107,freq=14.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.256578 = fieldWeight in 1107, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1107)
    0.012401459 = weight(_text_:retrieval in 1107) [ClassicSimilarity], result of:
      0.012401459 = score(doc=1107,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.16710453 = fieldWeight in 1107, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1107)
    0.008310104 = product of:
      0.016620208 = sum of:
        0.016620208 = weight(_text_:22 in 1107) [ClassicSimilarity], result of:
          0.016620208 = score(doc=1107,freq=2.0), product of:
            0.085914485 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02453417 = queryNorm
            0.19345059 = fieldWeight in 1107, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1107)
      0.5 = coord(1/2)
  0.21428572 = coord(3/14)

Abstract

Retrieval of disease information is often based on several key aspects such as etiology, diagnosis, treatment, prevention, and symptoms of diseases. Automatic identification of disease aspect information is thus essential. In this article, I model the aspect identification problem as a text classification (TC) problem in which a disease aspect corresponds to a category. The disease aspect classification problem poses two challenges to classifiers: (a) a medical text often contains information about multiple aspects of a disease and hence produces noise for the classifiers and (b) text classifiers often cannot extract the textual parts (i.e., passages) about the categories of interest. I thus develop a technique, PETC (Passage Extractor for Text Classification), that extracts passages (from medical texts) for the underlying text classifiers to classify. Case studies on thousands of Chinese and English medical texts show that PETC enhances a support vector machine (SVM) classifier in classifying disease aspect information. PETC also performs better than three state-of-the-art classifier enhancement techniques, including two passage extraction techniques for text classifiers and a technique that employs term proximity information to enhance text classifiers. The contribution is of significance to evidence-based medicine, health education, and healthcare decision support. PETC can be used in those application domains in which a text to be classified may have several parts about different categories.

Date

28.10.2013 19:22:57

Source

Journal of the American Society for Information Science and Technology. 64(2013) no.11, S.2265-2277

0.0062771165 = product of:
  0.043939814 = sum of:
    0.014176315 = weight(_text_:information in 2339) [ClassicSimilarity], result of:
      0.014176315 = score(doc=2339,freq=16.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.3291521 = fieldWeight in 2339, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=2339)
    0.029763501 = weight(_text_:retrieval in 2339) [ClassicSimilarity], result of:
      0.029763501 = score(doc=2339,freq=8.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.40105087 = fieldWeight in 2339, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=2339)
  0.14285715 = coord(2/14)

Abstract

Text classification (TC) is a core technique for text mining and information retrieval. It has been applied to many applications in many different research and industrial areas. Term-weighting schemes assign an appropriate weight to each term to obtain a high TC performance. Although term weighting is one of the important modules for TC and TC has different peculiarities from those in information retrieval, many term-weighting schemes used in information retrieval, such as term frequency-inverse document frequency (tf-idf), have been used in TC in the same manner. The peculiarity of TC that differs most from information retrieval is the existence of class information. This article proposes a new term-weighting scheme that uses class information using positive and negative class distributions. As a result, the proposed scheme, log tf-TRR, consistently performs better than do other schemes using class information as well as traditional schemes such as tf-idf.

Source

Journal of the Association for Information Science and Technology. 66(2015) no.12, S.2553-2565

0.0041704755 = product of:
  0.029193329 = sum of:
    0.02328653 = weight(_text_:system in 4775) [ClassicSimilarity], result of:
      0.02328653 = score(doc=4775,freq=6.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.30135927 = fieldWeight in 4775, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4775)
    0.005906798 = weight(_text_:information in 4775) [ClassicSimilarity], result of:
      0.005906798 = score(doc=4775,freq=4.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.13714671 = fieldWeight in 4775, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4775)
  0.14285715 = coord(2/14)

Abstract

The progressive increase of information content has recently made it necessary to create a system for automatic classification of documents. In this article, a system is presented for the categorization of multiclass Farsi documents that requires fewer training examples and can help to compensate the shortcoming of the standard training dataset. The new idea proposed in the present article is based on extending the feature vector by adding some words extracted from a thesaurus and then filtering the new feature vector by applying secondary feature selection to discard inappropriate features. In fact, a phase of secondary feature selection is applied to choose more appropriate features among the features added from a thesaurus to enhance the effect of using a thesaurus on the efficiency of the classifier. To evaluate the proposed system, a corpus is gathered from the Farsi Wikipedia website and some articles in the Hamshahri newspaper, the Roshd periodical, and the Soroush magazine. In addition to studying the role of a thesaurus and applying secondary feature selection, the effect of a various number of categories, size of the training dataset, and average number of words in the test data also are examined. As the results indicate, classification efficiency improves by applying this approach, especially when available data is not sufficient for some text categories.

Source

Journal of the American Society for Information Science and Technology. 62(2011) no.10, S.2055-2066

0.00410204 = product of:
  0.028714279 = sum of:
    0.0072343214 = weight(_text_:information in 3311) [ClassicSimilarity], result of:
      0.0072343214 = score(doc=3311,freq=6.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.16796975 = fieldWeight in 3311, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3311)
    0.021479957 = weight(_text_:retrieval in 3311) [ClassicSimilarity], result of:
      0.021479957 = score(doc=3311,freq=6.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.28943354 = fieldWeight in 3311, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3311)
  0.14285715 = coord(2/14)

Abstract

Tools for automatic subject assignment help deal with scale and sustainability in creating and enriching metadata, establishing more connections across and between resources and enhancing consistency. Although some software vendors and experimental researchers claim the tools can replace manual subject indexing, hard scientific evidence of their performance in operating information environments is scarce. A major reason for this is that research is usually conducted in laboratory conditions, excluding the complexities of real-life systems and situations. The article reviews and discusses issues with existing evaluation approaches such as problems of aboutness and relevance assessments, implying the need to use more than a single "gold standard" method when evaluating indexing and retrieval, and proposes a comprehensive evaluation framework. The framework is informed by a systematic review of the literature on evaluation approaches: evaluating indexing quality directly through assessment by an evaluator or through comparison with a gold standard, evaluating the quality of computer-assisted indexing directly in the context of an indexing workflow, and evaluating indexing quality indirectly through analyzing retrieval performance.

Series

Advances in information science

Source

Journal of the Association for Information Science and Technology. 67(2016) no.1, S.3-16

0.0026154653 = product of:
  0.018308256 = sum of:
    0.005906798 = weight(_text_:information in 5041) [ClassicSimilarity], result of:
      0.005906798 = score(doc=5041,freq=4.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.13714671 = fieldWeight in 5041, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5041)
    0.012401459 = weight(_text_:retrieval in 5041) [ClassicSimilarity], result of:
      0.012401459 = score(doc=5041,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.16710453 = fieldWeight in 5041, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5041)
  0.14285715 = coord(2/14)

Abstract

Students use general web search engines as their primary source of research while trying to find answers to school-related questions. Although search engines are highly relevant for the general population, they may return results that are out of educational context. Another rising trend; social community question answering websites are the second choice for students who try to get answers from other peers online. We attempt discovering possible improvements in educational search by leveraging both of these information sources. For this purpose, we first implement a classifier for educational questions. This classifier is built by an ensemble method that employs several regular learning algorithms and retrieval based approaches that utilize external resources. We also build a query expander to facilitate classification. We further improve the classification using search engine results and obtain 83.5% accuracy. Although our work is entirely based on the Turkish language, the features could easily be mapped to other languages as well. In order to find out whether search engine ranking can be improved in the education domain using the classification model, we collect and label a set of query results retrieved from a general web search engine. We propose five ad-hoc methods to improve search ranking based on the idea that the query-document category relation is an indicator of relevance. We evaluate these methods for overall performance, varying query length and based on factoid and non-factoid queries. We show that some of the methods significantly improve the rankings in the education domain.

Source

Information processing and management. 56(2019) no.1, S.228-246

0.0025173177 = product of:
  0.017621223 = sum of:
    0.013444485 = weight(_text_:system in 3706) [ClassicSimilarity], result of:
      0.013444485 = score(doc=3706,freq=2.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.17398985 = fieldWeight in 3706, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3706)
    0.004176737 = weight(_text_:information in 3706) [ClassicSimilarity], result of:
      0.004176737 = score(doc=3706,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.09697737 = fieldWeight in 3706, 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=3706)
  0.14285715 = coord(2/14)

Abstract

Document classification presents challenges due to the large number of features, their dependencies, and the large number of training documents. In this research, we investigated the use of six stylistic feature sets (including 42 features) and/or six name-based feature sets (including 234 features) for various combinations of the following classification tasks: ethnic groups of the authors and/or periods of time when the documents were written and/or places where the documents were written. The investigated corpus contains Jewish Law articles written in Hebrew-Aramaic, which present interesting problems for classification. Our system CUISINE (Classification UsIng Stylistic feature sets and/or NamE-based feature sets) achieves accuracy results between 90.71 to 98.99% for the seven classification experiments (ethnicity, time, place, ethnicity&time, ethnicity&place, time&place, ethnicity&time&place). For the first six tasks, the stylistic feature sets in general and the quantitative feature set in particular are enough for excellent classification results. In contrast, the name-based feature sets are rather poor for these tasks. However, for the most complex task (ethnicity&time&place), a hill-climbing model using all feature sets succeeds in significantly improving the classification results. Most of the stylistic features (34 of 42) are language-independent and domain-independent. These features might be useful to the community at large, at least for rather simple tasks.

Source

Journal of the American Society for Information Science and Technology. 61(2010) no.8, S.1644-1657

0.0025173177 = product of:
  0.017621223 = sum of:
    0.013444485 = weight(_text_:system in 2722) [ClassicSimilarity], result of:
      0.013444485 = score(doc=2722,freq=2.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.17398985 = fieldWeight in 2722, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2722)
    0.004176737 = weight(_text_:information in 2722) [ClassicSimilarity], result of:
      0.004176737 = score(doc=2722,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.09697737 = fieldWeight in 2722, 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=2722)
  0.14285715 = coord(2/14)

Source

Information processing and management. 49(2013) no.1, S.83-98

0.0023683137 = product of:
  0.016578196 = sum of:
    0.004176737 = weight(_text_:information in 3627) [ClassicSimilarity], result of:
      0.004176737 = score(doc=3627,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.09697737 = fieldWeight in 3627, 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=3627)
    0.012401459 = weight(_text_:retrieval in 3627) [ClassicSimilarity], result of:
      0.012401459 = score(doc=3627,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.16710453 = fieldWeight in 3627, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3627)
  0.14285715 = coord(2/14)

Abstract

A very important extension of the traditional domain of knowledge organization (KO) arises from attempts to incorporate techniques devised in the computer science domain for automatic concept extraction and for grouping, categorizing, clustering and otherwise organizing knowledge using mechanical means. Four specific terms have emerged to identify the most prevalent techniques: machine learning, clustering, automatic indexing, and automatic classification. Our study presents three domain analytical case analyses in search of answers. The first case relies on citations located using the ISKO-supported "Knowledge Organization Bibliography." The second case relies on works in both Web of Science and SCOPUS. Case three applies co-word analysis and citation analysis to the contents of the papers in the present special issue. We observe scholars involved in "clustering" and "automatic classification" who share common thematic emphases. But we have found no coherence, no common activity and no social semantics. We have not found a research front, or a common teleology within the KO domain. We also have found a lively group of authors who have succeeded in submitting papers to this special issue, and their work quite interestingly aligns with the case studies we report. There is an emphasis on KO for information retrieval; there is much work on clustering (which involves conceptual points within texts) and automatic classification (which involves semantic groupings at the meta-document level).

0.0023683137 = product of:
  0.016578196 = sum of:
    0.004176737 = weight(_text_:information in 5055) [ClassicSimilarity], result of:
      0.004176737 = score(doc=5055,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.09697737 = fieldWeight in 5055, 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=5055)
    0.012401459 = weight(_text_:retrieval in 5055) [ClassicSimilarity], result of:
      0.012401459 = score(doc=5055,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.16710453 = fieldWeight in 5055, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5055)
  0.14285715 = coord(2/14)

Source

Information processing and management. 54(2018) no.4, S.593-608

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.0021406014 = product of:
  0.014984209 = sum of:
    0.0050120843 = weight(_text_:information in 690) [ClassicSimilarity], result of:
      0.0050120843 = score(doc=690,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.116372846 = fieldWeight in 690, 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=690)
    0.009972124 = product of:
      0.019944249 = sum of:
        0.019944249 = weight(_text_:22 in 690) [ClassicSimilarity], result of:
          0.019944249 = score(doc=690,freq=2.0), product of:
            0.085914485 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02453417 = queryNorm
            0.23214069 = fieldWeight in 690, 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=690)
      0.5 = coord(1/2)
  0.14285715 = coord(2/14)

Date

23. 3.2013 13:22:36

Source

Journal of the American Society for Information Science and Technology. 64(2013) no.4, S.844-860

0.0021406014 = product of:
  0.014984209 = sum of:
    0.0050120843 = weight(_text_:information in 2158) [ClassicSimilarity], result of:
      0.0050120843 = score(doc=2158,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.116372846 = fieldWeight in 2158, 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=2158)
    0.009972124 = product of:
      0.019944249 = sum of:
        0.019944249 = weight(_text_:22 in 2158) [ClassicSimilarity], result of:
          0.019944249 = score(doc=2158,freq=2.0), product of:
            0.085914485 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02453417 = queryNorm
            0.23214069 = fieldWeight in 2158, 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=2158)
      0.5 = coord(1/2)
  0.14285715 = coord(2/14)

Date

4. 8.2015 19:22:04

Source

Journal of the Association for Information Science and Technology. 66(2015) no.9, S.1817-1831

0.0020138542 = product of:
  0.014096978 = sum of:
    0.010755588 = weight(_text_:system in 2301) [ClassicSimilarity], result of:
      0.010755588 = score(doc=2301,freq=2.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.13919188 = fieldWeight in 2301, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.03125 = fieldNorm(doc=2301)
    0.0033413896 = weight(_text_:information in 2301) [ClassicSimilarity], result of:
      0.0033413896 = score(doc=2301,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.0775819 = fieldWeight in 2301, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=2301)
  0.14285715 = coord(2/14)

Abstract

Analytico-synthetic and faceted classifications, such as Universal Decimal Classification (UDC) express content of documents with complex, pre-combined classification codes. Without classification authority control that would help manage and access structured notations, the use of UDC codes in searching and browsing is limited. Existing UDC parsing solutions are usually created for a particular database system or a specific task and are not widely applicable. The approach described in this paper provides a solution by which the analysis and interpretation of UDC notations would be stored into an intermediate format (in this case, in XML) by automatic means without any data or information loss. Due to its richness, the output file can be converted into different formats, such as standard mark-up and data exchange formats or simple lists of the recommended entry points of a UDC number. The program can also be used to create authority records containing complex UDC numbers which can be comprehensively analysed in order to be retrieved effectively. The Java program, as well as the corresponding schema definition it employs, is under continuous development. The current version of the interpreter software is now available online for testing purposes at the following web site: http://interpreter-eto.rhcloud.com. The future plan is to implement conversion methods for standard formats and to create standard online interfaces in order to make it possible to use the features of software as a service. This would result in the algorithm being able to be employed both in existing and future library systems to analyse UDC numbers without any significant programming effort.

0.0012527365 = product of:
  0.017538311 = sum of:
    0.017538311 = weight(_text_:retrieval in 2300) [ClassicSimilarity], result of:
      0.017538311 = score(doc=2300,freq=4.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.23632148 = fieldWeight in 2300, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2300)
  0.071428575 = coord(1/14)

Abstract

Subject terms play a crucial role in resource discovery but require substantial effort to produce. Automatic subject classification and indexing address problems of scale and sustainability and can be used to enrich existing bibliographic records, establish more connections across and between resources and enhance consistency of bibliographic data. The paper aims to put forward a complex methodological framework to evaluate automatic classification tools of Swedish textual documents based on the Dewey Decimal Classification (DDC) recently introduced to Swedish libraries. Three major complementary approaches are suggested: a quality-built gold standard, retrieval effects, domain analysis. The gold standard is built based on input from at least two catalogue librarians, end-users expert in the subject, end users inexperienced in the subject and automated tools. Retrieval effects are studied through a combination of assigned and free tasks, including factual and comprehensive types. The study also takes into consideration the different role and character of subject terms in various knowledge domains, such as scientific disciplines. As a theoretical framework, domain analysis is used and applied in relation to the implementation of DDC in Swedish libraries and chosen domains of knowledge within the DDC itself.

0.0011871577 = product of:
  0.016620208 = sum of:
    0.016620208 = product of:
      0.033240415 = sum of:
        0.033240415 = weight(_text_:22 in 2748) [ClassicSimilarity], result of:
          0.033240415 = score(doc=2748,freq=2.0), product of:
            0.085914485 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02453417 = queryNorm
            0.38690117 = fieldWeight in 2748, 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=2748)
      0.5 = coord(1/2)
  0.071428575 = coord(1/14)

Date

1. 2.2016 18:25:22

7.160121E-4 = product of:
  0.0100241685 = sum of:
    0.0100241685 = weight(_text_:information in 587) [ClassicSimilarity], result of:
      0.0100241685 = score(doc=587,freq=8.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.23274569 = fieldWeight in 587, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=587)
  0.071428575 = coord(1/14)

Content

Vgl. unter: http://opus.bsz-bw.de/fhhv/volltexte/2012/397/pdf/Bachelorarbeit_final_Korrektur01.pdf. Bachelorarbeit, Hochschule Hannover, Fakultät III - Medien, Information und Design, Abteilung Information und Kommunikation, Studiengang Informationsmanagement

Imprint

Hannover : Hochschule Hannover, Fakultät III - Medien, Information und Design, Abteilung Information und Kommunikation

5.966767E-4 = product of:
  0.008353474 = sum of:
    0.008353474 = weight(_text_:information in 2852) [ClassicSimilarity], result of:
      0.008353474 = score(doc=2852,freq=8.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.19395474 = fieldWeight in 2852, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2852)
  0.071428575 = coord(1/14)

Abstract

Social tagging is one of the most popular methods for collecting crowd-sourced information in galleries, libraries, archives, and museums (GLAMs). However, when the number of social tags grows rapidly, using them becomes problematic and, as a result, they are often left as simply big data that cannot be used for practical purposes. To revitalize the use of this crowd-sourced information, we propose using social tags to link and cluster artworks based on an experimental study using an online collection at the Gyeonggi Museum of Modern Art (GMoMA). We view social tagging as a folksonomy, where artworks are classified by keywords of the crowd's various interpretations and one artwork can belong to several different categories simultaneously. To leverage this strength of social tags, we used a clustering method called "link communities" to detect overlapping communities in a network of artworks constructed by computing similarities between all artwork pairs. We used this framework to identify semantic relationships and clusters of similar artworks. By comparing the clustering results with curators' manual classification results, we demonstrated the potential of social tagging data for automatically clustering artworks in a way that reflects the dynamic perspectives of crowds.

Source

Journal of the Association for Information Science and Technology. 67(2016) no.4, S.885-899

5.167373E-4 = product of:
  0.0072343214 = sum of:
    0.0072343214 = weight(_text_:information in 2496) [ClassicSimilarity], result of:
      0.0072343214 = score(doc=2496,freq=6.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.16796975 = fieldWeight in 2496, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2496)
  0.071428575 = coord(1/14)

Abstract

Descriptive document clustering aims at discovering clusters of semantically interrelated documents together with meaningful labels to summarize the content of each document cluster. In this work, we propose a novel descriptive clustering framework, referred to as CEDL. It relies on the formulation and generation of 2 types of heterogeneous objects, which correspond to documents and candidate phrases, using multilevel similarity information. CEDL is composed of 5 main processing stages. First, it simultaneously maps the documents and candidate phrases into a common co-embedded space that preserves higher-order, neighbor-based proximities between the combined sets of documents and phrases. Then, it discovers an approximate cluster structure of documents in the common space. The third stage extracts promising topic phrases by constructing a discriminant model where documents along with their cluster memberships are used as training instances. Subsequently, the final cluster labels are selected from the topic phrases using a ranking scheme using multiple scores based on the extracted co-embedding information and the discriminant output. The final stage polishes the initial clusters to reduce noise and accommodate the multitopic nature of documents. The effectiveness and competitiveness of CEDL is demonstrated qualitatively and quantitatively with experiments using document databases from different application fields.

Source

Journal of the Association for Information Science and Technology. 67(2016) no.1, S.106-133

5.167373E-4 = product of:
  0.0072343214 = sum of:
    0.0072343214 = weight(_text_:information in 2706) [ClassicSimilarity], result of:
      0.0072343214 = score(doc=2706,freq=6.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.16796975 = fieldWeight in 2706, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2706)
  0.071428575 = coord(1/14)

Abstract

Transfer learning utilizes labeled data available from some related domain (source domain) for achieving effective knowledge transformation to the target domain. However, most state-of-the-art cross-domain classification methods treat documents as plain text and ignore the hyperlink (or citation) relationship existing among the documents. In this paper, we propose a novel cross-domain document classification approach called Link-Bridged Topic model (LBT). LBT consists of two key steps. Firstly, LBT utilizes an auxiliary link network to discover the direct or indirect co-citation relationship among documents by embedding the background knowledge into a graph kernel. The mined co-citation relationship is leveraged to bridge the gap across different domains. Secondly, LBT simultaneously combines the content information and link structures into a unified latent topic model. The model is based on an assumption that the documents of source and target domains share some common topics from the point of view of both content information and link structure. By mapping both domains data into the latent topic spaces, LBT encodes the knowledge about domain commonality and difference as the shared topics with associated differential probabilities. The learned latent topics must be consistent with the source and target data, as well as content and link statistics. Then the shared topics act as the bridge to facilitate knowledge transfer from the source to the target domains. Experiments on different types of datasets show that our algorithm significantly improves the generalization performance of cross-domain document classification.

Source

Information processing and management. 49(2013) no.6, S.1181-1193

5.06297E-4 = product of:
  0.0070881573 = sum of:
    0.0070881573 = weight(_text_:information in 3331) [ClassicSimilarity], result of:
      0.0070881573 = score(doc=3331,freq=4.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.16457605 = fieldWeight in 3331, 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=3331)
  0.071428575 = coord(1/14)

Abstract

Automatic text classification (TC) is essential for the management of information. To properly classify a document d, it is essential to identify the semantics of each term t in d, while the semantics heavily depend on context (neighboring terms) of t in d. Therefore, we present a technique CTFA (Context-based Term Frequency Assessment) that improves text classifiers by considering term contexts in test documents. The results of the term context recognition are used to assess term frequencies of terms, and hence CTFA may easily work with various kinds of text classifiers that base their TC decisions on term frequencies, without needing to modify the classifiers. Moreover, CTFA is efficient, and neither huge memory nor domain-specific knowledge is required. Empirical results show that CTFA successfully enhances performance of several kinds of text classifiers on different experimental data.

Source

Journal of the American Society for Information Science and Technology. 61(2010) no.2, S.300-309