Search (8 results, page 1 of 1)

0.022297796 = product of:
  0.04459559 = sum of:
    0.027942104 = weight(_text_:services in 4239) [ClassicSimilarity], result of:
      0.027942104 = score(doc=4239,freq=2.0), product of:
        0.17221296 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.046906993 = queryNorm
        0.1622532 = fieldWeight in 4239, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.03125 = fieldNorm(doc=4239)
    0.016653487 = product of:
      0.033306975 = sum of:
        0.033306975 = weight(_text_:management in 4239) [ClassicSimilarity], result of:
          0.033306975 = score(doc=4239,freq=4.0), product of:
            0.15810528 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.046906993 = queryNorm
            0.21066327 = fieldWeight in 4239, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.03125 = fieldNorm(doc=4239)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

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.

Source

Information processing and management. 46(2010) no.4, S.479-493

0.015303934 = product of:
  0.061215736 = sum of:
    0.061215736 = sum of:
      0.029439485 = weight(_text_:management in 5492) [ClassicSimilarity], result of:
        0.029439485 = score(doc=5492,freq=2.0), product of:
          0.15810528 = queryWeight, product of:
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.046906993 = queryNorm
          0.18620178 = fieldWeight in 5492, 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=5492)
      0.03177625 = weight(_text_:22 in 5492) [ClassicSimilarity], result of:
        0.03177625 = score(doc=5492,freq=2.0), product of:
          0.1642603 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046906993 = 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.25 = coord(1/4)

Date

20. 1.2015 18:30:22

Source

Aslib journal of information management. 71(2019) no.2, S.155-175

0.012348781 = product of:
  0.049395125 = sum of:
    0.049395125 = weight(_text_:services in 234) [ClassicSimilarity], result of:
      0.049395125 = score(doc=234,freq=4.0), product of:
        0.17221296 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.046906993 = queryNorm
        0.28682584 = fieldWeight in 234, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.0390625 = fieldNorm(doc=234)
  0.25 = coord(1/4)

Abstract

The scale of knowledge is growing rapidly in the big data environment, and traditional knowledge organization and services have faced the dilemma of semantic inaccuracy and untimeliness. From a knowledge fusion perspective-combining the precise semantic superiority of traditional ontology with the large-scale graph processing power and the predicate attribute expression ability of property graph-this paper presents an ontology and property graph fusion framework (OPGFF). The fusion process is divided into content layer fusion and constraint layer fusion. The result of the fusion, that is, the knowledge representation model is called knowledge big graph. In addition, this paper applies the knowledge big graph model to the ownership network in the China's financial field and builds a financial ownership knowledge big graph. Furthermore, this paper designs and implements six consistency inference algorithms for finding contradictory data and filling in missing data in the financial ownership knowledge big graph, five of which are completely domain agnostic. The correctness and validity of the algorithms have been experimentally verified with actual data. The fusion OPGFF framework and the implementation method of the knowledge big graph could provide technical reference for big data knowledge organization and services.

0.008731907 = product of:
  0.03492763 = sum of:
    0.03492763 = weight(_text_:services in 1672) [ClassicSimilarity], result of:
      0.03492763 = score(doc=1672,freq=2.0), product of:
        0.17221296 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.046906993 = queryNorm
        0.2028165 = fieldWeight in 1672, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1672)
  0.25 = coord(1/4)

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.0063552503 = product of:
  0.025421001 = sum of:
    0.025421001 = product of:
      0.050842002 = sum of:
        0.050842002 = weight(_text_:22 in 7744) [ClassicSimilarity], result of:
          0.050842002 = score(doc=7744,freq=2.0), product of:
            0.1642603 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046906993 = 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.5 = coord(1/2)
  0.25 = coord(1/4)

Date

22. 6.1997 16:34:51

0.00515191 = product of:
  0.02060764 = sum of:
    0.02060764 = product of:
      0.04121528 = sum of:
        0.04121528 = weight(_text_:management in 2723) [ClassicSimilarity], result of:
          0.04121528 = score(doc=2723,freq=2.0), product of:
            0.15810528 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.046906993 = queryNorm
            0.2606825 = fieldWeight in 2723, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2723)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Source

Information processing and management. 48(2012) no.4, S.791-801

0.0036799356 = product of:
  0.014719742 = sum of:
    0.014719742 = product of:
      0.029439485 = sum of:
        0.029439485 = weight(_text_:management in 606) [ClassicSimilarity], result of:
          0.029439485 = score(doc=606,freq=2.0), product of:
            0.15810528 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.046906993 = queryNorm
            0.18620178 = fieldWeight in 606, 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=606)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

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.0029439486 = product of:
  0.011775794 = sum of:
    0.011775794 = product of:
      0.023551589 = sum of:
        0.023551589 = weight(_text_:management in 1485) [ClassicSimilarity], result of:
          0.023551589 = score(doc=1485,freq=2.0), product of:
            0.15810528 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.046906993 = queryNorm
            0.14896142 = fieldWeight in 1485, 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=1485)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

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.