Search (14 results, page 1 of 1)

0.040442396 = product of:
  0.08088479 = sum of:
    0.051210128 = weight(_text_:data in 2723) [ClassicSimilarity], result of:
      0.051210128 = score(doc=2723,freq=4.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.34584928 = fieldWeight in 2723, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2723)
    0.029674664 = product of:
      0.05934933 = sum of:
        0.05934933 = weight(_text_:processing in 2723) [ClassicSimilarity], result of:
          0.05934933 = score(doc=2723,freq=2.0), product of:
            0.18956426 = queryWeight, product of:
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.046827413 = queryNorm
            0.3130829 = fieldWeight in 2723, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2723)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Abstract

The research question studied in this contribution is how to find an adequate representation to describe the diffusion of scientific ideas over time. We claim that citation data, at least of articles that act as concept symbols, can be considered to contain this information. As a case study we show how the founding article by Nobel Prize winner Kao illustrates the evolution of the field of fiber optics communication. We use a continuous description of discrete citation data in order to accentuate turning points and breakthroughs in the history of this field. Applying the principles explained in this contribution informetrics may reveal the trajectories along which science is developing.

Source

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

0.039516065 = product of:
  0.07903213 = sum of:
    0.057835944 = weight(_text_:data in 234) [ClassicSimilarity], result of:
      0.057835944 = score(doc=234,freq=10.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.39059696 = fieldWeight in 234, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0390625 = fieldNorm(doc=234)
    0.021196188 = product of:
      0.042392377 = sum of:
        0.042392377 = weight(_text_:processing in 234) [ClassicSimilarity], result of:
          0.042392377 = score(doc=234,freq=2.0), product of:
            0.18956426 = queryWeight, product of:
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.046827413 = queryNorm
            0.22363065 = fieldWeight in 234, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.0390625 = fieldNorm(doc=234)
      0.5 = coord(1/2)
  0.5 = coord(2/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.03338095 = product of:
  0.0667619 = sum of:
    0.04138403 = weight(_text_:data in 7744) [ClassicSimilarity], result of:
      0.04138403 = score(doc=7744,freq=2.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.2794884 = fieldWeight in 7744, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0625 = fieldNorm(doc=7744)
    0.025377871 = product of:
      0.050755743 = sum of:
        0.050755743 = weight(_text_:22 in 7744) [ClassicSimilarity], result of:
          0.050755743 = score(doc=7744,freq=2.0), product of:
            0.16398162 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046827413 = 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.5 = coord(2/4)

Abstract

Precision One MediaSource First Edition is the first film and video listing on CD-ROM containing bibliographic records and information about renatl sources. It was co-produced by the Brodart Co., Pennsylvania, and the Consortium of College and University Media Centres (CCUMC) and requires an IBM/campatible with hard disk, CD-ROM drive and DOS 3.3 or higher. MediaSource is intended for educational and business users and is of particular interest to public, school and academic libraries. Discusses installation, the interface and searching, data quality and documentation

Date

22. 6.1997 16:34:51

0.020863095 = product of:
  0.04172619 = sum of:
    0.02586502 = weight(_text_:data in 5492) [ClassicSimilarity], result of:
      0.02586502 = score(doc=5492,freq=2.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.17468026 = fieldWeight in 5492, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5492)
    0.01586117 = product of:
      0.03172234 = sum of:
        0.03172234 = weight(_text_:22 in 5492) [ClassicSimilarity], result of:
          0.03172234 = score(doc=5492,freq=2.0), product of:
            0.16398162 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046827413 = 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.5 = coord(1/2)
  0.5 = coord(2/4)

Abstract

Purpose Online knowledge communities make great contributions to global knowledge sharing and innovation. Resource tagging approaches have been widely adopted in such communities to describe, annotate and organize knowledge resources mainly through users' participation. However, it is unclear what causes the adoption of a particular resource tagging approach. The purpose of this paper is to identify factors that drive users to use a hybrid social tagging approach. Design/methodology/approach Technology acceptance model and social cognitive theory are adopted to support an integrated model proposed in this paper. Zhihu, one of the most popular online knowledge communities in China, is taken as the survey context. A survey was conducted with a questionnaire and collected data were analyzed through structural equation model. Findings A new hybrid social resource tagging approach was refined and described. The empirical results revealed that self-efficacy, perceived usefulness (PU) and perceived ease of use exert positive effect on users' attitude. Moreover, social influence, PU and attitude impact significantly on users' intention to use a hybrid social resource tagging approach. Originality/value Theoretically, this study enriches the type of resource tagging approaches and recognizes factors influencing user adoption to use it. Regarding the practical parts, the results provide online information system providers and designers with referential strategies to improve the performance of the current tagging approaches and promote them.

Date

20. 1.2015 18:30:22

0.015839024 = product of:
  0.063356094 = sum of:
    0.063356094 = weight(_text_:data in 5382) [ClassicSimilarity], result of:
      0.063356094 = score(doc=5382,freq=12.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.4278775 = fieldWeight in 5382, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5382)
  0.25 = coord(1/4)

Abstract

Two general challenges faced by data analysis are the existence of noise and the extraction of meaningful information from collected data. In this study, we used a multiscale framework to reduce the effects caused by noise and to extract explainable geometric properties to characterize finite metric spaces. We conducted lab experiments that integrated the use of eye-tracking, electrodermal activity (EDA), and user logs to explore users' information-seeking behaviors on search engine result pages (SERPs). Experimental results of 1,590 search queries showed that the proposed strategies effectively predicted query-level user satisfaction using EDA and eye-tracking data. The bootstrap analysis showed that combining EDA and eye-tracking data with user behavior data extracted from user logs led to a significantly better linear model fit than using user behavior data alone. Furthermore, cross-user and cross-task validations showed that our methods can be generalized to different search engine users performing different preassigned tasks.

0.01293251 = product of:
  0.05173004 = sum of:
    0.05173004 = weight(_text_:data in 607) [ClassicSimilarity], result of:
      0.05173004 = score(doc=607,freq=8.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.34936053 = fieldWeight in 607, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0390625 = fieldNorm(doc=607)
  0.25 = coord(1/4)

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.

Theme

Data Mining

0.011199882 = product of:
  0.04479953 = sum of:
    0.04479953 = weight(_text_:data in 606) [ClassicSimilarity], result of:
      0.04479953 = score(doc=606,freq=6.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.30255508 = fieldWeight in 606, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0390625 = fieldNorm(doc=606)
  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.

Theme

Data Mining

0.0103460075 = product of:
  0.04138403 = sum of:
    0.04138403 = weight(_text_:data in 1197) [ClassicSimilarity], result of:
      0.04138403 = score(doc=1197,freq=2.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.2794884 = fieldWeight in 1197, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0625 = fieldNorm(doc=1197)
  0.25 = coord(1/4)

Abstract

Using citation data of articles written by some Nobel Prize winners in physics, we show that concave, convex, and straight curves represent different types of interactions between old ideas and new insights. These cases illustrate different diffusion characteristics of academic knowledge, depending on the nature of the knowledge in the new publications. This work adds to the study of the development of science and links this development to citation analysis.

0.0077595054 = product of:
  0.031038022 = sum of:
    0.031038022 = weight(_text_:data in 297) [ClassicSimilarity], result of:
      0.031038022 = score(doc=297,freq=2.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.2096163 = fieldWeight in 297, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046875 = fieldNorm(doc=297)
  0.25 = coord(1/4)

Abstract

Purpose - This paper aims to introduce a general framework for the analysis of knowledge integration and diffusion using bibliometric data. Design/methodology/approach - The authors propose that in order to characterise knowledge integration and diffusion of a given issue (the source, for example articles on a topic or by an organisation, etc.), one has to choose a set of elements from the source (the intermediary set, for example references, keywords, etc.). This set can then be classified into categories (cats), thus making it possible to investigate its diversity. The set can also be characterised according to the coherence of a network associated to it. Findings - This framework allows a methodology to be developed to assess knowledge integration and diffusion. Such methodologies can be useful for a number of science policy issues, including the assessment of interdisciplinarity in research and dynamics of research networks. Originality/value - The main contribution of this article is to provide a simple and easy to use generalisation of an existing approach to study interdisciplinarity, bringing knowledge integration and knowledge diffusion together in one framework.

0.0077595054 = product of:
  0.031038022 = sum of:
    0.031038022 = weight(_text_:data in 4114) [ClassicSimilarity], result of:
      0.031038022 = score(doc=4114,freq=2.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.2096163 = fieldWeight in 4114, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046875 = fieldNorm(doc=4114)
  0.25 = coord(1/4)

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.006466255 = product of:
  0.02586502 = sum of:
    0.02586502 = weight(_text_:data in 1672) [ClassicSimilarity], result of:
      0.02586502 = score(doc=1672,freq=2.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.17468026 = fieldWeight in 1672, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1620505 = idf(docFreq=5088, 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.006466255 = product of:
  0.02586502 = sum of:
    0.02586502 = weight(_text_:data in 98) [ClassicSimilarity], result of:
      0.02586502 = score(doc=98,freq=2.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.17468026 = fieldWeight in 98, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0390625 = fieldNorm(doc=98)
  0.25 = coord(1/4)

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.006466255 = product of:
  0.02586502 = sum of:
    0.02586502 = weight(_text_:data in 603) [ClassicSimilarity], result of:
      0.02586502 = score(doc=603,freq=2.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.17468026 = fieldWeight in 603, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0390625 = fieldNorm(doc=603)
  0.25 = coord(1/4)

Abstract

Purpose Serendipitous information discovery has become a unique and important approach to discovering and obtaining information, which has aroused a growing interest for serendipity in human information behavior. Despite numerous publications, few have systematically provided an overview of current state of serendipity research. Consequently, researchers and practitioners are less able to make effective use of existing achievements, which limits them from making advancements in this domain. Against this backdrop, we performed a systematic literature review to explore the world of serendipity and to recapitulate the current states of different research topics. Design/methodology/approach Guided by a prior designed review protocol, this paper conducted both automatic and manual search for available studies published from January 1990 to December 2020 on seven databases. A total of 207 serendipity studies closely related to human information behavior form the literature pool. Findings We provide an overview of distinct aspects of serendipity, that is research topics, potential benefits, related concepts, theoretical models, contextual factors and data collection methods. Based on these findings, this review reveals limitations and gaps in the current serendipity research and proposes an agenda for future research directions. Originality/value By analyzing current serendipity research, developing a knowledge framework and providing a research agenda, this review is of significance for researchers who want to find new research questions or re-align current work, for beginners who need to quickly understand serendipity, and for practitioners who seek to cultivate serendipity in information environments.

0.0059951874 = product of:
  0.02398075 = sum of:
    0.02398075 = product of:
      0.0479615 = sum of:
        0.0479615 = weight(_text_:processing in 4239) [ClassicSimilarity], result of:
          0.0479615 = score(doc=4239,freq=4.0), product of:
            0.18956426 = queryWeight, product of:
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.046827413 = queryNorm
            0.2530092 = fieldWeight in 4239, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.03125 = fieldNorm(doc=4239)
      0.5 = coord(1/2)
  0.25 = coord(1/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