信息检索4-西北工业大学分析.pptVIP

* * * * * * * * * * * * * * * Chen Qun School of Computer, NWPU 11/2016 Information Retrieval: Theory and Practice Lecture 4:IR Models IR Models Set Theoretic Models Boolean Fuzzy Extended Boolean Vector Models (Algebraic) Probabilistic Models Others (e.g., neural networks, etc.) Boolean Model for IR Based on Boolean Logic (Algebra of Sets). Fundamental principles established by George Boole in the 1850’s Deals with set membership and operations on sets Set membership in IR systems is usually based on whether (or not) a document contains a keyword (term) Intersection – Boolean ‘AND’ (∧) Union – Boolean ‘OR’ (∨) Negation – Boolean ‘NOT’ (﹁) Usually means “AND NOT” in IR Exclusive OR – ‘XOR’ – seldom used, Boolean Operations on Sets A xor B = (A ∨ B) ∧ ﹁(A ∧ B) Query Languages A way to express the query (formal expression of the information need) Types: Boolean Natural Language Stylized Natural Language Form-Based (GUI) Simple query language: Boolean Terms + Connectors terms words normalized (stemmed) words phrases thesaurus terms connectors AND OR NOT parentheses (for grouping operations) Boolean Queries Cat Cat OR Dog Cat AND Dog (Cat AND Dog) (Cat AND Dog) OR Collar (Cat AND Dog) OR (Collar AND Leash) (Cat OR Dog) AND (Collar OR Leash) Boolean Queries (Cat OR Dog) AND (Collar OR Leash) Each of the following combinations works: Pseudo-Boolean Queries A new notation, from web search +cat dog +collar leash These are prefix operators Does not mean the same thing as AND/OR! + means “mandatory, must be in document” - means “cannot be in the document” Phrases: “stray cat” AND “frayed collar” is equivalent to +“stray cat” +“frayed collar” Result Sets Run a query, get a result set Two choices Reformulate query, run on entire collection Reformulate query, run on result set Example: Dialog query (Redford AND Newman) - S1 1450 documents (S1 AND Sundance) -S2 898 documents Faceted Boolean Query Strategy: break query into facets conjunction of disjunctions (a1 OR a2