1,720,955 research outputs found
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
koamabayili/VECTRON-author-checklist: VECTRON author checklist
No full textWe have done our best to complete the author checklist relating to the use of animals in the hut study. Note that the objective for the hut study was to evaluate the IRS treatment applications for residual efficacy against Anopheles mosquitoes, including the local An. coluzzii mosquito population. Cows were only used to attract mosquitoes into the huts and no tests were carried out directly on the cows. The author checklist is intended for use with studies where experiments are carried out on animals, which is why we have had such difficulty in completing this for the hut study, as many of the questions do not relate to how the cows were used
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
Recommended from our members
Robust Approximation of the Stochastic Koopman Operator
Full text linkWe analyze the performance of DMD-based approximations of the stochastic Koopman operator for random dynamical systems where either the dynamics or observables are affected by noise. Under certain ergodicity assumptions, we show that standard DMD algorithms converge provided the observables do not contain any noise and span an invariant subspace of the stochastic Koopman operator. For observables with noise, we introduce a new, robust DMD algorithm that can approximate the stochastic Koopman operator and demonstrate how this algorithm can be applied to Krylov subspace based methods using a single observable measured over a single trajectory. We test the performance of the algorithms over several examples
Recommended from our members
Koopman Operators and System Identification for Stochastic Systems
Full text linkThe use of the Koopman operator framework in dynamical systems has greatly expanded in recent years. Instead of considering the evolution of the state of a system, the Koopman semigroup tracks the evolution of observables on the state. Since the Koopman operator defined for an arbitrary dynamical system is linear, it allows us to use linear system theory and spectral methods to analyze nonlinear systems. This framework has also been extended to stochastic systems. Since the evolution of observables can only be defined probabilistically for random systems, stochastic Koopman operators are defined by taking the expectation of the future value of observables.In the first part of this thesis, we review the basic theory of random dynamical systems and stochastic Koopman operators. We can use these operators to represent a nonlinear RDS as an infinite dimensional linear operator. The basic theorems and definitions are given in this section, which will help form the foundation for the algorithms discussed in the second and third sections. Further, some simple examples are given for which the stochastic Koopman operator is well understood. These examples will recur as we use them to test the algorithms in the second section.The second section is devoted to the analysis of Dynamic Mode Decomposition (DMD) algorithms. DMD algorithms approximate a finite section of the (stochastic) Koopman operator using data from a trajectory. However, these methods are sensitive to noise, and will give a biased approximation if the observables contains randomness. To combat this, we introduce an new DMD variant which can approximate a finite section of the stochastic Koopman operator even when the data contains measurement noise. Further, we extend this algorithm for use with time delayed observables to create a variant of Hankel DMD which will converge for stochastic systems. We then demonstrate these algorithms on numerical examples.In the final section, we will discuss the Sparse Identification of Nonlinear Dynamics (SINDy) algorithm for stochastic differential equations. The SINDy algorithm allows one to generate a representation of an ODE using a dictionary of functions and data from a trajectory. This algorithm has been extended to SDEs, but the accuracy is limited by the numerical approximations of the drift and diffusion functions. We demonstrate how we can use higher order approximations to these functions to generate a far more accurate representation of the SDE. We then test these approximations on several examples
- …
