Search (12 results, page 1 of 1)

  • × type_ss:"x"
  • × language_ss:"e"
  1. Farazi, M.: Faceted lightweight ontologies : a formalization and some experiments (2010) 0.02 
    0.019222 = product of:
  0.057666 = sum of:
    0.057666 = product of:
      0.172998 = sum of:
        0.172998 = weight(_text_:3a in 4997) [ClassicSimilarity], result of:
          0.172998 = score(doc=4997,freq=2.0), product of:
            0.36937886 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.043569047 = queryNorm
            0.46834838 = fieldWeight in 4997, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4997)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Content
    PhD Dissertation at International Doctorate School in Information and Communication Technology. Vgl.: https%3A%2F%2Fcore.ac.uk%2Fdownload%2Fpdf%2F150083013.pdf&usg=AOvVaw2n-qisNagpyT0lli_6QbAQ.
  2. Stojanovic, N.: Ontology-based Information Retrieval : methods and tools for cooperative query answering (2005) 0.02 
    0.0153776 = product of:
  0.0461328 = sum of:
    0.0461328 = product of:
      0.1383984 = sum of:
        0.1383984 = weight(_text_:3a in 701) [ClassicSimilarity], result of:
          0.1383984 = score(doc=701,freq=2.0), product of:
            0.36937886 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.043569047 = queryNorm
            0.3746787 = fieldWeight in 701, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=701)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Content
    Vgl.: http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F1627&ei=tAtYUYrBNoHKtQb3l4GYBw&usg=AFQjCNHeaxKkKU3-u54LWxMNYGXaaDLCGw&sig2=8WykXWQoDKjDSdGtAakH2Q&bvm=bv.44442042,d.Yms.
  3. Xiong, C.: Knowledge based text representations for information retrieval (2016) 0.02 
    0.0153776 = product of:
  0.0461328 = sum of:
    0.0461328 = product of:
      0.1383984 = sum of:
        0.1383984 = weight(_text_:3a in 5820) [ClassicSimilarity], result of:
          0.1383984 = score(doc=5820,freq=2.0), product of:
            0.36937886 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.043569047 = queryNorm
            0.3746787 = fieldWeight in 5820, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=5820)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Content
    Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Language and Information Technologies. Vgl.: https%3A%2F%2Fwww.cs.cmu.edu%2F~cx%2Fpapers%2Fknowledge_based_text_representation.pdf&usg=AOvVaw0SaTSvhWLTh__Uz_HtOtl3.
  4. Gordon, T.J.; Helmer-Hirschberg, O.: Report on a long-range forecasting study (1964) 0.01 
    0.0074205417 = product of:
  0.022261625 = sum of:
    0.022261625 = product of:
      0.06678487 = sum of:
        0.06678487 = weight(_text_:22 in 4204) [ClassicSimilarity], result of:
          0.06678487 = score(doc=4204,freq=4.0), product of:
            0.15257138 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043569047 = queryNorm
            0.4377287 = fieldWeight in 4204, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=4204)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Date
    22. 6.2018 13:24:08
    22. 6.2018 13:54:52
  5. Sebastian, Y.: Literature-based discovery by learning heterogeneous bibliographic information networks (2017) 0.01 
    0.0060005905 = product of:
  0.01800177 = sum of:
    0.01800177 = product of:
      0.05400531 = sum of:
        0.05400531 = weight(_text_:network in 535) [ClassicSimilarity], result of:
          0.05400531 = score(doc=535,freq=4.0), product of:
            0.19402927 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.043569047 = queryNorm
            0.2783359 = fieldWeight in 535, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.03125 = fieldNorm(doc=535)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Abstract
    Literature-based discovery (LBD) research aims at finding effective computational methods for predicting previously unknown connections between clusters of research papers from disparate research areas. Existing methods encompass two general approaches. The first approach searches for these unknown connections by examining the textual contents of research papers. In addition to the existing textual features, the second approach incorporates structural features of scientific literatures, such as citation structures. These approaches, however, have not considered research papers' latent bibliographic metadata structures as important features that can be used for predicting previously unknown relationships between them. This thesis investigates a new graph-based LBD method that exploits the latent bibliographic metadata connections between pairs of research papers. The heterogeneous bibliographic information network is proposed as an efficient graph-based data structure for modeling the complex relationships between these metadata. In contrast to previous approaches, this method seamlessly combines textual and citation information in the form of pathbased metadata features for predicting future co-citation links between research papers from disparate research fields. The results reported in this thesis provide evidence that the method is effective for reconstructing the historical literature-based discovery hypotheses. This thesis also investigates the effects of semantic modeling and topic modeling on the performance of the proposed method. For semantic modeling, a general-purpose word sense disambiguation technique is proposed to reduce the lexical ambiguity in the title and abstract of research papers. The experimental results suggest that the reduced lexical ambiguity did not necessarily lead to a better performance of the method. This thesis discusses some of the possible contributing factors to these results. Finally, topic modeling is used for learning the latent topical relations between research papers. The learned topic model is incorporated into the heterogeneous bibliographic information network graph and allows new predictive features to be learned. The results in this thesis suggest that topic modeling improves the performance of the proposed method by increasing the overall accuracy for predicting the future co-citation links between disparate research papers.
  6. Munzner, T.: Interactive visualization of large graphs and networks (2000) 0.00 
    0.004243058 = product of:
  0.012729174 = sum of:
    0.012729174 = product of:
      0.038187522 = sum of:
        0.038187522 = weight(_text_:network in 4746) [ClassicSimilarity], result of:
          0.038187522 = score(doc=4746,freq=2.0), product of:
            0.19402927 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.043569047 = queryNorm
            0.1968132 = fieldWeight in 4746, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.03125 = fieldNorm(doc=4746)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Abstract
    Many real-world domains can be represented as large node-link graphs: backbone Internet routers connect with 70,000 other hosts, mid-sized Web servers handle between 20,000 and 200,000 hyperlinked documents, and dictionaries contain millions of words defined in terms of each other. Computational manipulation of such large graphs is common, but previous tools for graph visualization have been limited to datasets of a few thousand nodes. Visual depictions of graphs and networks are external representations that exploit human visual processing to reduce the cognitive load of many tasks that require understanding of global or local structure. We assert that the two key advantages of computer-based systems for information visualization over traditional paper-based visual exposition are interactivity and scalability. We also argue that designing visualization software by taking the characteristics of a target user's task domain into account leads to systems that are more effective and scale to larger datasets than previous work. This thesis contains a detailed analysis of three specialized systems for the interactive exploration of large graphs, relating the intended tasks to the spatial layout and visual encoding choices. We present two novel algorithms for specialized layout and drawing that use quite different visual metaphors. The H3 system for visualizing the hyperlink structures of web sites scales to datasets of over 100,000 nodes by using a carefully chosen spanning tree as the layout backbone, 3D hyperbolic geometry for a Focus+Context view, and provides a fluid interactive experience through guaranteed frame rate drawing. The Constellation system features a highly specialized 2D layout intended to spatially encode domain-specific information for computational linguists checking the plausibility of a large semantic network created from dictionaries. The Planet Multicast system for displaying the tunnel topology of the Internet's multicast backbone provides a literal 3D geographic layout of arcs on a globe to help MBone maintainers find misconfigured long-distance tunnels. Each of these three systems provides a very different view of the graph structure, and we evaluate their efficacy for the intended task. We generalize these findings in our analysis of the importance of interactivity and specialization for graph visualization systems that are effective and scalable.
  7. Tzitzikas, Y.: Collaborative ontology-based information indexing and retrieval (2002) 0.00 
    0.004243058 = product of:
  0.012729174 = sum of:
    0.012729174 = product of:
      0.038187522 = sum of:
        0.038187522 = weight(_text_:network in 2281) [ClassicSimilarity], result of:
          0.038187522 = score(doc=2281,freq=2.0), product of:
            0.19402927 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.043569047 = queryNorm
            0.1968132 = fieldWeight in 2281, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.03125 = fieldNorm(doc=2281)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Abstract
    An information system like the Web is a continuously evolving system consisting of multiple heterogeneous information sources, covering a wide domain of discourse, and a huge number of users (human or software) with diverse characteristics and needs, that produce and consume information. The challenge nowadays is to build a scalable information infrastructure enabling the effective, accurate, content based retrieval of information, in a way that adapts to the characteristics and interests of the users. The aim of this work is to propose formally sound methods for building such an information network based on ontologies which are widely used and are easy to grasp by ordinary Web users. The main results of this work are: - A novel scheme for indexing and retrieving objects according to multiple aspects or facets. The proposed scheme is a faceted scheme enriched with a method for specifying the combinations of terms that are valid. We give a model-theoretic interpretation to this model and we provide mechanisms for inferring the valid combinations of terms. This inference service can be exploited for preventing errors during the indexing process, which is very important especially in the case where the indexing is done collaboratively by many users, and for deriving "complete" navigation trees suitable for browsing through the Web. The proposed scheme has several advantages over the hierarchical classification schemes currently employed by Web catalogs, namely, conceptual clarity (it is easier to understand), compactness (it takes less space), and scalability (the update operations can be formulated more easily and be performed more effciently). - A exible and effecient model for building mediators over ontology based information sources. The proposed mediators support several modes of query translation and evaluation which can accommodate various application needs and levels of answer quality. The proposed model can be used for providing users with customized views of Web catalogs. It can also complement the techniques for building mediators over relational sources so as to support approximate translation of partially ordered domain values.
  8. Mair, M.: Increasing the value of meta data by using associative semantic networks (2002) 0.00 
    0.003971059 = product of:
  0.011913176 = sum of:
    0.011913176 = product of:
      0.035739526 = sum of:
        0.035739526 = weight(_text_:29 in 4972) [ClassicSimilarity], result of:
          0.035739526 = score(doc=4972,freq=2.0), product of:
            0.15326229 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.043569047 = queryNorm
            0.23319192 = fieldWeight in 4972, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.046875 = fieldNorm(doc=4972)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Date
    17. 3.2006 19:24:29
  9. Huo, W.: Automatic multi-word term extraction and its application to Web-page summarization (2012) 0.00 
    0.0039353366 = product of:
  0.011806009 = sum of:
    0.011806009 = product of:
      0.035418026 = sum of:
        0.035418026 = weight(_text_:22 in 563) [ClassicSimilarity], result of:
          0.035418026 = score(doc=563,freq=2.0), product of:
            0.15257138 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043569047 = queryNorm
            0.23214069 = fieldWeight in 563, 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=563)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Date
    10. 1.2013 19:22:47
  10. Geisriegler, E.: Enriching electronic texts with semantic metadata : a use case for the historical Newspaper Collection ANNO (Austrian Newspapers Online) of the Austrian National Libraryhek (2012) 0.00 
    0.003279447 = product of:
  0.009838341 = sum of:
    0.009838341 = product of:
      0.029515022 = sum of:
        0.029515022 = weight(_text_:22 in 595) [ClassicSimilarity], result of:
          0.029515022 = score(doc=595,freq=2.0), product of:
            0.15257138 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043569047 = queryNorm
            0.19345059 = fieldWeight in 595, 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=595)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Date
    3. 2.2013 18:00:22
  11. Makewita, S.M.: Investigating the generic information-seeking function of organisational decision-makers : perspectives on improving organisational information systems (2002) 0.00 
    0.003279447 = product of:
  0.009838341 = sum of:
    0.009838341 = product of:
      0.029515022 = sum of:
        0.029515022 = weight(_text_:22 in 642) [ClassicSimilarity], result of:
          0.029515022 = score(doc=642,freq=2.0), product of:
            0.15257138 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043569047 = queryNorm
            0.19345059 = fieldWeight in 642, 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=642)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Date
    22. 7.2022 12:16:58
  12. Kiren, T.: ¬A clustering based indexing technique of modularized ontologies for information retrieval (2017) 0.00 
    0.0026235576 = product of:
  0.007870672 = sum of:
    0.007870672 = product of:
      0.023612017 = sum of:
        0.023612017 = weight(_text_:22 in 4399) [ClassicSimilarity], result of:
          0.023612017 = score(doc=4399,freq=2.0), product of:
            0.15257138 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043569047 = queryNorm
            0.15476047 = fieldWeight in 4399, 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=4399)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Date
    20. 1.2015 18:30:22

Authors

Years

Themes