Search (8 results, page 1 of 1)

0.033350088 = product of:
  0.083375216 = sum of:
    0.03381079 = weight(_text_:it in 1080) [ClassicSimilarity], result of:
      0.03381079 = score(doc=1080,freq=2.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.22368698 = fieldWeight in 1080, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1080)
    0.04956443 = weight(_text_:22 in 1080) [ClassicSimilarity], result of:
      0.04956443 = score(doc=1080,freq=2.0), product of:
        0.18300882 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052260913 = queryNorm
        0.2708308 = fieldWeight in 1080, 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=1080)
  0.4 = coord(2/5)

Abstract

Named entities are major constituents of a document but are usually unknown words. This work proposes a systematic way of dealing with formulation, transformation, translation, and transliteration of multilingual-named entities. The rules and similarity matrices for translation and transliteration are learned automatically from parallel-named-entity corpora. The results are applied in cross-language access to collections of images with captions. Experimental results demonstrate that the similarity-based transliteration of named entities is effective, and runs in which transliteration is considered outperform the runs in which it is neglected.

Date

4. 6.2006 19:52:22

0.008496759 = product of:
  0.042483795 = sum of:
    0.042483795 = weight(_text_:22 in 4436) [ClassicSimilarity], result of:
      0.042483795 = score(doc=4436,freq=2.0), product of:
        0.18300882 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052260913 = queryNorm
        0.23214069 = fieldWeight in 4436, 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=4436)
  0.2 = coord(1/5)

Date

16. 2.2000 14:22:39

0.0070806327 = product of:
  0.035403162 = sum of:
    0.035403162 = weight(_text_:22 in 2938) [ClassicSimilarity], result of:
      0.035403162 = score(doc=2938,freq=2.0), product of:
        0.18300882 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052260913 = queryNorm
        0.19345059 = fieldWeight in 2938, 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=2938)
  0.2 = coord(1/5)

Abstract

We present CopeOpi, an opinion-analysis system, which extracts from the Web opinions about specific targets, summarizes the polarity and strength of these opinions, and tracks opinion variations over time. Objects that yield similar opinion tendencies over a certain time period may be correlated due to the latent causal events. CopeOpi discovers relationships among objects based on their opinion-tracking plots and collocations. Event bursts are detected from the tracking plots, and the strength of opinion relationships is determined by the coverage of these plots. To evaluate opinion mining, we use the NTCIR corpus annotated with opinion information at sentence and document levels. CopeOpi achieves sentence- and document-level f-measures of 62% and 74%. For relationship discovery, we collected 1.3M economics-related documents from 93 Web sources over 22 months, and analyzed collocation-based, opinion-based, and hybrid models. We consider as correlated company pairs that demonstrate similar stock-price variations, and selected these as the gold standard for evaluation. Results show that opinion-based and collocation-based models complement each other, and that integrated models perform the best. The top 25, 50, and 100 pairs discovered achieve precision rates of 1, 0.92, and 0.79, respectively.

0.005796136 = product of:
  0.028980678 = sum of:
    0.028980678 = weight(_text_:it in 2115) [ClassicSimilarity], result of:
      0.028980678 = score(doc=2115,freq=2.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.19173169 = fieldWeight in 2115, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.046875 = fieldNorm(doc=2115)
  0.2 = coord(1/5)

Abstract

This article proposes a summarization system for multiple documents. It employs not only named entities and other signatures to cluster news from different sources, but also employs punctuation marks, linking elements, and topic chains to identify the meaningful units (MUs). Using nouns and verbs to identify the similar MUs, focusing and browsing models are applied to represent the summarization results. To reduce information loss during summarization, informative words in a document are introduced. For the evaluation, a question answering system (QA system) is proposed to substitute the human assessors. In large-scale experiments containing 140 questions to 17,877 documents, the results show that those models using informative words outperform pure heuristic voting-only strategy by news reporters. This model can be easily further applied to summarize multilingual news from multiple sources.

0.004830113 = product of:
  0.024150565 = sum of:
    0.024150565 = weight(_text_:it in 4625) [ClassicSimilarity], result of:
      0.024150565 = score(doc=4625,freq=2.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.15977642 = fieldWeight in 4625, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4625)
  0.2 = coord(1/5)

Abstract

As the web has grown into an integral part of daily life, social annotation has become a popular manner for web users to manage resources. This method of management has many potential applications, but it is limited in applicability by the cold-start problem, especially for new resources on the web. In this article, we study automatic tag prediction for web pages comprehensively and utilize the predicted tags to improve search performance. First, we explore the stabilizing phenomenon of tag usage in a social bookmarking system. Then, we propose a two-stage tag prediction approach, which is efficient and is effective in making use of early annotations from users. In the first stage, content-based ranking, candidate tags are selected and ranked to generate an initial tag list. In the second stage, random-walk re-ranking, we adopt a random-walk model that utilizes tag co-occurrence information to re-rank the initial list. The experimental results show that our algorithm effectively proposes appropriate tags for target web pages. In addition, we present a framework to incorporate tag prediction in a general web search. The experimental results of the web search validate the hypothesis that the proposed framework significantly enhances the typical retrieval model.

0.004830113 = product of:
  0.024150565 = sum of:
    0.024150565 = weight(_text_:it in 4988) [ClassicSimilarity], result of:
      0.024150565 = score(doc=4988,freq=2.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.15977642 = fieldWeight in 4988, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4988)
  0.2 = coord(1/5)

Abstract

This article presents a search-intent-based method to generate pornographic blacklists for collaborative cyberporn filtering. A novel porn-detection framework that can find newly appearing pornographic web pages by mining search query logs is proposed. First, suspected queries are identified along with their clicked URLs by an automatically constructed lexicon. Then, a candidate URL is determined if the number of clicks satisfies majority voting rules. Finally, a candidate whose URL contains at least one categorical keyword will be included in a blacklist. Several experiments are conducted on an MSN search porn dataset to demonstrate the effectiveness of our method. The resulting blacklist generated by our search-intent-based method achieves high precision (0.701) while maintaining a favorably low false-positive rate (0.086). The experiments of a real-life filtering simulation reveal that our proposed method with its accumulative update strategy can achieve 44.15% of a macro-averaging blocking rate, when the update frequency is set to 1 day. In addition, the overblocking rates are less than 9% with time change due to the strong advantages of our search-intent-based method. This user-behavior-oriented method can be easily applied to search engines for incorporating only implicit collective intelligence from query logs without other efforts. In practice, it is complementary to intelligent content analysis for keeping up with the changing trails of objectionable websites from users' perspectives.

0.004830113 = product of:
  0.024150565 = sum of:
    0.024150565 = weight(_text_:it in 1546) [ClassicSimilarity], result of:
      0.024150565 = score(doc=1546,freq=2.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.15977642 = fieldWeight in 1546, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1546)
  0.2 = coord(1/5)

Abstract

This study explores the effect from considering citation relevancy in the main path analysis. Traditional citation-based analyses treat all citations equally even though there can be various reasons and different levels of relevancy for one document to reference another. Taking the relevancy level into consideration is intuitively advantageous because it adopts more accurate information and will thus make the results of a citation-based analysis more trustworthy. This is nevertheless a challenging task. We are aware of no citation-based analysis that has taken the relevancy level into consideration. The difficulty lies in the fact that the existing patent or patent citation database provides no readily available relevancy level information. We overcome this issue by obtaining citation relevancy information from a legal database that has relevancy level ranked by legal experts. This paper selects trademark dilution, a legal concept that has been the subject of many lawsuit cases, as the target for exploration. We apply main path analysis, taking citation relevancy into consideration, and verify the results against a set of test cases that are mentioned in an authoritative trademark book. The findings show that relevancy information helps main path analysis uncover legal cases of higher importance. Nevertheless, in terms of the number of significant cases retrieved, relevancy information does not seem to make a noticeable difference.

0.004830113 = product of:
  0.024150565 = sum of:
    0.024150565 = weight(_text_:it in 1818) [ClassicSimilarity], result of:
      0.024150565 = score(doc=1818,freq=2.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.15977642 = fieldWeight in 1818, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1818)
  0.2 = coord(1/5)

Abstract

This article explores users' browsing intents to predict the category of a user's next access during web surfing and applies the results to filter objectionable content, such as pornography, gambling, violence, and drugs. Users' access trails in terms of category sequences in click-through data are employed to mine users' web browsing behaviors. Contextual relationships of URL categories are learned by the hidden Markov model. The top-level domains (TLDs) extracted from URLs themselves and the corresponding categories are caught by the TLD model. Given a URL to be predicted, its TLD and current context are empirically combined in an aggregation model. In addition to the uses of the current context, the predictions of the URL accessed previously in different contexts by various users are also considered by majority rule to improve the aggregation model. Large-scale experiments show that the advanced aggregation approach achieves promising performance while maintaining an acceptably low false positive rate. Different strategies are introduced to integrate the model with the blacklist it generates for filtering objectionable web pages without analyzing their content. In practice, this is complementary to the existing content analysis from users' behavioral perspectives.