Search (3 results, page 1 of 1)

0.012285966 = product of:
  0.049143866 = sum of:
    0.027884906 = weight(_text_:studies in 1264) [ClassicSimilarity], result of:
      0.027884906 = score(doc=1264,freq=2.0), product of:
        0.15812531 = queryWeight, product of:
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03962768 = queryNorm
        0.17634688 = fieldWeight in 1264, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03125 = fieldNorm(doc=1264)
    0.02125896 = product of:
      0.04251792 = sum of:
        0.04251792 = weight(_text_:area in 1264) [ClassicSimilarity], result of:
          0.04251792 = score(doc=1264,freq=2.0), product of:
            0.1952553 = queryWeight, product of:
              4.927245 = idf(docFreq=870, maxDocs=44218)
              0.03962768 = queryNorm
            0.21775553 = fieldWeight in 1264, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.927245 = idf(docFreq=870, maxDocs=44218)
              0.03125 = fieldNorm(doc=1264)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Abstract

Over the past decade, the volume of information available digitally over the Internet has grown enormously. Technical developments in the area of search, such as Google's Page Rank algorithm, have proved so good at serving relevant results that Internet search has become integrated into daily human activity. One can endlessly explore topics of interest simply by querying and reading through the resulting links. Yet, although search engines are well known for providing relevant results based on users' queries, users do not always receive the results they are looking for. Google's Director of Research describes clickstream evidence of frustrated users repeatedly reformulating queries and searching through page after page of results. Given the general quality of search engine results, one must consider the possibility that the frustrated user's query is not effective; that is, it does not describe the essence of the user's interest. Indeed, extensive research into human search behavior has found that humans are not very effective at formulating good search queries that describe what they are interested in. Ideally, the user should simply point to a portion of text that sparked the user's interest, and a system should automatically formulate a search query that captures the essence of the text. In this paper, we describe an implemented system that provides this capability. We first describe how our work differs from existing work in automatic query formulation, and propose a new method for improved quantification of the relevance of candidate search terms drawn from input text using phrase-level analysis. We then propose an implementable method designed to provide relevant queries based on a user's text input. We demonstrate the quality of our results and performance of our system through experimental studies. Our results demonstrate that our system produces relevant search terms with roughly two-thirds precision and recall compared to search terms selected by experts, and that typical users find significantly more relevant results (31% more relevant) more quickly (64% faster) using our system than self-formulated search queries. Further, we show that our implementation can scale to request loads of up to 10 requests per second within current online responsiveness expectations (<2-second response times at the highest loads tested).

0.0063469075 = product of:
  0.05077526 = sum of:
    0.05077526 = weight(_text_:case in 1550) [ClassicSimilarity], result of:
      0.05077526 = score(doc=1550,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.29144385 = fieldWeight in 1550, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.046875 = fieldNorm(doc=1550)
  0.125 = coord(1/8)

Abstract

It is often necessary to compose a team consisting of experts with diverse competencies to accomplish complex tasks. However, for its proper functioning, it is also preferable that a team be socially cohesive. A team recommendation system, which facilitates the search for potential team members, can be of great help both for (a) individuals who need to seek out collaborators and for (b) managers who need to build a team for some specific tasks. Such a decision support system that readily helps summarize multiple metrics indicating a team (and its members) quality, and possibly rank the teams in a personalized manner according to the end users' preferences, thus serves as a tool to cope with what would otherwise be an information avalanche. In this work, we present Social Web Application for Team Recommendation, a general-purpose framework to compose various information retrieval and social graph mining and visualization subsystems together to build a composite team recommendation system, and instantiate it for a case study of academic teams.

0.0043570166 = product of:
  0.034856133 = sum of:
    0.034856133 = weight(_text_:studies in 956) [ClassicSimilarity], result of:
      0.034856133 = score(doc=956,freq=2.0), product of:
        0.15812531 = queryWeight, product of:
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03962768 = queryNorm
        0.22043361 = fieldWeight in 956, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.0390625 = fieldNorm(doc=956)
  0.125 = coord(1/8)

Abstract

The semantic knowledge of Wikipedia has proved to be useful for many tasks, for example, named entity disambiguation. Among these applications, the task of identifying the word sense based on Wikipedia is a crucial component because the output of this component is often used in subsequent tasks. In this article, we present a two-stage framework (called TSDW) for word sense disambiguation using knowledge latent in Wikipedia. The disambiguation of a given phrase is applied through a two-stage disambiguation process: (a) The first-stage disambiguation explores the contextual semantic information, where the noisy information is pruned for better effectiveness and efficiency; and (b) the second-stage disambiguation explores the disambiguated phrases of high confidence from the first stage to achieve better redisambiguation decisions for the phrases that are difficult to disambiguate in the first stage. Moreover, existing studies have addressed the disambiguation problem for English text only. Considering the popular usage of Wikipedia in different languages, we study the performance of TSDW and the existing state-of-the-art approaches over both English and Traditional Chinese articles. The experimental results show that TSDW generalizes well to different semantic relatedness measures and text in different languages. More important, TSDW significantly outperforms the state-of-the-art approaches with both better effectiveness and efficiency.