Search (37 results, page 1 of 2)

  • × theme_ss:"Retrievalalgorithmen"
  1. Soulier, L.; Jabeur, L.B.; Tamine, L.; Bahsoun, W.: On ranking relevant entities in heterogeneous networks using a language-based model (2013) 0.05 
    0.048291743 = product of:
  0.096583486 = sum of:
    0.096583486 = sum of:
      0.06583095 = weight(_text_:bibliographic in 664) [ClassicSimilarity], result of:
        0.06583095 = score(doc=664,freq=6.0), product of:
          0.17672792 = queryWeight, product of:
            3.893044 = idf(docFreq=2449, maxDocs=44218)
            0.045395818 = queryNorm
          0.3724989 = fieldWeight in 664, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.893044 = idf(docFreq=2449, maxDocs=44218)
            0.0390625 = fieldNorm(doc=664)
      0.030752534 = weight(_text_:22 in 664) [ClassicSimilarity], result of:
        0.030752534 = score(doc=664,freq=2.0), product of:
          0.15896842 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.045395818 = queryNorm
          0.19345059 = fieldWeight in 664, 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=664)
  0.5 = coord(1/2)
    Abstract
    A new challenge, accessing multiple relevant entities, arises from the availability of linked heterogeneous data. In this article, we address more specifically the problem of accessing relevant entities, such as publications and authors within a bibliographic network, given an information need. We propose a novel algorithm, called BibRank, that estimates a joint relevance of documents and authors within a bibliographic network. This model ranks each type of entity using a score propagation algorithm with respect to the query topic and the structure of the underlying bi-type information entity network. Evidence sources, namely content-based and network-based scores, are both used to estimate the topical similarity between connected entities. For this purpose, authorship relationships are analyzed through a language model-based score on the one hand and on the other hand, non topically related entities of the same type are detected through marginal citations. The article reports the results of experiments using the Bibrank algorithm for an information retrieval task. The CiteSeerX bibliographic data set forms the basis for the topical query automatic generation and evaluation. We show that a statistically significant improvement over closely related ranking models is achieved.
    Date
    22. 3.2013 19:34:49
  2. Schiminovich, S.: Automatic classification and retrieval of documents by means of a bibliographic pattern discovery algorithm (1971) 0.03 
    0.026605263 = product of:
  0.053210527 = sum of:
    0.053210527 = product of:
      0.10642105 = sum of:
        0.10642105 = weight(_text_:bibliographic in 4846) [ClassicSimilarity], result of:
          0.10642105 = score(doc=4846,freq=2.0), product of:
            0.17672792 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.045395818 = queryNorm
            0.6021745 = fieldWeight in 4846, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.109375 = fieldNorm(doc=4846)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
  3. Aho, A.; Corasick, M.: Efficient string matching : an aid to bibliographic search (1975) 0.03 
    0.026605263 = product of:
  0.053210527 = sum of:
    0.053210527 = product of:
      0.10642105 = sum of:
        0.10642105 = weight(_text_:bibliographic in 3506) [ClassicSimilarity], result of:
          0.10642105 = score(doc=3506,freq=2.0), product of:
            0.17672792 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.045395818 = queryNorm
            0.6021745 = fieldWeight in 3506, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.109375 = fieldNorm(doc=3506)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
  4. Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986) 0.02 
    0.024602026 = product of:
  0.04920405 = sum of:
    0.04920405 = product of:
      0.0984081 = sum of:
        0.0984081 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
          0.0984081 = score(doc=402,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.61904186 = fieldWeight in 402, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.125 = fieldNorm(doc=402)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Source
    Information processing and management. 22(1986) no.6, S.465-476
  5. Smeaton, A.F.; Rijsbergen, C.J. van: ¬The retrieval effects of query expansion on a feedback document retrieval system (1983) 0.02 
    0.021526773 = product of:
  0.043053545 = sum of:
    0.043053545 = product of:
      0.08610709 = sum of:
        0.08610709 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
          0.08610709 = score(doc=2134,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = 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.5 = coord(1/2)
    Date
    30. 3.2001 13:32:22
  6. Back, J.: ¬An evaluation of relevancy ranking techniques used by Internet search engines (2000) 0.02 
    0.021526773 = product of:
  0.043053545 = sum of:
    0.043053545 = product of:
      0.08610709 = sum of:
        0.08610709 = weight(_text_:22 in 3445) [ClassicSimilarity], result of:
          0.08610709 = score(doc=3445,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.5416616 = fieldWeight in 3445, 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=3445)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    25. 8.2005 17:42:22
  7. Fuhr, N.: Ranking-Experimente mit gewichteter Indexierung (1986) 0.02 
    0.01845152 = product of:
  0.03690304 = sum of:
    0.03690304 = product of:
      0.07380608 = sum of:
        0.07380608 = weight(_text_:22 in 58) [ClassicSimilarity], result of:
          0.07380608 = score(doc=58,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.46428138 = fieldWeight in 58, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=58)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    14. 6.2015 22:12:44
  8. Fuhr, N.: Rankingexperimente mit gewichteter Indexierung (1986) 0.02 
    0.01845152 = product of:
  0.03690304 = sum of:
    0.03690304 = product of:
      0.07380608 = sum of:
        0.07380608 = weight(_text_:22 in 2051) [ClassicSimilarity], result of:
          0.07380608 = score(doc=2051,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.46428138 = fieldWeight in 2051, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=2051)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    14. 6.2015 22:12:56
  9. Guerrero-Bote, V.P.; Moya Anegón, F. de; Herrero Solana, V.: Document organization using Kohonen's algorithm (2002) 0.02 
    0.0152030075 = product of:
  0.030406015 = sum of:
    0.030406015 = product of:
      0.06081203 = sum of:
        0.06081203 = weight(_text_:bibliographic in 2564) [ClassicSimilarity], result of:
          0.06081203 = score(doc=2564,freq=2.0), product of:
            0.17672792 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.045395818 = queryNorm
            0.34409973 = fieldWeight in 2564, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.0625 = fieldNorm(doc=2564)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The classification of documents from a bibliographic database is a task that is linked to processes of information retrieval based on partial matching. A method is described of vectorizing reference documents from LISA which permits their topological organization using Kohonen's algorithm. As an example a map is generated of 202 documents from LISA, and an analysis is made of the possibilities of this type of neural network with respect to the development of information retrieval systems based on graphical browsing.
  10. Couvreur, T.R.; Benzel, R.N.; Miller, S.F.; Zeitler, D.N.; Lee, D.L.; Singhal, M.; Shivaratri, N.; Wong, W.Y.P.: ¬An analysis of performance and cost factors in searching large text databases using parallel search systems (1994) 0.01 
    0.013302632 = product of:
  0.026605263 = sum of:
    0.026605263 = product of:
      0.053210527 = sum of:
        0.053210527 = weight(_text_:bibliographic in 7657) [ClassicSimilarity], result of:
          0.053210527 = score(doc=7657,freq=2.0), product of:
            0.17672792 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.045395818 = queryNorm
            0.30108726 = fieldWeight in 7657, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7657)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The results of modelling the performance of searching large text databases (>10 GBytes) via various parallel hardware architectures and search algorithms are discussed. The performance under load and the cost of each configuration are compared. Strengths, weaknesses, performance sensitivities, and search features supported for each configuration are also addressed. In addition, a common search workload used in the modelling is described. The search workload is derived from a set of searches run against the Chemical Abstracts file of bibliographic and abstract text available on STN International. This common workload is applied to all configurations modelled to provide a common basis of comparison
  11. Carpineto, C.; Romano, G.: Information retrieval through hybrid navigation of lattice representations (1996) 0.01 
    0.013302632 = product of:
  0.026605263 = sum of:
    0.026605263 = product of:
      0.053210527 = sum of:
        0.053210527 = weight(_text_:bibliographic in 7434) [ClassicSimilarity], result of:
          0.053210527 = score(doc=7434,freq=2.0), product of:
            0.17672792 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.045395818 = queryNorm
            0.30108726 = fieldWeight in 7434, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7434)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Presents a comprehensive approach to automatic organization and hybrid navigation of text databases. An organizing stage builds a particular lattice representation of the data, through text indexing followed by lattice clustering of the indexed texts. The lattice representation supports the navigation state of the system, a visual retrieval interface that combines 3 main retrieval strategies: browsing, querying, and bounding. Such a hybrid paradigm permits high flexibility in trading off information exploration and retrieval, and had good retrieval performance. Compares information retrieval using lattice-based hybrid navigation with conventional Boolean querying. Experiments conducted on 2 medium-sized bibliographic databases showed that the performance of lattice retrieval was comparable to or better than Boolean retrieval
  12. MacFarlane, A.; Robertson, S.E.; McCann, J.A.: Parallel computing for passage retrieval (2004) 0.01 
    0.012301013 = product of:
  0.024602026 = sum of:
    0.024602026 = product of:
      0.04920405 = sum of:
        0.04920405 = weight(_text_:22 in 5108) [ClassicSimilarity], result of:
          0.04920405 = score(doc=5108,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.30952093 = fieldWeight in 5108, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=5108)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    20. 1.2007 18:30:22
  13. Faloutsos, C.: Signature files (1992) 0.01 
    0.012301013 = product of:
  0.024602026 = sum of:
    0.024602026 = product of:
      0.04920405 = sum of:
        0.04920405 = weight(_text_:22 in 3499) [ClassicSimilarity], result of:
          0.04920405 = score(doc=3499,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.30952093 = fieldWeight in 3499, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=3499)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    7. 5.1999 15:22:48
  14. Losada, D.E.; Barreiro, A.: Emebedding term similarity and inverse document frequency into a logical model of information retrieval (2003) 0.01 
    0.012301013 = product of:
  0.024602026 = sum of:
    0.024602026 = product of:
      0.04920405 = sum of:
        0.04920405 = weight(_text_:22 in 1422) [ClassicSimilarity], result of:
          0.04920405 = score(doc=1422,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.30952093 = fieldWeight in 1422, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=1422)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    22. 3.2003 19:27:23
  15. Bornmann, L.; Mutz, R.: From P100 to P100' : a new citation-rank approach (2014) 0.01 
    0.012301013 = product of:
  0.024602026 = sum of:
    0.024602026 = product of:
      0.04920405 = sum of:
        0.04920405 = weight(_text_:22 in 1431) [ClassicSimilarity], result of:
          0.04920405 = score(doc=1431,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.30952093 = fieldWeight in 1431, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=1431)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    22. 8.2014 17:05:18
  16. Tober, M.; Hennig, L.; Furch, D.: SEO Ranking-Faktoren und Rang-Korrelationen 2014 : Google Deutschland (2014) 0.01 
    0.012301013 = product of:
  0.024602026 = sum of:
    0.024602026 = product of:
      0.04920405 = sum of:
        0.04920405 = weight(_text_:22 in 1484) [ClassicSimilarity], result of:
          0.04920405 = score(doc=1484,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.30952093 = fieldWeight in 1484, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=1484)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    13. 9.2014 14:45:22
  17. Rada, R.; Barlow, J.; Potharst, J.; Zanstra, P.; Bijstra, D.: Document ranking using an enriched thesaurus (1991) 0.01 
    0.011402255 = product of:
  0.02280451 = sum of:
    0.02280451 = product of:
      0.04560902 = sum of:
        0.04560902 = weight(_text_:bibliographic in 6626) [ClassicSimilarity], result of:
          0.04560902 = score(doc=6626,freq=2.0), product of:
            0.17672792 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.045395818 = queryNorm
            0.2580748 = fieldWeight in 6626, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.046875 = fieldNorm(doc=6626)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    A thesaurus may be viewed as a graph, and document retrieval algorithms can exploit this graph when both the documents and the query are represented by thesaurus terms. These retrieval algorithms measure the distance between the query and documents by using the path lengths in the graph. Previous work witj such strategies has shown that the hierarchical relations in the thesaurus are useful but the non-hierarchical are not. This paper shows that when the query explicitly mentions a particular non-hierarchical relation, the retrieval algorithm benefits from the presence of such relations in the thesaurus. Our algorithms were applied to the Excerpta Medica bibliographic citation database whose citations are indexed with terms from the EMTREE thesaurus. We also created an enriched EMTREE by systematically adding non-hierarchical relations from a medical knowledge base. Our algorithms used at one time EMTREE and, at another time, the enriched EMTREE in the course of ranking documents from Excerpta Medica against queries. When, and only when, the query specifically mentioned a particular non-hierarchical relation type, did EMTREE enriched with that relation type lead to a ranking that better corresponded to an expert's ranking
  18. Savoy, J.: Ranking schemes in hybrid Boolean systems : a new approach (1997) 0.01 
    0.011402255 = product of:
  0.02280451 = sum of:
    0.02280451 = product of:
      0.04560902 = sum of:
        0.04560902 = weight(_text_:bibliographic in 393) [ClassicSimilarity], result of:
          0.04560902 = score(doc=393,freq=2.0), product of:
            0.17672792 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.045395818 = queryNorm
            0.2580748 = fieldWeight in 393, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.046875 = fieldNorm(doc=393)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    In most commercial online systems, the retrieval system is based on the Boolean model and its inverted file organization. Since the investment in these systems is so great and changing them could be economically unfeasible, this article suggests a new ranking scheme especially adapted for hypertext environments in order to produce more effective retrieval results and yet maintain the effectiveness of the investment made to date in the Boolean model. To select the retrieved documents, the suggested ranking strategy uses multiple sources of document content evidence. The proposed scheme integrates both the information provided by the index and query terms, and the inherent relationships between documents such as bibliographic references or hypertext links. We will demonstrate that our scheme represents an integration of both subject and citation indexing, and results in a significant imporvement over classical ranking schemes uses in hybrid Boolean systems, while preserving its efficiency. Moreover, through knowing the nearest neighbor and the hypertext links which constitute additional sources of evidence, our strategy will take them into account in order to further improve retrieval effectiveness and to provide 'good' starting points for browsing in a hypertext or hypermedia environement
  19. Ravana, S.D.; Rajagopal, P.; Balakrishnan, V.: Ranking retrieval systems using pseudo relevance judgments (2015) 0.01 
    0.010872662 = product of:
  0.021745324 = sum of:
    0.021745324 = product of:
      0.04349065 = sum of:
        0.04349065 = weight(_text_:22 in 2591) [ClassicSimilarity], result of:
          0.04349065 = score(doc=2591,freq=4.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.27358043 = fieldWeight in 2591, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2591)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    20. 1.2015 18:30:22
    18. 9.2018 18:22:56
  20. Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998) 0.01 
    0.010763386 = product of:
  0.021526773 = sum of:
    0.021526773 = product of:
      0.043053545 = sum of:
        0.043053545 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
          0.043053545 = score(doc=1319,freq=2.0), product of:
            0.15896842 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045395818 = queryNorm
            0.2708308 = fieldWeight in 1319, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1319)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    1. 8.1996 22:08:06

Authors

Years

Languages

  • e 33
  • d 4

Types

  • a 34
  • el 1
  • m 1
  • r 1
  • More… Less…

Themes

Subjects

Classifications