Search (44 results, page 1 of 3)

0.012947198 = product of:
  0.04531519 = sum of:
    0.019307088 = weight(_text_:retrieval in 1046) [ClassicSimilarity], result of:
      0.019307088 = score(doc=1046,freq=2.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.16710453 = fieldWeight in 1046, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1046)
    0.026008105 = weight(_text_:internet in 1046) [ClassicSimilarity], result of:
      0.026008105 = score(doc=1046,freq=4.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.23064373 = fieldWeight in 1046, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1046)
  0.2857143 = coord(2/7)

Abstract

The dynamic nature and size of the Internet can result in difficulty finding relevant information. Most users typically express their information need via short queries to search engines and they often have to physically sift through the search results based on relevance ranking set by the search engines, making the process of relevance judgement time-consuming. In this paper, we describe a novel representation technique which makes use of the Web structure together with summarisation techniques to better represent knowledge in actual Web Documents. We named the proposed technique as Semantic Virtual Document (SVD). We will discuss how the proposed SVD can be used together with a suitable clustering algorithm to achieve an automatic content-based categorization of similar Web Documents. The auto-categorization facility as well as a "Tree-like" Graphical User Interface (GUI) for post-retrieval document browsing enhances the relevance judgement process for Internet users. Furthermore, we will introduce how our cluster-biased automatic query expansion technique can be used to overcome the ambiguity of short queries typically given by users. We will outline our experimental design to evaluate the effectiveness of the proposed SVD for representation and present a prototype called iSEARCH (Intelligent SEarch And Review of Cluster Hierarchy) for Web content mining. Our results confirm, quantify and extend previous research using Web structure and summarisation techniques, introducing novel techniques for knowledge representation to enhance Web content mining.

0.01292489 = product of:
  0.045237113 = sum of:
    0.023168506 = weight(_text_:retrieval in 1611) [ClassicSimilarity], result of:
      0.023168506 = score(doc=1611,freq=2.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.20052543 = fieldWeight in 1611, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=1611)
    0.022068607 = weight(_text_:internet in 1611) [ClassicSimilarity], result of:
      0.022068607 = score(doc=1611,freq=2.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.1957077 = fieldWeight in 1611, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=1611)
  0.2857143 = coord(2/7)

Footnote

Teil eines Themenheftes: "Web retrieval and mining: A machine learning perspective"

Theme

Internet

0.01292489 = product of:
  0.045237113 = sum of:
    0.023168506 = weight(_text_:retrieval in 2386) [ClassicSimilarity], result of:
      0.023168506 = score(doc=2386,freq=2.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.20052543 = fieldWeight in 2386, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=2386)
    0.022068607 = weight(_text_:internet in 2386) [ClassicSimilarity], result of:
      0.022068607 = score(doc=2386,freq=2.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.1957077 = fieldWeight in 2386, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=2386)
  0.2857143 = coord(2/7)

Abstract

Bibliometrics is understood as statistical analysis of scientific structures and processes. The analyzed data result from information and administrative actions. The demand for quality judgments or the discovering of new structures and information means that Bibliometrics takes on the role of being exploratory and decision supporting. To the extent that it has acquired important features of Data Mining, the analysis of text and internet material can be viewed as an additional challenge. In the sense of an evaluative approach Bibliometrics can also be seen to apply inference procedures as well as navigation tools.

0.010770742 = product of:
  0.037697595 = sum of:
    0.019307088 = weight(_text_:retrieval in 606) [ClassicSimilarity], result of:
      0.019307088 = score(doc=606,freq=2.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.16710453 = fieldWeight in 606, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=606)
    0.018390507 = weight(_text_:internet in 606) [ClassicSimilarity], result of:
      0.018390507 = score(doc=606,freq=2.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.16308975 = fieldWeight in 606, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0390625 = fieldNorm(doc=606)
  0.2857143 = coord(2/7)

Abstract

With more and more information available on the Internet, the task of making personalized recommendations to assist the user's navigation has become increasingly important. Considering there might be millions of users with different backgrounds accessing a Web site everyday, it is infeasible to build a separate recommendation system for each user. To address this problem, clustering techniques can first be employed to discover user groups. Then, user navigation patterns for each group can be discovered, to allow the adaptation of a Web site to the interest of each individual group. In this paper, we propose to model user access sequences as stochastic processes, and a mixture of Markov models based approach is taken to cluster users and to capture the sequential relationships inherent in user access histories. Several important issues that arise in constructing the Markov models are also addressed. The first issue lies in the complexity of the mixture of Markov models. To improve the efficiency of building/maintaining the mixture of Markov models, we develop a lightweight adapt-ive algorithm to update the model parameters without recomputing model parameters from scratch. The second issue concerns the proper selection of training data for building the mixture of Markov models. We investigate two different training data selection strategies and perform extensive experiments to compare their effectiveness on a real dataset that is generated by a Web-based knowledge management system, Livelink.

Footnote

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

0.007921508 = product of:
  0.05545055 = sum of:
    0.05545055 = product of:
      0.08317582 = sum of:
        0.04177581 = weight(_text_:29 in 1270) [ClassicSimilarity], result of:
          0.04177581 = score(doc=1270,freq=2.0), product of:
            0.13436082 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03819578 = queryNorm
            0.31092256 = fieldWeight in 1270, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0625 = fieldNorm(doc=1270)
        0.041400008 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
          0.041400008 = score(doc=1270,freq=2.0), product of:
            0.13375512 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03819578 = queryNorm
            0.30952093 = fieldWeight in 1270, 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=1270)
      0.6666667 = coord(2/3)
  0.14285715 = coord(1/7)

Date

5. 4.1996 15:29:15

Source

Information systems. 22(1997) nos.5/6, S.333-347

0.0077410867 = product of:
  0.027093802 = sum of:
    0.018390507 = weight(_text_:internet in 3603) [ClassicSimilarity], result of:
      0.018390507 = score(doc=3603,freq=2.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.16308975 = fieldWeight in 3603, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3603)
    0.008703294 = product of:
      0.026109882 = sum of:
        0.026109882 = weight(_text_:29 in 3603) [ClassicSimilarity], result of:
          0.026109882 = score(doc=3603,freq=2.0), product of:
            0.13436082 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03819578 = queryNorm
            0.19432661 = fieldWeight in 3603, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3603)
      0.33333334 = coord(1/3)
  0.2857143 = coord(2/7)

Source

Gaining insight from research information (CRIS2002): Proceedings of the 6th International Conference an Current Research Information Systems, University of Kassel, August 29 - 31, 2002. Eds: W. Adamczak u. A. Nase

Theme

Internet

0.007297394 = product of:
  0.051081754 = sum of:
    0.051081754 = weight(_text_:retrieval in 607) [ClassicSimilarity], result of:
      0.051081754 = score(doc=607,freq=14.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.442117 = fieldWeight in 607, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=607)
  0.14285715 = coord(1/7)

Abstract

Understanding what kinds of Web pages are the most useful for Web search engine users is a critical task in Web information retrieval (IR). Most previous works used hyperlink analysis algorithms to solve this problem. However, little research has been focused on query-independent Web data cleansing for Web IR. In this paper, we first provide analysis of the differences between retrieval target pages and ordinary ones based on more than 30 million Web pages obtained from both the Text Retrieval Conference (TREC) and a widely used Chinese search engine, SOGOU (www.sogou.com). We further propose a learning-based data cleansing algorithm for reducing Web pages that are unlikely to be useful for user requests. We found that there exists a large proportion of low-quality Web pages in both the English and the Chinese Web page corpus, and retrieval target pages can be identified using query-independent features and cleansing algorithms. The experimental results showed that our algorithm is effective in reducing a large portion of Web pages with a small loss in retrieval target pages. It makes it possible for Web IR tools to meet a large fraction of users' needs with only a small part of pages on the Web. These results may help Web search engines make better use of their limited storage and computation resources to improve search performance.

Footnote

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

0.007297394 = product of:
  0.051081754 = sum of:
    0.051081754 = weight(_text_:retrieval in 3607) [ClassicSimilarity], result of:
      0.051081754 = score(doc=3607,freq=14.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.442117 = fieldWeight in 3607, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3607)
  0.14285715 = coord(1/7)

Abstract

The abundance of medical resources has encouraged the development of systems that allow for efficient searches of information in large medical image data sets. State-of-the-art image retrieval models are classified into three categories: content-based (visual) models, textual models, and combined models. Content-based models use visual features to answer image queries, textual image retrieval models use word matching to answer textual queries, and combined image retrieval models, use both textual and visual features to answer queries. Nevertheless, most of previous works in this field have used the same image retrieval model independently of the query type. In this article, we define a list of generic and specific medical query features and exploit them in an association rule mining technique to discover correlations between query features and image retrieval models. Based on these rules, we propose to use an associative classifier (NaiveClass) to find the best suitable retrieval model given a new textual query. We also propose a second associative classifier (SmartClass) to select the most appropriate default class for the query. Experiments are performed on Medical ImageCLEF queries from 2008 to 2012 to evaluate the impact of the proposed query features on the classification performance. The results show that combining our proposed specific and generic query features is effective in query classification.

0.006931318 = product of:
  0.048519224 = sum of:
    0.048519224 = product of:
      0.072778836 = sum of:
        0.036553834 = weight(_text_:29 in 2908) [ClassicSimilarity], result of:
          0.036553834 = score(doc=2908,freq=2.0), product of:
            0.13436082 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03819578 = queryNorm
            0.27205724 = fieldWeight in 2908, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2908)
        0.036225006 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
          0.036225006 = score(doc=2908,freq=2.0), product of:
            0.13375512 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03819578 = queryNorm
            0.2708308 = fieldWeight in 2908, 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=2908)
      0.6666667 = coord(2/3)
  0.14285715 = coord(1/7)

Date

5. 4.1996 15:29:15

Source

Information systems. 22(1997) nos.5/6, S.349-385

0.0066195736 = product of:
  0.046337012 = sum of:
    0.046337012 = weight(_text_:retrieval in 1067) [ClassicSimilarity], result of:
      0.046337012 = score(doc=1067,freq=8.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.40105087 = fieldWeight in 1067, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=1067)
  0.14285715 = coord(1/7)

Abstract

In this paper we combine computer vision and data mining techniques to model high-level concepts for image retrieval, on the basis of basic perceptual features of the human visual system. High-level concepts related to these features are learned and represented by means of a set of fuzzy association rules. The concepts so acquired can be used for image retrieval with the advantage that it is not needed to provide an image as a query. Instead, a query is formulated by using the labels that identify the learned concepts as search terms, and the retrieval process calculates the relevance of an image to the query by an inference mechanism. An additional feature of our methodology is that it can capture user's subjectivity. For that purpose, fuzzy sets theory is employed to measure user's assessments about the fulfillment of a concept by an image.

0.0057327193 = product of:
  0.040129032 = sum of:
    0.040129032 = weight(_text_:retrieval in 1326) [ClassicSimilarity], result of:
      0.040129032 = score(doc=1326,freq=6.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.34732026 = fieldWeight in 1326, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=1326)
  0.14285715 = coord(1/7)

Abstract

The effective use of corporate memory is becoming increasingly important because every aspect of e-business requires access to information repositories. Unfortunately, less-than-satisfying effectiveness in state-of-the-art information-retrieval techniques is well known, even for some of the best search engines such as Google. In this study, the authors resolve this retrieval ineffectiveness problem by developing a new framework for predicting query performance, which is the first step toward better retrieval effectiveness. Specifically, they examine the relationship between query performance and query context. A query context consists of the query itself, the document collection, and the interaction between the two. The authors first analyze the characteristics of query context and develop various features for predicting query performance. Then, they propose a context-sensitive model for predicting query performance based on the characteristics of the query and the document collection. Finally, they validate this model with respect to five real-world collections of documents and demonstrate its utility in routing queries to the correct repository with high accuracy.

0.005460869 = product of:
  0.038226083 = sum of:
    0.038226083 = weight(_text_:retrieval in 600) [ClassicSimilarity], result of:
      0.038226083 = score(doc=600,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.33085006 = fieldWeight in 600, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=600)
  0.14285715 = coord(1/7)

Footnote

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

0.005201621 = product of:
  0.036411345 = sum of:
    0.036411345 = weight(_text_:internet in 3834) [ClassicSimilarity], result of:
      0.036411345 = score(doc=3834,freq=4.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.32290122 = fieldWeight in 3834, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3834)
  0.14285715 = coord(1/7)

Abstract

Offers brief accounts of Internet search tools. Covers the Lycos revamp; the new navigation service produced jointly by Excite and Netscape, delivering a language specific, locally relevant Web guide for Japan, Germany, France, the UK and Australia; InfoWatcher, a combination offline browser, search engine and push product from Carvelle Inc., USA; Alexa by Alexa Internet and WBI from IBM which are free and provide users with information on how others have used the Web sites which they are visiting; and Concept Explorer from Knowledge Discovery Systems, Inc., California which performs data mining from the Web, Usenet groups, MEDLINE and the US Patent and Trademark Office patent abstracts

0.0047772657 = product of:
  0.033440858 = sum of:
    0.033440858 = weight(_text_:retrieval in 605) [ClassicSimilarity], result of:
      0.033440858 = score(doc=605,freq=6.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.28943354 = fieldWeight in 605, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=605)
  0.14285715 = coord(1/7)

Abstract

Documents discussing public affairs, common themes, interesting products, and so on, are reported and distributed on the Web. Positive and negative opinions embedded in documents are useful references and feedbacks for governments to improve their services, for companies to market their products, and for customers to purchase their objects. Web opinion mining aims to extract, summarize, and track various aspects of subjective information on the Web. Mining subjective information enables traditional information retrieval (IR) systems to retrieve more data from human viewpoints and provide information with finer granularity. Opinion extraction identifies opinion holders, extracts the relevant opinion sentences, and decides their polarities. Opinion summarization recognizes the major events embedded in documents and summarizes the supportive and the nonsupportive evidence. Opinion tracking captures subjective information from various genres and monitors the developments of opinions from spatial and temporal dimensions. To demonstrate and evaluate the proposed opinion mining algorithms, news and bloggers' articles are adopted. Documents in the evaluation corpora are tagged in different granularities from words, sentences to documents. In the experiments, positive and negative sentiment words and their weights are mined on the basis of Chinese word structures. The f-measure is 73.18% and 63.75% for verbs and nouns, respectively. Utilizing the sentiment words mined together with topical words, we achieve f-measure 62.16% at the sentence level and 74.37% at the document level.

Footnote

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

0.0046807453 = product of:
  0.032765217 = sum of:
    0.032765217 = weight(_text_:retrieval in 4716) [ClassicSimilarity], result of:
      0.032765217 = score(doc=4716,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.2835858 = fieldWeight in 4716, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=4716)
  0.14285715 = coord(1/7)

Abstract

In this paper we give a synoptic view of the growth of the text processing technology of informatione xtraction (IE) whose function is to extract information about a pre-specified set of entities, relations or events from natural language texts and to record this information in structured representations called templates. Here we describe the nature of the IE task, review the history of the area from its origins in AI work in the 1960s and 70s till the present, discuss the techniques being used to carry out the task, describe application areas where IE systems are or are about to be at work, and conclude with a discussion of the challenges facing the area. What emerges is a picture of an exciting new text processing technology with a host of new applications, both on its own and in conjunction with other technologies, such as information retrieval, machine translation and data mining

0.0046807453 = product of:
  0.032765217 = sum of:
    0.032765217 = weight(_text_:retrieval in 91) [ClassicSimilarity], result of:
      0.032765217 = score(doc=91,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.2835858 = fieldWeight in 91, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=91)
  0.14285715 = coord(1/7)

Abstract

Electronic discovery (eDiscovery) is the process of collecting and analyzing electronic documents to determine their relevance to a legal matter. Office technology has advanced and eased the requirements necessary to create a document. As such, the volume of data has outgrown the manual processes previously used to make relevance judgments. Methods of text mining and information retrieval have been put to use in eDiscovery to help tame the volume of data; however, the results have been uneven. This chapter looks at the historical bias of the collection process. The authors examine how tools like classifiers, latent semantic analysis, and non-negative matrix factorization deal with nuances of the collection process.

Source

Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a

0.0046807453 = product of:
  0.032765217 = sum of:
    0.032765217 = weight(_text_:retrieval in 92) [ClassicSimilarity], result of:
      0.032765217 = score(doc=92,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.2835858 = fieldWeight in 92, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=92)
  0.14285715 = coord(1/7)

Abstract

In this paper the authors will present research on the combination of two methods of data mining: text classification and maximal association rules. Text classification has been the focus of interest of many researchers for a long time. However, the results take the form of lists of words (classes) that people often do not know what to do with. The use of maximal association rules induced a number of advantages: (1) the detection of dependencies and correlations between the relevant units of information (words) of different classes, (2) the extraction of hidden knowledge, often relevant, from a large volume of data. The authors will show how this combination can improve the process of information retrieval.

Source

Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a

0.0046807453 = product of:
  0.032765217 = sum of:
    0.032765217 = weight(_text_:retrieval in 521) [ClassicSimilarity], result of:
      0.032765217 = score(doc=521,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.2835858 = fieldWeight in 521, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=521)
  0.14285715 = coord(1/7)

Abstract

Applying text mining techniques to legal issues has been an emerging research topic in recent years. Although some previous studies focused on assisting professionals in the retrieval of related legal documents, they did not take into account the general public and their difficulty in describing legal problems in professional legal terms. Because this problem has not been addressed by previous research, this study aims to design a text-mining-based method that allows the general public to use everyday vocabulary to search for and retrieve criminal judgments. The experimental results indicate that our method can help the general public, who are not familiar with professional legal terms, to acquire relevant criminal judgments more accurately and effectively.

0.0042035445 = product of:
  0.02942481 = sum of:
    0.02942481 = weight(_text_:internet in 505) [ClassicSimilarity], result of:
      0.02942481 = score(doc=505,freq=2.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.2609436 = fieldWeight in 505, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0625 = fieldNorm(doc=505)
  0.14285715 = coord(1/7)

Theme

Internet

0.003900621 = product of:
  0.027304346 = sum of:
    0.027304346 = weight(_text_:retrieval in 604) [ClassicSimilarity], result of:
      0.027304346 = score(doc=604,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.23632148 = fieldWeight in 604, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=604)
  0.14285715 = coord(1/7)

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"