Search (935 results, page 1 of 47)

0.11265344 = product of:
  0.22530688 = sum of:
    0.22530688 = sum of:
      0.17650086 = weight(_text_:network in 2599) [ClassicSimilarity], result of:
        0.17650086 = score(doc=2599,freq=10.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.77015346 = fieldWeight in 2599, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2599)
      0.048806023 = weight(_text_:22 in 2599) [ClassicSimilarity], result of:
        0.048806023 = score(doc=2599,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.2708308 = fieldWeight in 2599, 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=2599)
  0.5 = coord(1/2)

Abstract

The US cataloging community is an interorganizational network with the Library of Congress (LC) as the lead organization, which reserves to itself the power to shape cataloging rules. Peripheral members of the network who are interested in modifying changes to the rules or to the network can use various strategies for organizational change that incorporate building ties to the decision-makers located at the hub of the network. The story of William E. Studwell's campaign for a subject heading code illustrates how some traditional scholarly methods of urging change-papers and presentations-are insufficient to achieve reform in an interorganizational network, absent strategies to build alliances with the decision makers.

Date

10. 9.2000 17:38:22

0.10377986 = product of:
  0.20755972 = sum of:
    0.20755972 = sum of:
      0.16572599 = weight(_text_:network in 2639) [ClassicSimilarity], result of:
        0.16572599 = score(doc=2639,freq=12.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.72313786 = fieldWeight in 2639, product of:
            3.4641016 = tf(freq=12.0), with freq of:
              12.0 = termFreq=12.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=2639)
      0.041833732 = weight(_text_:22 in 2639) [ClassicSimilarity], result of:
        0.041833732 = score(doc=2639,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 2639, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=2639)
  0.5 = coord(1/2)

Abstract

Online communities are becoming an important tool in the communication and participation processes in our society. However, the most widespread applications are difficult to use for people with disabilities, or may involve some risks if no previous training has been undertaken. This work describes a novel social network for cognitively disabled people along with a clustering-based method for modeling activity and socialization processes of its users in a noninvasive way. This closed social network is specifically designed for people with cognitive disabilities, called Guremintza, that provides the network administrators (e.g., social workers) with two types of reports: summary statistics of the network usage and behavior patterns discovered by a data mining process. Experiments made in an initial stage of the network show that the discovered patterns are meaningful to the social workers and they find them useful in monitoring the progress of the users.

Date

22. 1.2016 12:02:26

0.08648322 = product of:
  0.17296644 = sum of:
    0.17296644 = sum of:
      0.13810499 = weight(_text_:network in 4189) [ClassicSimilarity], result of:
        0.13810499 = score(doc=4189,freq=12.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.6026149 = fieldWeight in 4189, product of:
            3.4641016 = tf(freq=12.0), with freq of:
              12.0 = termFreq=12.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=4189)
      0.034861445 = weight(_text_:22 in 4189) [ClassicSimilarity], result of:
        0.034861445 = score(doc=4189,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 4189, 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=4189)
  0.5 = coord(1/2)

Abstract

Effective patent management is essential for organizations to maintain their competitive advantage. The classification of patents is a critical part of patent management and industrial analysis. This study proposes a hybrid-patent-classification approach that combines a novel patent-network-based classification method with three conventional classification methods to analyze query patents and predict their classes. The novel patent network contains various types of nodes that represent different features extracted from patent documents. The nodes are connected based on the relationship metrics derived from the patent metadata. The proposed classification method predicts a query patent's class by analyzing all reachable nodes in the patent network and calculating their relevance to the query patent. It then classifies the query patent with a modified k-nearest neighbor classifier. To further improve the approach, we combine it with content-based, citation-based, and metadata-based classification methods to develop a hybrid-classification approach. We evaluate the performance of the hybrid approach on a test dataset of patent documents obtained from the U.S. Patent and Trademark Office, and compare its performance with that of the three conventional methods. The results demonstrate that the proposed patent-network-based approach yields more accurate class predictions than the patent network-based approach.

Date

22. 1.2011 13:04:21

0.081734106 = product of:
  0.16346821 = sum of:
    0.16346821 = product of:
      0.49040464 = sum of:
        0.49040464 = weight(_text_:3a in 973) [ClassicSimilarity], result of:
          0.49040464 = score(doc=973,freq=2.0), product of:
            0.43628904 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.05146125 = queryNorm
            1.1240361 = fieldWeight in 973, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.09375 = fieldNorm(doc=973)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)

Content

Vgl.: http%3A%2F%2Fcreativechoice.org%2Fdoc%2FHansJonas.pdf&usg=AOvVaw1TM3teaYKgABL5H9yoIifA&opi=89978449.

0.08046674 = product of:
  0.16093348 = sum of:
    0.16093348 = sum of:
      0.12607203 = weight(_text_:network in 57) [ClassicSimilarity], result of:
        0.12607203 = score(doc=57,freq=10.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.5501096 = fieldWeight in 57, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=57)
      0.034861445 = weight(_text_:22 in 57) [ClassicSimilarity], result of:
        0.034861445 = score(doc=57,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 57, 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=57)
  0.5 = coord(1/2)

Abstract

Webometric network analyses have been used to map the connectivity of groups of websites to identify clusters, important sites or overall structure. Such analyses have mainly been based upon hyperlink counts, the number of hyperlinks between a pair of websites, although some have used title mentions or URL citations instead. The ability to automatically gather hyperlink counts from Yahoo! ceased in April 2011 and the ability to manually gather such counts was due to cease by early 2012, creating a need for alternatives. This article assesses URL citations and title mentions as possible replacements for hyperlinks in both binary and weighted direct link and co-inlink network diagrams. It also assesses three different types of data for the network connections: hit count estimates, counts of matching URLs, and filtered counts of matching URLs. Results from analyses of U.S. library and information science departments and U.K. universities give evidence that metrics based upon URLs or titles can be appropriate replacements for metrics based upon hyperlinks for both binary and weighted networks, although filtered counts of matching URLs are necessary to give the best results for co-title mention and co-URL citation network diagrams.

Date

6. 4.2012 18:16:22

0.08021748 = product of:
  0.16043496 = sum of:
    0.16043496 = sum of:
      0.11162894 = weight(_text_:network in 1452) [ClassicSimilarity], result of:
        0.11162894 = score(doc=1452,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.48708782 = fieldWeight in 1452, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1452)
      0.048806023 = weight(_text_:22 in 1452) [ClassicSimilarity], result of:
        0.048806023 = score(doc=1452,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.2708308 = fieldWeight in 1452, 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=1452)
  0.5 = coord(1/2)

Abstract

The paper addresses knowledge promotion and the importance of acquiring the proper, reliable and up-to-date knowledge and information to help specialists in their research and practical work. Foreign data could be very important and international cooperation should be broadly developed. The example of broad international cooperation in promoting OSH knowledge is described and in it - the world network of 150 OSH institutions in 110 countries (CIS network), with a focal point of Polish contribution.

Source

Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik

0.07381185 = product of:
  0.1476237 = sum of:
    0.1476237 = sum of:
      0.11276226 = weight(_text_:network in 664) [ClassicSimilarity], result of:
        0.11276226 = score(doc=664,freq=8.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.492033 = fieldWeight in 664, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=664)
      0.034861445 = weight(_text_:22 in 664) [ClassicSimilarity], result of:
        0.034861445 = score(doc=664,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 664, 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=664)
  0.5 = coord(1/2)

Abstract

A new challenge, accessing multiple relevant entities, arises from the availability of linked heterogeneous data. In this article, we address more specifically the problem of accessing relevant entities, such as publications and authors within a bibliographic network, given an information need. We propose a novel algorithm, called BibRank, that estimates a joint relevance of documents and authors within a bibliographic network. This model ranks each type of entity using a score propagation algorithm with respect to the query topic and the structure of the underlying bi-type information entity network. Evidence sources, namely content-based and network-based scores, are both used to estimate the topical similarity between connected entities. For this purpose, authorship relationships are analyzed through a language model-based score on the one hand and on the other hand, non topically related entities of the same type are detected through marginal citations. The article reports the results of experiments using the Bibrank algorithm for an information retrieval task. The CiteSeerX bibliographic data set forms the basis for the topical query automatic generation and evaluation. We show that a statistically significant improvement over closely related ranking models is achieved.

Date

22. 3.2013 19:34:49

0.07381185 = product of:
  0.1476237 = sum of:
    0.1476237 = sum of:
      0.11276226 = weight(_text_:network in 1365) [ClassicSimilarity], result of:
        0.11276226 = score(doc=1365,freq=8.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.492033 = fieldWeight in 1365, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1365)
      0.034861445 = weight(_text_:22 in 1365) [ClassicSimilarity], result of:
        0.034861445 = score(doc=1365,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 1365, 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=1365)
  0.5 = coord(1/2)

Abstract

The paper aims to present the relations of network theory and terminology. The model of scale-free networks, which has been recently developed and widely applied since, can be effectively used in terminology research as well. Operation based on the principle of networks is a universal characteristic of complex systems. Networks are governed by general laws. The model of scale-free networks can be viewed as a statistical-probability model, and it can be described with mathematical tools. Its main feature is that "everything is connected to everything else," that is, every node is reachable (in a few steps) starting from any other node; this phenomena is called "the small world phenomenon." The existence of a linguistic network and the general laws of the operation of networks enable us to place issues of language use in the complex system of relations that reveal the deeper connection s between phenomena with the help of networks embedded in each other. The realization of the metaphor that language also has a network structure is the basis of the classification methods of the terminological system, and likewise of the ways of creating terminology databases, which serve the purpose of providing easy and versatile accessibility to specialised knowledge.

Date

2. 9.2014 21:22:48

0.06811176 = product of:
  0.13622352 = sum of:
    0.13622352 = product of:
      0.40867054 = sum of:
        0.40867054 = weight(_text_:3a in 1826) [ClassicSimilarity], result of:
          0.40867054 = score(doc=1826,freq=2.0), product of:
            0.43628904 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.05146125 = queryNorm
            0.93669677 = fieldWeight in 1826, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.078125 = fieldNorm(doc=1826)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)

Source

http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=5&ved=0CDQQFjAE&url=http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F3131107&ei=HzFWVYvGMsiNsgGTyoFI&usg=AFQjCNE2FHUeR9oQTQlNC4TPedv4Mo3DaQ&sig2=Rlzpr7a3BLZZkqZCXXN_IA&bvm=bv.93564037,d.bGg&cad=rja

0.06625821 = product of:
  0.13251641 = sum of:
    0.13251641 = sum of:
      0.097654976 = weight(_text_:network in 4191) [ClassicSimilarity], result of:
        0.097654976 = score(doc=4191,freq=6.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.42611307 = fieldWeight in 4191, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=4191)
      0.034861445 = weight(_text_:22 in 4191) [ClassicSimilarity], result of:
        0.034861445 = score(doc=4191,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 4191, 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=4191)
  0.5 = coord(1/2)

Abstract

The production of scientific knowledge has evolved from a process of inquiry largely based on the activities of individual scientists to one grounded in the collaborative efforts of specialized research teams. This shift brings to light a new question: how the composition of scientific teams affects their production of knowledge. This study employs data from 1,415 experiments conducted at the National High Magnetic Field Laboratory (NHMFL) between 2005 and 2008 to identify and select a sample of 89 teams and examine whether team diversity and network characteristics affect productivity. The study examines how the diversity of science teams along several variables affects overall team productivity. Results indicate several diversity measures associated with network position and team productivity. Teams with mixed institutional associations were more central to the overall network compared with teams that primarily comprised NHMFL's own scientists. Team cohesion was positively related to productivity. The study indicates that high productivity in teams is associated with high disciplinary diversity and low seniority diversity of team membership. Finally, an increase in the share of senior members negatively affects productivity, and teams with members in central structural positions perform better than other teams.

Date

22. 1.2011 13:19:42

0.06625821 = product of:
  0.13251641 = sum of:
    0.13251641 = sum of:
      0.097654976 = weight(_text_:network in 2649) [ClassicSimilarity], result of:
        0.097654976 = score(doc=2649,freq=6.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.42611307 = fieldWeight in 2649, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2649)
      0.034861445 = weight(_text_:22 in 2649) [ClassicSimilarity], result of:
        0.034861445 = score(doc=2649,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 2649, 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=2649)
  0.5 = coord(1/2)

Abstract

Main path analysis is a powerful tool for extracting the backbones of a directed network and has been applied widely in bibliometric studies. In contrast to the no-decay assumption in the traditional approach, this study proposes a novel technique by assuming that the strength of knowledge decays when knowledge contained in one document is passed on to another document down the citation chain. We propose three decay models, arithmetic decay, geometric decay, and harmonic decay, along with their theoretical properties. In general, results of the proposed decay models depend largely on the local structure of a citation network as opposed to the global structure in the traditional approach. Thus, the significance of citation links and the associated documents that are overemphasized by the global structure in the traditional no-decay approach is treated more properly. For example, the traditional approach commonly assigns high value to documents that heavily reference others, such as review articles. Specifically in the geometric and harmonic decay models, only truly significant review articles will be included in the resulting main paths. We demonstrate this new approach and its properties through the DNA literature citation network.

Date

22. 1.2016 14:23:00

0.06451824 = product of:
  0.12903649 = sum of:
    0.12903649 = sum of:
      0.07973496 = weight(_text_:network in 1534) [ClassicSimilarity], result of:
        0.07973496 = score(doc=1534,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.34791988 = fieldWeight in 1534, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1534)
      0.049301527 = weight(_text_:22 in 1534) [ClassicSimilarity], result of:
        0.049301527 = score(doc=1534,freq=4.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.27358043 = fieldWeight in 1534, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1534)
  0.5 = coord(1/2)

Abstract

This paper uncovers patterns of knowledge dissemination among scientific disciplines. Although the transfer of knowledge is largely unobservable, citations from one discipline to another have been proven to be an effective proxy to study disciplinary knowledge flow. This study constructs a knowledge-flow network in which a node represents a Journal Citation Reports subject category and a link denotes the citations from one subject category to another. Using the concept of shortest path, several quantitative measurements are proposed and applied to a knowledge-flow network. Based on an examination of subject categories in Journal Citation Reports, this study indicates that social science domains tend to be more self-contained, so it is more difficult for knowledge from other domains to flow into them; at the same time, knowledge from science domains, such as biomedicine-, chemistry-, and physics-related domains, can access and be accessed by other domains more easily. This study also shows that social science domains are more disunified than science domains, because three fifths of the knowledge paths from one social science domain to another require at least one science domain to serve as an intermediate. This work contributes to discussions on disciplinarity and interdisciplinarity by providing empirical analysis.

Date

26.10.2014 20:22:22

0.06451824 = product of:
  0.12903649 = sum of:
    0.12903649 = sum of:
      0.07973496 = weight(_text_:network in 1629) [ClassicSimilarity], result of:
        0.07973496 = score(doc=1629,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.34791988 = fieldWeight in 1629, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1629)
      0.049301527 = weight(_text_:22 in 1629) [ClassicSimilarity], result of:
        0.049301527 = score(doc=1629,freq=4.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.27358043 = fieldWeight in 1629, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1629)
  0.5 = coord(1/2)

Abstract

Purpose - In today's knowledge-based economy, knowledge networks (KN) increasingly are becoming vital channels for pursuing strategic objectives in project-based organizations (PBO), in which the project is the basic organizational element in its operation. KN initiatives often are started with the selection of a creation methodology, which involves complex decisions for successful implementation. Thus, the purpose of this paper is to address this critical selection of methodology and proposes a holistic framework for selecting an appropriate methodology in this kind of flatter, speedier, and more flexible organizational form. Design/methodology/approach - In the first step, the study established a theoretical background addressing the problem of KN creation in PBO. The second step defined selection criteria based on extensive literature review. In the third step, a holistic framework was constructed based on different characteristics of existing methodologies categorized according to the selected criteria. Finally, the suggested framework was empirically tested in a project-based firm and the case study and the results are discussed. Findings - A holistic framework was determined by including different aspects of a KN such as network perspectives, tools and techniques, objectives, characteristics, capabilities, and approaches. The proposed framework consisted of ten existing KN methodologies that consider qualitative and quantitative dimensions with micro and macro approaches. Originality/value - The development of the theory of KN creation methodology is the main contribution of this research. The selection framework, which was theoretically and empirically grounded, has attempted to offer a more rational and less ambiguous solution to the KN methodology selection problem in PBO forms.

Date

20. 1.2015 18:30:22
18. 9.2018 16:27:22

0.0638698 = product of:
  0.1277396 = sum of:
    0.1277396 = sum of:
      0.078933574 = weight(_text_:network in 1419) [ClassicSimilarity], result of:
        0.078933574 = score(doc=1419,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.3444231 = fieldWeight in 1419, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1419)
      0.048806023 = weight(_text_:22 in 1419) [ClassicSimilarity], result of:
        0.048806023 = score(doc=1419,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.2708308 = fieldWeight in 1419, 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=1419)
  0.5 = coord(1/2)

Abstract

Because procedures for establishing facets tend toward subjectivity, this pilot project investigates whether the facet structure of a subject literature can be discerned automatically on the basis of its own metadata. Nouns found in the titles of works retrieved from the WorldCat bibliographic database based on Dewey number are mapped against the nodes of the WordNet noun network. Density measures are computed for these nodes to identify nodes best summarizing the title noun data / best corresponding to facets of the subject. Results of the work to date are promising enough to warrant further investigation.

Source

Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik

0.0634096 = product of:
  0.1268192 = sum of:
    0.1268192 = sum of:
      0.06765735 = weight(_text_:network in 3355) [ClassicSimilarity], result of:
        0.06765735 = score(doc=3355,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.29521978 = fieldWeight in 3355, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=3355)
      0.05916184 = weight(_text_:22 in 3355) [ClassicSimilarity], result of:
        0.05916184 = score(doc=3355,freq=4.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.32829654 = fieldWeight in 3355, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=3355)
  0.5 = coord(1/2)

Content

One of a series of three publications influenced by the travelling exhibit Places & Spaces: Mapping Science, curated by the Cyberinfrastructure for Network Science Center at Indiana University. - Additional materials can be found at http://http://scimaps.org/atlas2. Erweitert durch: Börner, Katy. Atlas of Science: Visualizing What We Know.

Date

22. 1.2017 16:54:03
22. 1.2017 17:10:56

0.057298202 = product of:
  0.114596404 = sum of:
    0.114596404 = sum of:
      0.07973496 = weight(_text_:network in 743) [ClassicSimilarity], result of:
        0.07973496 = score(doc=743,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.34791988 = fieldWeight in 743, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=743)
      0.034861445 = weight(_text_:22 in 743) [ClassicSimilarity], result of:
        0.034861445 = score(doc=743,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 743, 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=743)
  0.5 = coord(1/2)

Abstract

We perform session analysis for our domain of people search within a professional social network. We find that the content-based method is appropriate to serve as a basis for the session identification in our domain. However, there remain some problems reported in previous research which degrade the identification performance (such as accuracy) of the content-based method. Therefore, in this article, we propose two important refinements to address these problems. We describe the underlying rationale of our refinements and then empirically show that the content-based method equipped with our refinements is able to achieve an excellent identification performance in our domain (such as 99.820% accuracy and 99.707% F-measure in our experiments). Next, because the time-based method has extremely low computation costs, which makes it suitable for many real-world applications, we investigate the feasibility of the time-based method in our domain by evaluating its identification performance based on our refined content-based method. Our experiments demonstrate that the performance of the time-based method is potentially acceptable to many real applications in our domain. Finally, we analyze several features of the identified sessions in our domain and compare them with the corresponding ones in general web search. The results illustrate the profession-oriented characteristics of our domain.

Date

19. 4.2013 20:31:22

0.057298202 = product of:
  0.114596404 = sum of:
    0.114596404 = sum of:
      0.07973496 = weight(_text_:network in 2593) [ClassicSimilarity], result of:
        0.07973496 = score(doc=2593,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.34791988 = fieldWeight in 2593, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2593)
      0.034861445 = weight(_text_:22 in 2593) [ClassicSimilarity], result of:
        0.034861445 = score(doc=2593,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 2593, 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=2593)
  0.5 = coord(1/2)

Abstract

Purpose The four major Subject Repositories (SRs), arXiv, Research Papers in Economics (RePEc), Social Science Research Network (SSRN) and PubMed Central (PMC), are all important within their disciplines but no previous study has systematically compared how often they are cited in academic publications. In response, the purpose of this paper is to report an analysis of citations to SRs from Scopus publications, 2000-2013. Design/methodology/approach Scopus searches were used to count the number of documents citing the four SRs in each year. A random sample of 384 documents citing the four SRs was then visited to investigate the nature of the citations. Findings Each SR was most cited within its own subject area but attracted substantial citations from other subject areas, suggesting that they are open to interdisciplinary uses. The proportion of documents citing each SR is continuing to increase rapidly, and the SRs all seem to attract substantial numbers of citations from more than one discipline. Research limitations/implications Scopus does not cover all publications, and most citations to documents found in the four SRs presumably cite the published version, when one exists, rather than the repository version. Practical implications SRs are continuing to grow and do not seem to be threatened by institutional repositories and so research managers should encourage their continued use within their core disciplines, including for research that aims at an audience in other disciplines. Originality/value This is the first simultaneous analysis of Scopus citations to the four most popular SRs.

Date

20. 1.2015 18:30:22

Object

Social Science Research Network

0.05474554 = product of:
  0.10949108 = sum of:
    0.10949108 = sum of:
      0.06765735 = weight(_text_:network in 654) [ClassicSimilarity], result of:
        0.06765735 = score(doc=654,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.29521978 = fieldWeight in 654, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=654)
      0.041833732 = weight(_text_:22 in 654) [ClassicSimilarity], result of:
        0.041833732 = score(doc=654,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 654, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=654)
  0.5 = coord(1/2)

Abstract

This paper explores the possible citation chain reactions of a Nobel Prize using the mathematician Robert J. Aumann as a case example. The results show that the award of the Nobel Prize in 2005 affected not only the citations to his work, but also affected the citations to the references in his scientific oeuvre. The results indicate that the spillover effect is almost as powerful as the effect itself. We are consequently able to document a ripple effect in which the awarding of the Nobel Prize ignites a citation chain reaction to Aumann's scientific oeuvre and to the references in its nearest citation network. The effect is discussed using innovation decision process theory as a point of departure to identify the factors that created a bandwagon effect leading to the reported observations.

Date

22. 3.2013 16:21:09

0.05474554 = product of:
  0.10949108 = sum of:
    0.10949108 = sum of:
      0.06765735 = weight(_text_:network in 1420) [ClassicSimilarity], result of:
        0.06765735 = score(doc=1420,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.29521978 = fieldWeight in 1420, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=1420)
      0.041833732 = weight(_text_:22 in 1420) [ClassicSimilarity], result of:
        0.041833732 = score(doc=1420,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 1420, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=1420)
  0.5 = coord(1/2)

Abstract

There is greater depth in knowledge organization systems beyond the surface of hierarchically-structured concepts. Deconstructed elements of a knowledge organization system share network-like relationships that might be used in interaction with the characteristics of documents to provide "classification interaction" as a means of identifying previously undiscovered relationships. A random sample of UDC call numbers from the online catalog of the Catholic University of Leuven (KU Leuven) is analyzed to discover interactions among conceptual classification, instantiation, and bibliographic demographic characteristics. The associations demonstrated represent ways in which predictable interactions occur among classified bibliographic entities and the components of the rich UDC classification.

Source

Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik

0.05474554 = product of:
  0.10949108 = sum of:
    0.10949108 = sum of:
      0.06765735 = weight(_text_:network in 2586) [ClassicSimilarity], result of:
        0.06765735 = score(doc=2586,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.29521978 = fieldWeight in 2586, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=2586)
      0.041833732 = weight(_text_:22 in 2586) [ClassicSimilarity], result of:
        0.041833732 = score(doc=2586,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 2586, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=2586)
  0.5 = coord(1/2)

Abstract

Purpose - The purpose of this paper is to attempt to provide a review of the growing literature on co-authorship networks and the research gaps that may be investigated for future studies in this field. Design/methodology/approach - The existing literature on co-authorship networks was identified, evaluated and interpreted. Narrative review style was followed. Findings - Co-authorship, a proxy of research collaboration, is a key mechanism that links different sets of talent to produce a research output. Co-authorship could also be seen from the perspective of social networks. An in-depth analysis of such knowledge networks provides an opportunity to investigate its structure. Patterns of these relationships could reveal, for example, the mechanism that shapes our scientific community. The study provides a review of the expanding literature on co-authorship networks. Originality/value - This is one of the first comprehensive reviews of network-based studies on co-authorship. The field is fast evolving, opening new gaps for potential research. The study identifies some of these gaps.

Date

20. 1.2015 18:30:22