Topic
Weighting
About: Weighting is a research topic. Over the lifetime, 17677 publications have been published within this topic receiving 370065 citations.
Papers published on a yearly basis
Papers
More filters
[...]
TL;DR: This paper summarizes the insights gained in automatic term weighting, and provides baseline single term indexing models with which other more elaborate content analysis procedures can be compared.
Abstract: The experimental evidence accumulated over the past 20 years indicates that textindexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend crucially on the choice of effective term weighting systems. This paper summarizes the insights gained in automatic term weighting, and provides baseline single term indexing models with which other more elaborate content analysis procedures can be compared.
8,862 citations
[...]
TL;DR: Using these results, data-dependent automatic bandwidth/lag truncation parameters are introduced and asymptotically optimal kernel/weighting scheme and bandwidth/agreement parameters are obtained.
Abstract: This paper is concerned with the estimation of covariance matrices in the presence of heteroskedasticity and autocorrelation of unknown forms. Currently available estimators that are designed for this context depend upon the choice of a lag truncation parameter and a weighting scheme. Results in the literature provide a condition on the growth rate of the lag truncation parameter as T \rightarrow \infty that is sufficient for consistency. No results are available, however, regarding the choice of lag truncation parameter for a fixed sample size, regarding data-dependent automatic lag truncation parameters, or regarding the choice of weighting scheme. In consequence, available estimators are not entirely operational and the relative merits of the estimators are unknown. This paper addresses these problems. The asymptotic truncated mean squared errors of estimators in a given class are determined and compared. Asymptotically optimal kernel/weighting scheme and bandwidth/lag truncation parameters are obtained using an asymptotic truncated mean squared error criterion. Using these results, data-dependent automatic bandwidth/lag truncation parameters are introduced. The finite sample properties of the estimators are analyzed via Monte Carlo simulation.
3,970 citations
[...]
TL;DR: MOLREP is an automated program for molecular replacement that utilizes a number of original approaches to rotational and translational search and data preparation that includes weighting of the X-ray data and search models, multi-copy search, fitting the model into electron density, structural superposition of two models and rigid-body refinement.
Abstract: MOLREP is an automated program for molecular replacement that utilizes a number of original approaches to rotational and translational search and data preparation. Since the first publication describing the program, MOLREP has acquired a variety of features that include weighting of the X-ray data and search models, multi-copy search, fitting the model into electron density, structural superposition of two models and rigid-body refinement. The program can run in a fully automatic mode using optimized parameters calculated from the input data.
2,701 citations
Posted Content•
[...]
TL;DR: A nonparametric method for automatically selecting the number of autocovariances to use in computing a heteroskedasticity and autocorrelation consistent covariance matrix is proposed and proved to be asymptotically equivalent to one that is optimal under a mean squared error loss function.
Abstract: We propose a nonparametric method for automatically selecting the number of autocovariances to use in computing a heteroskedasticity and autocorrelation consistent covariance matrix. For a given kernel for weighting the autocovariances, we prove that our procedure is asymptotically equivalent to one that is optimal under a mean squared error loss function. Monte Carlo simulations suggest that our procedure performs tolerably well, although it does result in size distortions.
2,628 citations
[...]
TL;DR: In this paper, Factoring and weighting approaches to status scores and clique identification were proposed, and the results showed that the weighting approach is more accurate than the factoring approach.
Abstract: (1972). Factoring and weighting approaches to status scores and clique identification. The Journal of Mathematical Sociology: Vol. 2, No. 1, pp. 113-120.
2,348 citations