By Sándor Dominich
ISBN-10: 3540776583
ISBN-13: 9783540776581
ISBN-10: 3540776591
ISBN-13: 9783540776598
This booklet takes a different method of details retrieval via laying down the rules for a contemporary algebra of knowledge retrieval according to lattice concept. All significant retrieval equipment constructed to this point are defined intimately – Boolean, Vector house and probabilistic equipment, but additionally net retrieval algorithms like PageRank, HITS, and SALSA – and the writer exhibits that all of them should be taken care of elegantly in a unified formal manner, utilizing lattice idea because the one simple thought. extra, he additionally demonstrates that the lattice-based method of details retrieval permits us to formulate new retrieval methods.
S?ndor Dominich’s presentation is characterised by way of an engineering-like method, describing all equipment and applied sciences with as a lot arithmetic as wanted for readability and exactness. His readers in either machine technological know-how and arithmetic will find out how one unmarried inspiration can be utilized to appreciate an important retrieval equipment, to suggest new ones, and likewise to realize new insights into retrieval modeling normally. therefore, his publication is suitable for researchers and graduate scholars, who will also enjoy the many routines on the finish of every chapter.
Read or Download The modern algebra of information retrieval PDF
Best algebra books
Globalizing Interests: Pressure Groups and Denationalization
Globalizing pursuits is an cutting edge research of globalization "from inside," taking a look at the response of nationally constituted curiosity teams to demanding situations produced through the denationalization procedure. The members concentrate on company institutions, exchange unions, civil rights enterprises, and right-wing populists from Canada, Germany, nice Britain, and the USA, and look at how they've got replied to 3 tremendous globalized factor components: the net, migration, and weather swap.
Extra resources for The modern algebra of information retrieval
Sample text
We end this section by noting that one of the goals of this book is to show that there is a strong connection between IR and modern algebra, provided primarily through one of the basic notions in the latter—the lattice—in the sense that it will be shown that the major retrieval methods can all be based upon this concept. ” So begins one of the papers2 Gian-Carlo Rota, one of the prominent figures in lattice theory. The hostility toward lattices began when Dedekind published the papers that first gave birth to the theory.
The pentagon lattice N5 (Fig. 7). It is clear that x ≤ y. 11) which is different from (x ∨ z) ∧ y = 1 ∧ y = y. 12) Modularity is thus not a consequence of the axioms that define the notion of lattice. 3 The set т of natural numbers ordered by the relation “divides” is a modular lattice. m. d. (a, b), c]. 1. Let L denote a modular lattice, and let A ≤ B, A, B ∈ L. Then, A ∧ C = B ∧ C and A ∨ C = B ∨ C imply A = B. 8 Distributive Lattice 53 Proof. Indeed, we have: A = A ∨ (C ∧ A) = A ∨ (A ∧ C) = A ∨ (B ∧ C) = A ∨ (C ∧ B) = (A ∨ C) ∧ B = (B ∨ C) ∧ B = =B (absorption) (commutativity) (by assumption) (commutativity) (modularity) (by assumption) (absorption).
If an object x is an element of a set S (equivalent formulation: x belongs to S), this is denoted as x ∈ S. The term x ∉ S means that x does not belong to S. It is very important to note that: • An element can occur at most once in a set. • The order of the elements in a set is unimportant. 3 for the notion of predicate] that all elements must share: A = {x | P(x)}. A set having a fixed number of elements is finite, and infinite otherwise. An empty set contains no elements and is denoted by ∅. 7 • т = {1, 2,…,n,…} denotes the set of natural numbers.
The modern algebra of information retrieval by Sándor Dominich
by Ronald
4.3