Search (11 results, page 1 of 1)

0.0015337638 = product of:
  0.012270111 = sum of:
    0.012270111 = product of:
      0.03681033 = sum of:
        0.03681033 = weight(_text_:problem in 4114) [ClassicSimilarity], result of:
          0.03681033 = score(doc=4114,freq=2.0), product of:
            0.13082431 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.030822188 = queryNorm
            0.28137225 = fieldWeight in 4114, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.046875 = fieldNorm(doc=4114)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

Abstract

Adverse Drug Reactions (ADRs) have become a serious health problem and even a leading cause of death in the United States. Pre-marketing clinical trials and traditional post-marketing surveillance using voluntary and spontaneous report systems are insufficient for ADR detection. On the other hand, online health forums provide valuable evidences in a large scale and in a timely fashion through the active participation of patients, caregivers, and doctors. In this article, we present patient-centered and experience-aware mining framework for effective ADR discovery using online health forum data. Our experimental evaluation with both an official ADR knowledge base and human-annotated ground truth verifies the effectiveness of the proposed method for ADR discovery.

0.0014046291 = product of:
  0.011237033 = sum of:
    0.011237033 = product of:
      0.033711098 = sum of:
        0.033711098 = weight(_text_:29 in 1197) [ClassicSimilarity], result of:
          0.033711098 = score(doc=1197,freq=2.0), product of:
            0.108422816 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.030822188 = queryNorm
            0.31092256 = fieldWeight in 1197, 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=1197)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

Date

29. 1.2014 16:31:35

0.0013919937 = product of:
  0.01113595 = sum of:
    0.01113595 = product of:
      0.03340785 = sum of:
        0.03340785 = weight(_text_:22 in 7744) [ClassicSimilarity], result of:
          0.03340785 = score(doc=7744,freq=2.0), product of:
            0.10793405 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.030822188 = queryNorm
            0.30952093 = fieldWeight in 7744, 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=7744)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

Date

22. 6.1997 16:34:51

0.0012781365 = product of:
  0.010225092 = sum of:
    0.010225092 = product of:
      0.030675275 = sum of:
        0.030675275 = weight(_text_:problem in 606) [ClassicSimilarity], result of:
          0.030675275 = score(doc=606,freq=2.0), product of:
            0.13082431 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.030822188 = queryNorm
            0.23447686 = fieldWeight in 606, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.0390625 = fieldNorm(doc=606)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

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.

0.0012781365 = product of:
  0.010225092 = sum of:
    0.010225092 = product of:
      0.030675275 = sum of:
        0.030675275 = weight(_text_:problem in 607) [ClassicSimilarity], result of:
          0.030675275 = score(doc=607,freq=2.0), product of:
            0.13082431 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.030822188 = queryNorm
            0.23447686 = fieldWeight in 607, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.0390625 = fieldNorm(doc=607)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

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.

0.0012781365 = product of:
  0.010225092 = sum of:
    0.010225092 = product of:
      0.030675275 = sum of:
        0.030675275 = weight(_text_:problem in 1672) [ClassicSimilarity], result of:
          0.030675275 = score(doc=1672,freq=2.0), product of:
            0.13082431 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.030822188 = queryNorm
            0.23447686 = fieldWeight in 1672, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1672)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

Abstract

Name ambiguity in the context of bibliographic citation affects the quality of services in digital libraries. Previous methods are not widely applied in practice because of their high computational complexity and their strong dependency on excessive attributes, such as institutional affiliation, research area, address, etc., which are difficult to obtain in practice. To solve this problem, we propose a novel coarse-to-fine framework for name disambiguation which sequentially employs 3 common and easily accessible attributes (i.e., coauthor name, article title, and publication venue). Our proposed framework is based on multiple clustering and consists of 3 steps: (a) clustering articles by coauthorship and obtaining rough clusters, that is fragments; (b) clustering fragments obtained in step 1 by title information and getting bigger fragments; (c) and clustering fragments obtained in step 2 by the latent relations among venues. Experimental results on a Digital Bibliography and Library Project (DBLP) data set show that our method outperforms the existing state-of-the-art methods by 2.4% to 22.7% on the average pairwise F1 score and is 10 to 100 times faster in terms of execution time.

0.0012781365 = product of:
  0.010225092 = sum of:
    0.010225092 = product of:
      0.030675275 = sum of:
        0.030675275 = weight(_text_:problem in 98) [ClassicSimilarity], result of:
          0.030675275 = score(doc=98,freq=2.0), product of:
            0.13082431 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.030822188 = queryNorm
            0.23447686 = fieldWeight in 98, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.0390625 = fieldNorm(doc=98)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

Abstract

With the development of Web-based social networks, many personalized tag recommendation approaches based on multi-information have been proposed. Due to the differences in users' preferences, different users care about different kinds of information. In the meantime, different elements within each kind of information are differentially informative for user tagging behaviors. In this context, how to effectively integrate different elements and different information separately becomes a key part of tag recommendation. However, the existing methods ignore this key part. In order to address this problem, we propose a deep neural network for tag recommendation. Specifically, we model two important attentive aspects with a hierarchical attention model. For different user-item pairs, the bottom layered attention network models the influence of different elements on the features representation of the information while the top layered attention network models the attentive scores of different information. To verify the effectiveness of the proposed method, we conduct extensive experiments on two real-world data sets. The results show that using attention network and different kinds of information can significantly improve the performance of the recommendation model, and verify the effectiveness and superiority of our proposed model.

0.0010225092 = product of:
  0.008180073 = sum of:
    0.008180073 = product of:
      0.02454022 = sum of:
        0.02454022 = weight(_text_:problem in 4239) [ClassicSimilarity], result of:
          0.02454022 = score(doc=4239,freq=2.0), product of:
            0.13082431 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.030822188 = queryNorm
            0.1875815 = fieldWeight in 4239, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.03125 = fieldNorm(doc=4239)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

Abstract

With the advent of various services and applications of Semantic Web, semantic annotation has emerged as an important research topic. The application of semantically annotated ontology had been evident in numerous information processing and retrieval tasks. One of such tasks is utilizing the semantically annotated ontology in product design which is able to suggest many important applications that are critical to aid various design related tasks. However, ontology development in design engineering remains a time consuming and tedious task that demands considerable human efforts. In the context of product family design, management of different product information that features efficient indexing, update, navigation, search and retrieval across product families is both desirable and challenging. For instance, an efficient way of retrieving timely information on product family can be useful for tasks such as product family redesign and new product variant derivation when requirements change. However, the current research and application of information search and navigation in product family is mostly limited to its structural aspect which is insufficient to handle advanced information search especially when the query targets at multiple aspects of a product. This paper attempts to address this problem by proposing an information search and retrieval framework based on the semantically annotated multi-facet product family ontology. Particularly, we propose a document profile (DP) model to suggest semantic tags for annotation purpose. Using a case study of digital camera families, we illustrate how the faceted search and retrieval of product information can be accomplished. We also exemplify how we can derive new product variants based on the designer's query of requirements via the faceted search and retrieval of product family information. Lastly, in order to highlight the value of our current work, we briefly discuss some further research and applications in design decision support, e.g. commonality analysis and variety comparison, based on the semantically annotated multi-facet product family ontology.

0.0010225092 = product of:
  0.008180073 = sum of:
    0.008180073 = product of:
      0.02454022 = sum of:
        0.02454022 = weight(_text_:problem in 1485) [ClassicSimilarity], result of:
          0.02454022 = score(doc=1485,freq=2.0), product of:
            0.13082431 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.030822188 = queryNorm
            0.1875815 = fieldWeight in 1485, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.03125 = fieldNorm(doc=1485)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

Abstract

Product family design is one of the prevailing approaches in realizing mass customization. With the increasing number of product offerings targeted at different market segments, the issue of information management in product family design, that is related to an efficient and effective storage, sharing and timely retrieval of design information, has become more complicated and challenging. Product family modelling schema reported in the literature generally stress the component aspects of a product family and its analysis, with a limited capability to model complex inter-relations between physical components and other required information in different semantic orientations, such as manufacturing, material and marketing wise. To tackle this problem, ontology-based representation has been identified as a promising solution to redesign product platforms especially in a semantically rich environment. However, ontology development in design engineering demands a great deal of time commitment and human effort to process complex information. When a large variety of products are available, particularly in the consumer market, a more efficient method for building a product family ontology with the incorporation of multi-faceted semantic information is therefore highly desirable. In this study, we propose a methodology for building a semantically annotated multi-faceted ontology for product family modelling that is able to automatically suggest semantically-related annotations based on the design and manufacturing repository. The six steps of building such ontology: formation of product family taxonomy; extraction of entities; faceted unit generation and concept identification; facet modelling and semantic annotation; formation of a semantically annotated multi-faceted product family ontology (MFPFO); and ontology validation and evaluation are discussed in detail. Using a family of laptop computers as an illustrative example, we demonstrate how our methodology can be deployed step by step to create a semantically annotated MFPFO. Finally, we briefly discuss future research issues as well as interesting applications that can be further pursued based on the MFPFO developed.

8.7789324E-4 = product of:
  0.007023146 = sum of:
    0.007023146 = product of:
      0.021069437 = sum of:
        0.021069437 = weight(_text_:29 in 603) [ClassicSimilarity], result of:
          0.021069437 = score(doc=603,freq=2.0), product of:
            0.108422816 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.030822188 = queryNorm
            0.19432661 = fieldWeight in 603, 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=603)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

Date

5. 6.2022 17:03:29

8.699961E-4 = product of:
  0.0069599687 = sum of:
    0.0069599687 = product of:
      0.020879906 = sum of:
        0.020879906 = weight(_text_:22 in 5492) [ClassicSimilarity], result of:
          0.020879906 = score(doc=5492,freq=2.0), product of:
            0.10793405 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.030822188 = queryNorm
            0.19345059 = fieldWeight in 5492, 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=5492)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

Date

20. 1.2015 18:30:22