Search (2 results, page 1 of 1)

  • × author_ss:"Tamine, L."
  • × 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.02
    0.018825607 = product of:
      0.037651215 = sum of:
        0.037651215 = sum of:
          0.0096129235 = weight(_text_:a in 664) [ClassicSimilarity], result of:
            0.0096129235 = score(doc=664,freq=20.0), product of:
              0.04772363 = queryWeight, product of:
                1.153047 = idf(docFreq=37942, maxDocs=44218)
                0.041389145 = queryNorm
              0.20142901 = fieldWeight in 664, product of:
                4.472136 = tf(freq=20.0), with freq of:
                  20.0 = termFreq=20.0
                1.153047 = idf(docFreq=37942, maxDocs=44218)
                0.0390625 = fieldNorm(doc=664)
          0.028038291 = weight(_text_:22 in 664) [ClassicSimilarity], result of:
            0.028038291 = score(doc=664,freq=2.0), product of:
              0.14493774 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.041389145 = 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
    Type
    a
  2. Boughanem, M.; Chrisment, C.; Tamine, L.: On using genetic algorithms for multimodal relevance optimization in information retrieval (2002) 0.00
    0.0021279112 = product of:
      0.0042558224 = sum of:
        0.0042558224 = product of:
          0.008511645 = sum of:
            0.008511645 = weight(_text_:a in 1011) [ClassicSimilarity], result of:
              0.008511645 = score(doc=1011,freq=8.0), product of:
                0.04772363 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.041389145 = queryNorm
                0.17835285 = fieldWeight in 1011, product of:
                  2.828427 = tf(freq=8.0), with freq of:
                    8.0 = termFreq=8.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=1011)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Boughanem, Chrisment, and Tamine use 144,186 documents and 25 queries from the TREC corpus AP88 to evaluate a genetic algorithm for multiple query evaluation against single query evaluation. They demonstrate niche construction by the use of a genetic technique to reproduce queries more often if they retrieve more relevant documents (genotypic sharing), or if they have close evaluation results (phenotypic sharing).New documents generated in each iteration are ranked by a merge based on one of these two principles. Genotypic sharing yields improvements of from 6% to 15% over single query evaluation, and phenotypic sharing shows from 5% to 15% improvement. Thus the niching technique appears to offer the possibility of successful merging of different query expressions.
    Type
    a