Search (7 results, page 1 of 1)

0.026710846 = product of:
  0.16026507 = sum of:
    0.16026507 = weight(_text_:ranking in 4766) [ClassicSimilarity], result of:
      0.16026507 = score(doc=4766,freq=14.0), product of:
        0.20271951 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.03747799 = queryNorm
        0.79057544 = fieldWeight in 4766, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4766)
  0.16666667 = coord(1/6)

Abstract

Current best-match ranking (BMR) systems perform well but cannot handle word mismatch between a query and a document. The best known alternative ranking method, hierarchical clustering-based ranking (HCR), seems to be more robust than BMR with respect to this problem, but it is hampered by theoretical and practical limitations. We present an approach to document ranking that explicitly addresses the word mismatch problem by exploiting interdocument similarity information in a novel way. Document ranking is seen as a query-document transformation driven by a conceptual representation of the whole document collection, into which the query is merged. Our approach is nased on the theory of concept (or Galois) lattices, which, er argue, provides a powerful, well-founded, and conputationally-tractable framework to model the space in which documents and query are represented and to compute such a transformation. We compared information retrieval using concept lattice-based ranking (CLR) to BMR and HCR. The results showed that HCR was outperformed by CLR as well as BMR, and suggested that, of the two best methods, BMR achieved better performance than CLR on the whole document set, whereas CLR compared more favorably when only the first retrieved documents were used for evaluation. We also evaluated the three methods' specific ability to rank documents that did not match the query, in which case the speriority of CLR over BMR and HCR was apparent

0.011422038 = product of:
  0.06853223 = sum of:
    0.06853223 = weight(_text_:ranking in 3291) [ClassicSimilarity], result of:
      0.06853223 = score(doc=3291,freq=4.0), product of:
        0.20271951 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.03747799 = queryNorm
        0.33806428 = fieldWeight in 3291, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.03125 = fieldNorm(doc=3291)
  0.16666667 = coord(1/6)

Abstract

The web is a network of linked sites whereby each site either forms a physical portal or a standalone page. In the former case, the portal presents an access point to its embedded web pages that coherently present a specific topic. In the latter case, there are millions of standalone web pages, that are scattered throughout the web, having the same topic and could be conceptually linked together to form virtual portals. Search engines have been developed to help users in reaching the adequate pages in an efficient and effective manner. All the known current search engine techniques rely on the web page as the basic atomic search unit. They ignore the conceptual links, that reveal the implicit web related meanings, among the retrieved pages. However, building a semantic model for the whole portal may contain more semantic information than a model of scattered individual pages. In addition, user queries can be poor and contain imprecise terms that do not reflect the real user intention. Consequently, retrieving the standalone individual pages that are directly related to the query may not satisfy the user's need. In this paper, we propose PREFCA, a Portal Retrieval Engine based on Formal Concept Analysis that relies on the portal as the main search unit. PREFCA consists of three phases: First, the information extraction phase that is concerned with extracting portal's semantic data. Second, the formal concept analysis phase that utilizes formal concept analysis to discover the conceptual links among portal and attributes. Finally, the information retrieval phase where we propose a portal ranking method to retrieve ranked pairs of portals and embedded pages. Additionally, we apply the network analysis rules to output some portal characteristics. We evaluated PREFCA using two data sets, namely the Forum for Information Retrieval Evaluation 2010 and ClueWeb09 (category B) test data, for physical and virtual portals respectively. PREFCA proves higher F-measure accuracy, better Mean Average Precision ranking and comparable network analysis and efficiency results than other search engine approaches, namely Term Frequency Inverse Document Frequency (TF-IDF), Latent Semantic Analysis (LSA), and BM25 techniques. As well, it gains high Mean Average Precision in comparison with learning to rank techniques. Moreover, PREFCA also gains better reach time than Carrot as a well-known topic-based search engine.

0.004554527 = product of:
  0.027327161 = sum of:
    0.027327161 = product of:
      0.08198148 = sum of:
        0.08198148 = weight(_text_:29 in 4305) [ClassicSimilarity], result of:
          0.08198148 = score(doc=4305,freq=2.0), product of:
            0.13183585 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03747799 = queryNorm
            0.6218451 = fieldWeight in 4305, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.125 = fieldNorm(doc=4305)
      0.33333334 = coord(1/3)
  0.16666667 = coord(1/6)

Date

13. 7.2008 19:29:59

0.0028209724 = product of:
  0.016925834 = sum of:
    0.016925834 = product of:
      0.050777502 = sum of:
        0.050777502 = weight(_text_:22 in 3142) [ClassicSimilarity], result of:
          0.050777502 = score(doc=3142,freq=2.0), product of:
            0.13124153 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03747799 = queryNorm
            0.38690117 = fieldWeight in 3142, 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=3142)
      0.33333334 = coord(1/3)
  0.16666667 = coord(1/6)

Date

26. 2.2008 15:58:22

0.0022567778 = product of:
  0.013540667 = sum of:
    0.013540667 = product of:
      0.040622 = sum of:
        0.040622 = weight(_text_:22 in 1901) [ClassicSimilarity], result of:
          0.040622 = score(doc=1901,freq=2.0), product of:
            0.13124153 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03747799 = queryNorm
            0.30952093 = fieldWeight in 1901, 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=1901)
      0.33333334 = coord(1/3)
  0.16666667 = coord(1/6)

Source

Knowledge organization. 22(1995) no.2, S.78-81

0.0019746807 = product of:
  0.011848084 = sum of:
    0.011848084 = product of:
      0.03554425 = sum of:
        0.03554425 = weight(_text_:22 in 5095) [ClassicSimilarity], result of:
          0.03554425 = score(doc=5095,freq=2.0), product of:
            0.13124153 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03747799 = queryNorm
            0.2708308 = fieldWeight in 5095, 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=5095)
      0.33333334 = coord(1/3)
  0.16666667 = coord(1/6)

Date

22. 1.2016 17:47:06

0.0019746807 = product of:
  0.011848084 = sum of:
    0.011848084 = product of:
      0.03554425 = sum of:
        0.03554425 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
          0.03554425 = score(doc=2654,freq=2.0), product of:
            0.13124153 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03747799 = queryNorm
            0.2708308 = fieldWeight in 2654, 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=2654)
      0.33333334 = coord(1/3)
  0.16666667 = coord(1/6)

Date

22. 1.2016 17:30:31