๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The simple scalability of documents

โœ Scribed by Rorvig, Mark E.


Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
916 KB
Volume
41
Category
Article
ISSN
0002-8231

No coin nor oath required. For personal study only.

โœฆ Synopsis


The relationship between scaling practice and scaling theory remains a controversial problem in Information Retrieval research and experimentation.

This article reports a test of a general theory of scaling, i.e., Simple Scalability, applied to the stimulus domain of documents represented as abstracts. The significance of Simple Scalability is that it implies three important properties of scales: transitivity, substitutibility, and independence. The test results indicate that, with some reservations, this theory of scaling is applicable to documents. This finding is further applied to the construction of test collections for Information Retrieval research that could more sensitively measure retrieval system alterations through the use of documents scaled not merely by relevance, but rather, by preference.


๐Ÿ“œ SIMILAR VOLUMES


The scalability of photonic switches
โœ Gerd Blau; Kurt Loesch ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 194 KB
Scalability Properties of the S-Distribu
โœ Eberhard O. Voit; Lorelei H. Schwacke ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 177 KB ๐Ÿ‘ 2 views
On the scalability of PSRS algorithm
โœ Nai-jie Gu; Guo-Iiang Chen ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Wuhan University ๐ŸŒ English โš– 286 KB
Scalability of the Bayesian optimization
โœ Martin Pelikan; Kumara Sastry; David E. Goldberg ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 547 KB

To solve a wide range of different problems, the research in black-box optimization faces several important challenges. One of the most important challenges is the design of methods capable of automatic discovery and exploitation of problem regularities to ensure efficient and reliable search for th

On the Scalability of Asynchronous Paral
โœ D.C. Marinescu; J.R. Rice ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 753 KB

This paper investigates the time lost in a parallel computation due to sequential and duplicated work, communication, and blocking, and proposes characterizations of parallel algorithms based upon the communication complexity and the blocking model. It discusses the impact of the processor's archite