1,720,972 research outputs found
Optimal Rates for Regularized Least-Squares Algorithm
We develop a theoretical analysis of the generalization perfor-mances of regularized least-squares algorithm on a reproducing kernel Hilbert space in the supervised learning setting. The presented results hold in the general framework of vector-valued functions, therefore they can be applied to multi-task problems. In particular we observe that the concept of e®ective dimension plays a central role in the de ̄nition of a criterion for the choice of the regularization parameter as a function of the number of samples. Moreover a complete minimax analysis of the problem is described, showing that the convergence rates obtained by regularized least-squares estimators are indeed optimal over a suitable class of priors de ̄ned by the considered kernel. Finallywe give an improved lower rate result describing worst asymptotic behavior on individual probability measures rather than over classes of priors
Discretization error analysis for Tikhonov regularization
We study the discretization of inverse problems defined by a Carleman operator. In particular, we develop a discretization strategy for this class of inverse problems and we give a convergence analysis. Learning from examples, as well as the discretization of integral equations, can be analyzed in our settin
Discretization Error Analysis for Tikhonov Regularization in Learning Theory
We study the discretization of inverse problems defined by a Carleman operator. In particular we develop a discretization strategy for this class of inverse problems and we give a convergence analysis. Learning from examples as well as the discretization of integral equations can be analysed in our setting
Going Beyond Counting First Authors in Author Co-citation Analysis
The 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
“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
Entropy conditions for L r -convergence of empirical processes
The law of large numbers (LLN) over classes of functions is a classical topic of empirical processes theory. The properties characterizing classes of functions on which the LLN holds uniformly (i.e. Glivenko–Cantelli classes) have been widely studied in the literature. An elegant suffi cient condition for such a property is finiteness of the Koltchinskii–Pollard entropy integral, and other conditions have been formulated in terms of suitable combinatorial complexities (e.g. the Vapnik– Chervonenkis dimension). In this paper, we endow the class of functions F with a probability measure and consider the LLN relative to the associated Lr metric. This framework extends the case of uniform convergence over F , which is recovered when r goes to infinity. The main result is a Lr -LLN in terms of a suitable uniform entropy integral which generalizes the Koltchinskii–Pollard entropy integra
Appropriate Similarity Measures for Author Cocitation Analysis
We 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
We 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
- …
