Search (9 results, page 1 of 1)

0.040221673 = product of:
  0.060332507 = sum of:
    0.037639882 = weight(_text_:resources in 3581) [ClassicSimilarity], result of:
      0.037639882 = score(doc=3581,freq=2.0), product of:
        0.18665522 = queryWeight, product of:
          3.650338 = idf(docFreq=3122, maxDocs=44218)
          0.051133685 = queryNorm
        0.20165458 = fieldWeight in 3581, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.650338 = idf(docFreq=3122, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3581)
    0.022692626 = product of:
      0.045385253 = sum of:
        0.045385253 = weight(_text_:management in 3581) [ClassicSimilarity], result of:
          0.045385253 = score(doc=3581,freq=4.0), product of:
            0.17235184 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.051133685 = queryNorm
            0.2633291 = fieldWeight in 3581, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3581)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

The category-tree document-classification structure is widely used by enterprises and information providers to organize, archive, and access documents for effective knowledge management. However, category trees from various sources use different hierarchical structures, which usually make mappings between categories in different category trees difficult. In this work, we propose a category-tree integration technique. We develop a method to learn the relationships between any two categories and develop operations such as mapping, splitting, and insertion for this integration. According to the parent-child relationship of the integrating categories, the developed decision rules use integration operations to integrate categories from the source category tree with those from the master category tree. A unified category tree can accumulate knowledge from multiple resources without forfeiting the knowledge in individual category trees. Experiments have been conducted to measure the performance of the integration operations and the accuracy of the integrated category trees. The proposed category-tree integration technique achieves greater than 80% integration accuracy, and the insert operation is the most frequently utilized, followed by map and split. The insert operation achieves 77% of F1 while the map and split operations achieves 86% and 29% of F1, respectively.

0.024841055 = product of:
  0.074523166 = sum of:
    0.074523166 = weight(_text_:resources in 600) [ClassicSimilarity], result of:
      0.074523166 = score(doc=600,freq=4.0), product of:
        0.18665522 = queryWeight, product of:
          3.650338 = idf(docFreq=3122, maxDocs=44218)
          0.051133685 = queryNorm
        0.39925572 = fieldWeight in 600, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.650338 = idf(docFreq=3122, maxDocs=44218)
          0.0546875 = fieldNorm(doc=600)
  0.33333334 = coord(1/3)

Footnote

Einführung in einen Themenschwerpunkt "Mining Web resources for enhancing information retrieval"

0.022243923 = product of:
  0.066731766 = sum of:
    0.066731766 = sum of:
      0.032092217 = weight(_text_:management in 2456) [ClassicSimilarity], result of:
        0.032092217 = score(doc=2456,freq=2.0), product of:
          0.17235184 = queryWeight, product of:
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.051133685 = queryNorm
          0.18620178 = fieldWeight in 2456, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2456)
      0.034639545 = weight(_text_:22 in 2456) [ClassicSimilarity], result of:
        0.034639545 = score(doc=2456,freq=2.0), product of:
          0.17906146 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051133685 = queryNorm
          0.19345059 = fieldWeight in 2456, 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=2456)
  0.33333334 = coord(1/3)

Date

22.11.2008 17:57:22

Source

Information processing and management. 45(2009) no.1, S.115-130

0.017743612 = product of:
  0.053230833 = sum of:
    0.053230833 = weight(_text_:resources in 604) [ClassicSimilarity], result of:
      0.053230833 = score(doc=604,freq=4.0), product of:
        0.18665522 = queryWeight, product of:
          3.650338 = idf(docFreq=3122, maxDocs=44218)
          0.051133685 = queryNorm
        0.28518265 = fieldWeight in 604, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.650338 = idf(docFreq=3122, maxDocs=44218)
          0.0390625 = fieldNorm(doc=604)
  0.33333334 = coord(1/3)

Abstract

Modern information retrieval systems use keywords within documents as indexing terms for search of relevant documents. As Chinese is an ideographic character-based language, the words in the texts are not delimited by white spaces. Indexing of Chinese documents is impossible without a proper segmentation algorithm. Many Chinese segmentation algorithms have been proposed in the past. Traditional segmentation algorithms cannot operate without a large dictionary or a large corpus of training data. Nowadays, the Web has become the largest corpus that is ideal for Chinese segmentation. Although most search engines have problems in segmenting texts into proper words, they maintain huge databases of documents and frequencies of character sequences in the documents. Their databases are important potential resources for segmentation. In this paper, we propose a segmentation algorithm by mining Web data with the help of search engines. On the other hand, the Romanized pinyin of Chinese language indicates boundaries of words in the text. Our algorithm is the first to utilize the Romanized pinyin to segmentation. It is the first unified segmentation algorithm for the Chinese language from different geographical areas, and it is also domain independent because of the nature of the Web. Experiments have been conducted on the datasets of a recent Chinese segmentation competition. The results show that our algorithm outperforms the traditional algorithms in terms of precision and recall. Moreover, our algorithm can effectively deal with the problems of segmentation ambiguity, new word (unknown word) detection, and stop words.

Footnote

Beitrag eines Themenschwerpunktes "Mining Web resources for enhancing information retrieval"

0.012546628 = product of:
  0.037639882 = sum of:
    0.037639882 = weight(_text_:resources in 597) [ClassicSimilarity], result of:
      0.037639882 = score(doc=597,freq=2.0), product of:
        0.18665522 = queryWeight, product of:
          3.650338 = idf(docFreq=3122, maxDocs=44218)
          0.051133685 = queryNorm
        0.20165458 = fieldWeight in 597, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.650338 = idf(docFreq=3122, maxDocs=44218)
          0.0390625 = fieldNorm(doc=597)
  0.33333334 = coord(1/3)

Footnote

Beitrag eines Themenschwerpunktes "Mining Web resources for enhancing information retrieval"

0.0064184438 = product of:
  0.01925533 = sum of:
    0.01925533 = product of:
      0.03851066 = sum of:
        0.03851066 = weight(_text_:management in 2389) [ClassicSimilarity], result of:
          0.03851066 = score(doc=2389,freq=2.0), product of:
            0.17235184 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.051133685 = queryNorm
            0.22344214 = fieldWeight in 2389, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.046875 = fieldNorm(doc=2389)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

This article analyzes the collaboration trends, authorship and keywords of all research articles published in the Journal of American Society for Information Science and Technology (JASIST). Comparing the articles between two 10-year periods, namely, 1988-1997 and 1998-2007, the three-fold objectives are to analyze the shifts in (a) authors' collaboration trends (b) top authors, their affiliations as well as the pattern of coauthorship among them, and (c) top keywords and the subdisciplines from which they emerge. The findings reveal a distinct tendency towards collaboration among authors, with external collaborations becoming more prevalent. Top authors have grown in diversity from those being affiliated predominantly with library/information-related departments to include those from information systems management, information technology, businesss, and the humanities. Amid heterogeneous clusters of collaboration among top authors, strongly connected cross-disciplinary coauthor pairs have become more prevalent. Correspondingly, the distribution of top keywords' occurrences that leans heavily on core information science has shifted towards other subdisciplines such as information technology and sociobehavioral science.

0.0057732575 = product of:
  0.017319772 = sum of:
    0.017319772 = product of:
      0.034639545 = sum of:
        0.034639545 = weight(_text_:22 in 2738) [ClassicSimilarity], result of:
          0.034639545 = score(doc=2738,freq=2.0), product of:
            0.17906146 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051133685 = queryNorm
            0.19345059 = fieldWeight in 2738, 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=2738)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 3.2009 12:51:47

0.0042789625 = product of:
  0.0128368875 = sum of:
    0.0128368875 = product of:
      0.025673775 = sum of:
        0.025673775 = weight(_text_:management in 3391) [ClassicSimilarity], result of:
          0.025673775 = score(doc=3391,freq=2.0), product of:
            0.17235184 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.051133685 = queryNorm
            0.14896142 = fieldWeight in 3391, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.03125 = fieldNorm(doc=3391)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

For the sake of national security, very large volumes of data and information are generated and gathered daily. Much of this data and information is written in different languages, stored in different locations, and may be seemingly unconnected. Crosslingual semantic interoperability is a major challenge to generate an overview of this disparate data and information so that it can be analyzed, shared, searched, and summarized. The recent terrorist attacks and the tragic events of September 11, 2001 have prompted increased attention an national security and criminal analysis. Many Asian countries and cities, such as Japan, Taiwan, and Singapore, have been advised that they may become the next targets of terrorist attacks. Semantic interoperability has been a focus in digital library research. Traditional information retrieval (IR) approaches normally require a document to share some common keywords with the query. Generating the associations for the related terms between the two term spaces of users and documents is an important issue. The problem can be viewed as the creation of a thesaurus. Apart from this, terrorists and criminals may communicate through letters, e-mails, and faxes in languages other than English. The translation ambiguity significantly exacerbates the retrieval problem. The problem is expanded to crosslingual semantic interoperability. In this paper, we focus an the English/Chinese crosslingual semantic interoperability problem. However, the developed techniques are not limited to English and Chinese languages but can be applied to many other languages. English and Chinese are popular languages in the Asian region. Much information about national security or crime is communicated in these languages. An efficient automatically generated thesaurus between these languages is important to crosslingual information retrieval between English and Chinese languages. To facilitate crosslingual information retrieval, a corpus-based approach uses the term co-occurrence statistics in parallel or comparable corpora to construct a statistical translation model to cross the language boundary. In this paper, the text based approach to align English/Chinese Hong Kong Police press release documents from the Web is first presented. We also introduce an algorithmic approach to generate a robust knowledge base based an statistical correlation analysis of the semantics (knowledge) embedded in the bilingual press release corpus. The research output consisted of a thesaurus-like, semantic network knowledge base, which can aid in semanticsbased crosslingual information management and retrieval.

0.00404128 = product of:
  0.01212384 = sum of:
    0.01212384 = product of:
      0.02424768 = sum of:
        0.02424768 = weight(_text_:22 in 1616) [ClassicSimilarity], result of:
          0.02424768 = score(doc=1616,freq=2.0), product of:
            0.17906146 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051133685 = queryNorm
            0.1354154 = fieldWeight in 1616, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1616)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The information available in languages other than English in the World Wide Web is increasing significantly. According to a report from Computer Economics in 1999, 54% of Internet users are English speakers ("English Will Dominate Web for Only Three More Years," Computer Economics, July 9, 1999, http://www.computereconomics. com/new4/pr/pr990610.html). However, it is predicted that there will be only 60% increase in Internet users among English speakers verses a 150% growth among nonEnglish speakers for the next five years. By 2005, 57% of Internet users will be non-English speakers. A report by CNN.com in 2000 showed that the number of Internet users in China had been increased from 8.9 million to 16.9 million from January to June in 2000 ("Report: China Internet users double to 17 million," CNN.com, July, 2000, http://cnn.org/2000/TECH/computing/07/27/ china.internet.reut/index.html). According to Nielsen/ NetRatings, there was a dramatic leap from 22.5 millions to 56.6 millions Internet users from 2001 to 2002. China had become the second largest global at-home Internet population in 2002 (US's Internet population was 166 millions) (Robyn Greenspan, "China Pulls Ahead of Japan," Internet.com, April 22, 2002, http://cyberatias.internet.com/big-picture/geographics/article/0,,5911_1013841,00. html). All of the evidences reveal the importance of crosslingual research to satisfy the needs in the near future. Digital library research has been focusing in structural and semantic interoperability in the past. Searching and retrieving objects across variations in protocols, formats and disciplines are widely explored (Schatz, B., & Chen, H. (1999). Digital libraries: technological advances and social impacts. IEEE Computer, Special Issue an Digital Libraries, February, 32(2), 45-50.; Chen, H., Yen, J., & Yang, C.C. (1999). International activities: development of Asian digital libraries. IEEE Computer, Special Issue an Digital Libraries, 32(2), 48-49.). However, research in crossing language boundaries, especially across European languages and Oriental languages, is still in the initial stage. In this proposal, we put our focus an cross-lingual semantic interoperability by developing automatic generation of a cross-lingual thesaurus based an English/Chinese parallel corpus. When the searchers encounter retrieval problems, Professional librarians usually consult the thesaurus to identify other relevant vocabularies. In the problem of searching across language boundaries, a cross-lingual thesaurus, which is generated by co-occurrence analysis and Hopfield network, can be used to generate additional semantically relevant terms that cannot be obtained from dictionary. In particular, the automatically generated cross-lingual thesaurus is able to capture the unknown words that do not exist in a dictionary, such as names of persons, organizations, and events. Due to Hong Kong's unique history background, both English and Chinese are used as official languages in all legal documents. Therefore, English/Chinese cross-lingual information retrieval is critical for applications in courts and the government. In this paper, we develop an automatic thesaurus by the Hopfield network based an a parallel corpus collected from the Web site of the Department of Justice of the Hong Kong Special Administrative Region (HKSAR) Government. Experiments are conducted to measure the precision and recall of the automatic generated English/Chinese thesaurus. The result Shows that such thesaurus is a promising tool to retrieve relevant terms, especially in the language that is not the same as the input term. The direct translation of the input term can also be retrieved in most of the cases.