Diese Datenbank enthält über 40.000 Dokumente zu Themen aus den Bereichen Formalerschließung – Inhaltserschließung – Information Retrieval.
© 2015 W. Gödert, TH Köln, Institut für Informationswissenschaft / Powered by litecat, BIS Oldenburg (Stand: 28. April 2022)
1Dominich, S. ; Kiezer, T.: ¬A measure theoretic approach to information retrieval.
In: Journal of the American Society for Information Science and Technology. 58(2007) no.8, S.1108-1122.
Abstract: The vector space model of information retrieval is one of the classical and widely applied retrieval models. Paradoxically, it has been characterized by a discrepancy between its formal framework and implementable form. The underlying concepts of the vector space model are mathematical terms: linear space, vector, and inner product. However, in the vector space model, the mathematical meaning of these concepts is not preserved. They are used as mere computational constructs or metaphors. Thus, the vector space model actually does not follow formally from the mathematical concepts on which it has been claimed to rest. This problem has been recognized for more than two decades, but no proper solution has emerged so far. The present article proposes a solution to this problem. First, the concept of retrieval is defined based on the mathematical measure theory. Then, retrieval is particularized using fuzzy set theory. As a result, the retrieval function is conceived as the cardinality of the intersection of two fuzzy sets. This view makes it possible to build a connection to linear spaces. It is shown that the classical and the generalized vector space models, as well as the latent semantic indexing model, gain a correct formal background with which they are consistent. At the same time it becomes clear that the inner product is not a necessary ingredient of the vector space model, and hence of Information Retrieval (IR). The Principle of Object Invariance is introduced to handle this situation. Moreover, this view makes it possible to consistently formulate new retrieval methods: in linear space with general basis, entropy-based, and probability-based. It is also shown that Information Retrieval may be viewed as integral calculus, and thus it gains a very compact and elegant mathematical way of writing. Also, Information Retrieval may thus be conceived as an application of mathematical measure theory.
2Dominich, S. ; Lalmas, M. ; Rijsbergen, C.J.K. van: Special issue on model design, formulation and explanation in information retrieval using mathematics.
In: Information processing and management. 42(2006) no.1, S.1-3.
Abstract: Guest Editorial
Anmerkung: Einführung in einen thematischen Schwerpunkt "Formal Methods for Information Retrieval"
3Dominich, S. ; Skrop, A.: PageRank and interaction information retrieval.
In: Journal of the American Society for Information Science and Technology. 56(2005) no.1, S.63-69.
Abstract: The PageRank method is used by the Google Web search engine to compute the importance of Web pages. Two different views have been developed for the Interpretation of the PageRank method and values: (a) stochastic (random surfer): the PageRank values can be conceived as the steady-state distribution of a Markov chain, and (b) algebraic: the PageRank values form the eigenvector corresponding to eigenvalue 1 of the Web link matrix. The Interaction Information Retrieval (1**2 R) method is a nonclassical information retrieval paradigm, which represents a connectionist approach based an dynamic systems. In the present paper, a different Interpretation of PageRank is proposed, namely, a dynamic systems viewpoint, by showing that the PageRank method can be formally interpreted as a particular case of the Interaction Information Retrieval method; and thus, the PageRank values may be interpreted as neutral equilibrium points of the Web.
Themenfeld: Suchmaschinen ; Retrievalalgorithmen
4Dominich, S. ; Góth, J. ; Kiezer, T. ; Szlávik, Z.: ¬An entropy-based interpretation of retrieval status value-based retrieval, and its application to the computation of term and query discrimination value.
In: Journal of the American Society for Information Science and technology. 55(2004) no.7, S.613-626.
Abstract: The concepts of Shannon information and entropy have been applied to a number of information retrieval tasks such as to formalize the probabilistic model, to design practical retrieval systems, to cluster documents, and to model texture in image retrieval. In this report, the concept of entropy is used for a different purpose. It is shown that any positive Retrieval Status Value (RSV)based retrieval system may be conceived as a special probability space in which the amount of the associated Shannon information is being reduced; in this view, the retrieval system is referred to as Uncertainty Decreasing Operation (UDO). The concept of UDO is then proposed as a theoretical background for term and query discrimination Power, and it is applied to the computation of term and query discrimination values in the vector space retrieval model. Experimental evidence is given as regards such computation; the results obtained compare weIl to those obtained using vector-based calculation of term discrimination values. The UDO-based computation, however, presents advantages over the vectorbased calculation: It is faster, easier to assess and handle in practice, and its application is not restricted to the vector space model. Based an the ADI test collection, it is shown that the UDO-based Term Discrimination Value (TDV) weighting scheme yields better retrieval effectiveness than using the vector-based TDV weighting scheme. Also, experimental evidence is given to the intuition that the choice of an appropriate weighting scheure and similarity measure depends an collection properties, and thus the UDO approach may be used as a theoretical basis for this intuition.
5Crestani, F. ; Dominich, S. ; Lalmas, M. ; Rijsbergen, C.J.K. van: Mathematical, logical, and formal methods in information retrieval : an introduction to the special issue.
In: Journal of the American Society for Information Science and technology. 54(2003) no.4, S.281-284.
Abstract: Research an the use of mathematical, logical, and formal methods, has been central to Information Retrieval research for a long time. Research in this area is important not only because it helps enhancing retrieval effectiveness, but also because it helps clarifying the underlying concepts of Information Retrieval. In this article we outline some of the major aspects of the subject, and summarize the papers of this special issue with respect to how they relate to these aspects. We conclude by highlighting some directions of future research, which are needed to better understand the formal characteristics of Information Retrieval.
Anmerkung: Einführung zu den Beiträgen eines Themenheftes: Mathematical, logical, and formal methods in information retrieval
6Dominich, S.: Mathematical foundations of information retrieval.
Dordrecht : Kluwer Academic, 2001. XX, 284 S.
(Mathematical modelling: theory and applications; 12)
Abstract: This book offers a comprehensive and consistent mathematical approach to information retrieval (IR) without which no implementation is possible, and sheds an entirely new light upon the structure of IR models. It contains the descriptions of all IR models in a unified formal style and language, along with examples for each, thus offering a comprehensive overview of them. The book also creates mathematical foundations and a consistent mathematical theory (including all mathematical results achieved so far) of IR as a stand-alone mathematical discipline, which thus can be read and taught independently. Also, the book contains all necessary mathematical knowledge on which IR relies, to help the reader avoid searching different sources. The book will be of interest to computer or information scientists, librarians, mathematicians, undergraduate students and researchers whose work involves information retrieval.
LCSH: Computer science / Mathematics ; Information storage and retrieval
RSWK: Online-Recherche / Mathematische Methode
BK: 06.35 Informationsmanagement ; 54.10 Theoretische Informatik
DDC: 004/.01/51 / dc21
GHBS: TVA (W) ; TLQ (W)
LCC: QA76.9.M35D66 2001
RVK: ST 270 ; ST 271
7Dominich, S.: ¬A unified mathematical definition of classical information retrieval.
In: Journal of the American Society for Information Science. 51(2000) no.7, S.614-624.
Abstract: A unified mathematical definition for the classical (vector and probabilistic) models of information retrieval is given. Also, a methematical structure (Diophantine set) behind relevance feedback is identified
8Dominich, S.: ¬The interaction-based information retrieval paradigm.
In: Encyclopedia of library and information science. Vol.59, [=Suppl.22]. New York : Dekker, 1997. S.218-236.
9Dominich, S.: Interaction information retrieval.
In: Journal of documentation. 50(1994) no.3, S.197-212.
Abstract: In existing information retrieval models there are three different ways documents are represented for retrieval purposes: vectors of weights, collections of sentences and artificial neurons. Accordingly, retrieval depends on a similarity function, or means an inference, or is a spreading of activation. Relevancy is considered to be a critical modelling parameter which is either a priori or it is not treated at all. Assuming that relevancy may equally be an emergent entity, thus not requiring any a priori modelling, the paper proposes the Interaction Informatzion Retrieval model in which documents are interconnected, queries and documents are treated in the same way, and in which retrieval is the result of the interconnection between query and documents. Algorithms and experiences gained with practical applications are presented. A theoretical mathematical formulation of this type of retrieval is also given