Towards modeling implicit feedback with quantum entanglement
|
|
|
- Jeremy Wheeler
- 6 years ago
- Views:
Transcription
1 Towards modeling implicit feedback with quantum entanglement Massimo Melucci Talk by Emanuele Di Buccio Department of Information Engineering University of Padua Quantum Interaction Oxford, UK, 26th 28th March 2008
2 1 Information Retrieval 2 Towards a Model of Implicit Feedback 3 Decomposition 4 A Methodology for Implicit Feedback 5 Concluding Remarks
3 Information Retrieval Concerned with retrieving all and only the documents relevant to any information need of any user Intrinsically dependent on - the user - the task the user is performing Difficulty of obtaining queries well designed for retrieval purpose - vague information need - limited experience in the search environment
4 Relevance Feedback Relevance information explicitly provided by the user used to - suggest query expansion terms - retrieve new search results - dynamically reorder existing results Effective but: - high user effort - benefit not always apparent How to remove the burdens of traditional RF?
5 Implicit Relevance Feedback Alternative: Implicit Relevance Feedback (IRF) Using contextual features generated during user-information interaction Example of contextual features: display time, bookmarking, saving, printing, scrolling Requires a software tool which - monitors subject behavior - uses these interaction data as a source of IRF
6 Modeling Implicit Feedback Abstraction of the software tool to automate the feedback process Geometric Framework proposed in [1] to model Implicit Feedback - considers multiple source of evidence - personalized for each user - tailored for each search task Framework revisited with some QM concepts according to the proposal originally reported in [2] where QM was proposed for tackling the problem of IR [1] M. Melucci and R. W. White. Utilizing a geometry of context for enhanced implicit feedback. In Proceedings of the ACM Conference on Information and Knowledge Management (CIKM), pp , Lisbon, Portugal, November [2] C.J. van Rijsbergen. The Geometry of Information Retrieval. Cambridge University Press, New York, 2004.
7 Towards a Model of Implicit Feedback
8 Towards a Model of Implicit Feedback User-document interaction Information Retrieval
9 Towards a Model of Implicit Feedback User-document interaction Document A Information Retrieval A visited document or the visit of the document
10 Towards a Model of Implicit Feedback User-document interaction Document A User B Information Retrieval A visited document or the visit of the document B user, i.e. assessment the user provides about the document
11 Towards a Model of Implicit Feedback User-document interaction Document A interaction User B Information Retrieval A visited document or the visit of the document B user, i.e. assessment the user provides about the document AB user document interaction as a composite system
12 Towards a Model of Implicit Feedback User-document interaction A B Document A interaction User B Information Retrieval A visited document or the visit of the document B user, i.e. assessment the user provides about the document AB user document interaction as a composite system relationship between A and B?
13 Towards a Model of Implicit Feedback User-document interaction A B Document A interaction User B Information Retrieval A visited document or the visit of the document B user, i.e. assessment the user provides about the document AB user document interaction as a composite system relationship between A and B? Quantum Mechanics
14 Towards a Model of Implicit Feedback User-document interaction A B Document A interaction User B φ A Information Retrieval A visited document or the visit of the document B user, i.e. assessment the user provides about the document AB user document interaction as a composite system relationship between A and B? Quantum Mechanics φ A abstraction of the visited document reduced to a vector
15 Towards a Model of Implicit Feedback User-document interaction A B Document A interaction User B φ A φ B Information Retrieval A visited document or the visit of the document B user, i.e. assessment the user provides about the document AB user document interaction as a composite system relationship between A and B? Quantum Mechanics φ A abstraction of the visited document reduced to a vector φ B abstraction of the user who visited the document reduced to a vector
16 Towards a Model of Implicit Feedback User-document interaction A B Document A interaction User B φ A φ AB φ B Information Retrieval A visited document or the visit of the document B user, i.e. assessment the user provides about the document AB user document interaction as a composite system relationship between A and B? Quantum Mechanics φ A abstraction of the visited document reduced to a vector φ B abstraction of the user who visited the document reduced to a vector φ AB interaction between A and B element of A B
17 Towards a Model of Implicit Feedback User-document interaction A B Document A interaction User B φ A φ AB φ B Information Retrieval A visited document or the visit of the document B user, i.e. assessment the user provides about the document AB user document interaction as a composite system relationship between A and B? Quantum Mechanics φ A abstraction of the visited document reduced to a vector φ B abstraction of the user who visited the document reduced to a vector φ AB interaction between A and B element of A B φ AB entangled or separable?
18 Schmidt Decomposition Bipartite System AB Bipartite pure state φ AB separable iff can be written as φ AB = φ A φ B In general φ AB is written in any orthonormal product basis { i A j B } as N A N B φ AB = C ij i A j B i=0 j=0 where C ij element of a matrix C Schmidt Decomposition Theorem There always exists a product bi-orthonormal basis { e i A ej B } where λ i nonzero singular eigenvalues of C. min{n A,N B } φ AB = λ i ea i ei B i λ i : obtained by Singular Value Decomposition of C C = BΛA λ i = {Λ} i,i Schmidt Number: number of nonzero singular eigenvalues of C
19 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement
20 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement
21 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement Interaction Data subset of the document features of the dataset
22 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement Interaction Data subset of the document features of the dataset - display time - bookmark - saving - access frequency - scrolling
23 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement Interaction Data subset of the document features of the dataset - display time - bookmark - saving - access frequency - scrolling usefulness scores assigned to each document
24 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement
25 A Methodology for Implicit Feedback normalization of the dataset Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement
26 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement normalization of the dataset choice of a subset of subject IDs and a subset of task IDs
27 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement normalization of the dataset choice of a subset of subject IDs and a subset of task IDs selection of the five features for each subject
28 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement normalization of the dataset choice of a subset of subject IDs and a subset of task IDs selection of the five features for each subject computation of the average value of every feature from the tuples of the chosen subject and task identifiers
29 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement normalization of the dataset choice of a subset of subject IDs and a subset of task IDs selection of the five features for each subject computation of the average value of every feature from the tuples of the chosen subject and task identifiers grouping average values by usefulness score into a binary scale
30 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement normalization of the dataset choice of a subset of subject IDs and a subset of task IDs selection of the five features for each subject computation of the average value of every feature from the tuples of the chosen subject and task identifiers grouping average values by usefulness score into a binary scale normalization of the obtained 2 5 matrix
31 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement
32 A Methodology for Implicit Feedback Possible Methodology 1 preparation of the interaction data 2 computation of a contingency matrix 3 decomposition of the contingency matrix 4 analysis of entanglement
33 Example - All subjects and All tasks C = display time bookmark saving frequency scrolling useless useful
34 Example - All subjects and All tasks C = display time bookmark saving frequency scrolling useless useful Decomposition of the contingency matrix: SVD of C C = BΛA [ ] Λ = A = display time bookmark saving frequency scrolling
35 Example - All subjects and All tasks C = display time bookmark saving frequency scrolling useless useful [ Λ = Analysis of the Entanglement λ 1,1 = Schmidt Decomposition φ AB 1 A 1 B all the subjects and tasks: A B is a product state vector is entanglement somehow related to the subject or to the task? ]
36 Example - Subject 1 and Task 1 C = display time bookmark saving frequency scrolling useless useful
37 Example - Subject 1 and Task 1 C = display time bookmark saving frequency scrolling useless useful Decomposition of the contingency matrix: SVD of C C = BΛA [ ] Λ = A = display time bookmark saving frequency scrolling
38 Example - Subject 1 and Task 1 C = display time bookmark saving frequency scrolling useless useful Analysis of the Entanglement [ Λ = Second singular value is significantly greater than 0 Schmidt number is significantly greater than 1 φ AB is entangled ]
39 Concluding Remarks and Open Issues User-document interaction A B Document A interaction User B φ A φ AB φ B User visiting a document state of the system (A) is the pure state of the observable which describes the measurement of the style of interaction User assessing the usefulness of a document the state of the system (B) is to the pure state of the observable that describes the measurement of usefulness State of A B separable measurement of a property does not influence the state of the other observable What happens if the composite state of A B is entangled?
40 Open Issues When the composite state of A B is entangled - how does the state of B behave? - what pure state of B does it collapse to? When does the collapse occur, given that it occurs? Entanglement used to verify the existence of a relationship between user and information. How to use it for retrieval purpose?
Can Vector Space Bases Model Context?
Can Vector Space Bases Model Context? Massimo Melucci University of Padua Department of Information Engineering Via Gradenigo, 6/a 35031 Padova Italy melo@dei.unipd.it Abstract Current Information Retrieval
MP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
EIGENVALE PROBLEMS AND THE SVD. [5.1 TO 5.3 & 7.4]
![EIGENVALE PROBLEMS AND THE SVD. [5.1 TO 5.3 & 7.4]](/thumbs/95/124092997.jpg "EIGENVALE PROBLEMS AND THE SVD. [5.1 TO 5.3 & 7.4]")
EIGENVALE PROBLEMS AND THE SVD. [5.1 TO 5.3 & 7.4] Eigenvalue Problems. Introduction Let A an n n real nonsymmetric matrix. The eigenvalue problem: Au = λu λ C : eigenvalue u C n : eigenvector Example:
Let A an n n real nonsymmetric matrix. The eigenvalue problem: λ 1 = 1 with eigenvector u 1 = ( ) λ 2 = 2 with eigenvector u 2 = ( 1
Eigenvalue Problems. Introduction Let A an n n real nonsymmetric matrix. The eigenvalue problem: EIGENVALE PROBLEMS AND THE SVD. [5.1 TO 5.3 & 7.4] Au = λu Example: ( ) 2 0 A = 2 1 λ 1 = 1 with eigenvector
A Quantum Query Expansion Approach for Session Search
entropy Article A Quantum Query Expansion Approach for Session Search Peng Zhang 1, Jingfei Li 1, Benyou Wang 1, Xiaozhao Zhao 1, Dawei Song 1,2, *, Yuexian Hou 1 and Massimo Melucci 3 1 Tianjin Key Laboratory
Singular Value Decomposition
Chapter 6 Singular Value Decomposition In Chapter 5, we derived a number of algorithms for computing the eigenvalues and eigenvectors of matrices A R n n. Having developed this machinery, we complete our
Probabilistic Information Retrieval
Probabilistic Information Retrieval Sumit Bhatia July 16, 2009 Sumit Bhatia Probabilistic Information Retrieval 1/23 Overview 1 Information Retrieval IR Models Probability Basics 2 Document Ranking Problem
Matrices, Vector Spaces, and Information Retrieval
Matrices, Vector Spaces, and Information Authors: M. W. Berry and Z. Drmac and E. R. Jessup SIAM 1999: Society for Industrial and Applied Mathematics Speaker: Mattia Parigiani 1 Introduction Large volumes
Linear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
Principles of Quantum Mechanics Pt. 2
Principles of Quantum Mechanics Pt. 2 PHYS 500 - Southern Illinois University February 9, 2017 PHYS 500 - Southern Illinois University Principles of Quantum Mechanics Pt. 2 February 9, 2017 1 / 13 The
Topic 2: The mathematical formalism and the standard way of thin
The mathematical formalism and the standard way of thinking about it http://www.wuthrich.net/ MA Seminar: Philosophy of Physics Vectors and vector spaces Vectors and vector spaces Operators Albert, Quantum
The Principles of Quantum Mechanics: Pt. 1
The Principles of Quantum Mechanics: Pt. 1 PHYS 476Q - Southern Illinois University February 15, 2018 PHYS 476Q - Southern Illinois University The Principles of Quantum Mechanics: Pt. 1 February 15, 2018
Introduction to Information Retrieval
Introduction to Information Retrieval http://informationretrieval.org IIR 18: Latent Semantic Indexing Hinrich Schütze Center for Information and Language Processing, University of Munich 2013-07-10 1/43
Dimensionality Reduction: PCA. Nicholas Ruozzi University of Texas at Dallas
Dimensionality Reduction: PCA Nicholas Ruozzi University of Texas at Dallas Eigenvalues λ is an eigenvalue of a matrix A R n n if the linear system Ax = λx has at least one non-zero solution If Ax = λx
A Formalization of Logical Imaging for IR using QT
A Formalization of Logical Imaging for IR using QT September 1st, 2008 guido@dcs.gla.ac.uk http://www.dcs.gla.ac.uk/ guido Information Retrieval Group University of Glasgow QT in IR Why QT? General guidelines
LINEAR ALGEBRA KNOWLEDGE SURVEY
LINEAR ALGEBRA KNOWLEDGE SURVEY Instructions: This is a Knowledge Survey. For this assignment, I am only interested in your level of confidence about your ability to do the tasks on the following pages.
Linear Algebra and Dirac Notation, Pt. 3
Linear Algebra and Dirac Notation, Pt. 3 PHYS 500 - Southern Illinois University February 1, 2017 PHYS 500 - Southern Illinois University Linear Algebra and Dirac Notation, Pt. 3 February 1, 2017 1 / 16
The Axiometrics Project
The Axiometrics Project Eddy Maddalena and Stefano Mizzaro Department of Mathematics and Computer Science University of Udine Udine, Italy eddy.maddalena@uniud.it, mizzaro@uniud.it Abstract. The evaluation
Lecture 5: Web Searching using the SVD
Lecture 5: Web Searching using the SVD Information Retrieval Over the last 2 years the number of internet users has grown exponentially with time; see Figure. Trying to extract information from this exponentially
13 Searching the Web with the SVD
13 Searching the Web with the SVD 13.1 Information retrieval Over the last 20 years the number of internet users has grown exponentially with time; see Figure 1. Trying to extract information from this
How Latent Semantic Indexing Solves the Pachyderm Problem
How Latent Semantic Indexing Solves the Pachyderm Problem Michael A. Covington Institute for Artificial Intelligence The University of Georgia 2011 1 Introduction Here I present a brief mathematical demonstration
PV211: Introduction to Information Retrieval https://www.fi.muni.cz/~sojka/pv211
PV211: Introduction to Information Retrieval https://www.fi.muni.cz/~sojka/pv211 IIR 18: Latent Semantic Indexing Handout version Petr Sojka, Hinrich Schütze et al. Faculty of Informatics, Masaryk University,
Data Mining and Matrices
Data Mining and Matrices 05 Semi-Discrete Decomposition Rainer Gemulla, Pauli Miettinen May 16, 2013 Outline 1 Hunting the Bump 2 Semi-Discrete Decomposition 3 The Algorithm 4 Applications SDD alone SVD
Citation for published version (APA): Andogah, G. (2010). Geographically constrained information retrieval Groningen: s.n.
University of Groningen Geographically constrained information retrieval Andogah, Geoffrey IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from
Information Retrieval
Introduction to Information CS276: Information and Web Search Christopher Manning and Pandu Nayak Lecture 13: Latent Semantic Indexing Ch. 18 Today s topic Latent Semantic Indexing Term-document matrices
NATIONAL UNIVERSITY OF SINGAPORE DEPARTMENT OF MATHEMATICS SEMESTER 2 EXAMINATION, AY 2010/2011. Linear Algebra II. May 2011 Time allowed :
NATIONAL UNIVERSITY OF SINGAPORE DEPARTMENT OF MATHEMATICS SEMESTER 2 EXAMINATION, AY 2010/2011 Linear Algebra II May 2011 Time allowed : 2 hours INSTRUCTIONS TO CANDIDATES 1. This examination paper contains
Decay of the Singlet Conversion Probability in One Dimensional Quantum Networks
Decay of the Singlet Conversion Probability in One Dimensional Quantum Networks Scott Hottovy shottovy@math.arizona.edu Advised by: Dr. Janek Wehr University of Arizona Applied Mathematics December 18,
Three right directions and three wrong directions for tensor research
Three right directions and three wrong directions for tensor research Michael W. Mahoney Stanford University ( For more info, see: http:// cs.stanford.edu/people/mmahoney/ or Google on Michael Mahoney
Latent Semantic Indexing (LSI) CE-324: Modern Information Retrieval Sharif University of Technology
Latent Semantic Indexing (LSI) CE-324: Modern Information Retrieval Sharif University of Technology M. Soleymani Fall 2014 Most slides have been adapted from: Profs. Manning, Nayak & Raghavan (CS-276,
Dimensionality Reduction
Dimensionality Reduction Given N vectors in n dims, find the k most important axes to project them k is user defined (k < n) Applications: information retrieval & indexing identify the k most important
Problem # Max points possible Actual score Total 120
FINAL EXAMINATION - MATH 2121, FALL 2017. Name: ID#: Email: Lecture & Tutorial: Problem # Max points possible Actual score 1 15 2 15 3 10 4 15 5 15 6 15 7 10 8 10 9 15 Total 120 You have 180 minutes to
Matrix decompositions
Matrix decompositions Zdeněk Dvořák May 19, 2015 Lemma 1 (Schur decomposition). If A is a symmetric real matrix, then there exists an orthogonal matrix Q and a diagonal matrix D such that A = QDQ T. The
Geometric and Quantum Methods for Information Retrieval
PAPER Geometric and Quantum Methods for Information Retrieval Yaoyong Li, Hamish Cunningham Department of Computer Science, University of Sheffield, Sheffield, UK {yaoyong;hamish}@dcs.shef.ac.uk Abstract
A Note on the Effect of Term Weighting on Selecting Intrinsic Dimensionality of Data
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 1 Sofia 2009 A Note on the Effect of Term Weighting on Selecting Intrinsic Dimensionality of Data Ch. Aswani Kumar 1,
Modern Information Retrieval
Modern Information Retrieval Chapter 3 Modeling Introduction to IR Models Basic Concepts The Boolean Model Term Weighting The Vector Model Probabilistic Model Retrieval Evaluation, Modern Information Retrieval,
(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =
. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)
Latent Semantic Analysis (Tutorial)
Latent Semantic Analysis (Tutorial) Alex Thomo Eigenvalues and Eigenvectors Let A be an n n matrix with elements being real numbers. If x is an n-dimensional vector, then the matrix-vector product Ax is
Principal components analysis COMS 4771
Principal components analysis COMS 4771 1. Representation learning Useful representations of data Representation learning: Given: raw feature vectors x 1, x 2,..., x n R d. Goal: learn a useful feature
From Matrix to Tensor. Charles F. Van Loan
From Matrix to Tensor Charles F. Van Loan Department of Computer Science January 28, 2016 From Matrix to Tensor From Tensor To Matrix 1 / 68 What is a Tensor? Instead of just A(i, j) it s A(i, j, k) or
Maximal vectors in Hilbert space and quantum entanglement
Maximal vectors in Hilbert space and quantum entanglement William Arveson arveson@math.berkeley.edu UC Berkeley Summer 2008 arxiv:0712.4163 arxiv:0801.2531 arxiv:0804.1140 Overview Quantum Information
9 Searching the Internet with the SVD
9 Searching the Internet with the SVD 9.1 Information retrieval Over the last 20 years the number of internet users has grown exponentially with time; see Figure 1. Trying to extract information from this
Markov Precision: Modelling User Behaviour over Rank and Time
Markov Precision: Modelling User Behaviour over Rank and Time Marco Ferrante 1 Nicola Ferro 2 Maria Maistro 2 1 Dept. of Mathematics, University of Padua, Italy ferrante@math.unipd.it 2 Dept. of Information
Quantum Entanglement- Fundamental Aspects
Quantum Entanglement- Fundamental Aspects Debasis Sarkar Department of Applied Mathematics, University of Calcutta, 92, A.P.C. Road, Kolkata- 700009, India Abstract Entanglement is one of the most useful
Functional Analysis Review
Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all
Ma/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
Recommender systems, matrix factorization, variable selection and social graph data
Recommender systems, matrix factorization, variable selection and social graph data Julien Delporte & Stéphane Canu stephane.canu@litislab.eu StatLearn, april 205, Grenoble Road map Model selection for
Elementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
Applied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
Structure in Data. A major objective in data analysis is to identify interesting features or structure in the data.
Structure in Data A major objective in data analysis is to identify interesting features or structure in the data. The graphical methods are very useful in discovering structure. There are basically two
Linear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
EE16B Designing Information Devices and Systems II
EE6B Designing Information Devices and Systems II Lecture 9B Geometry of SVD, PCA Uniqueness of the SVD Find SVD of A 0 A 0 AA T 0 ) ) 0 0 ~u ~u 0 ~u ~u ~u ~u Uniqueness of the SVD Find SVD of A 0 A 0
Latent Semantic Indexing (LSI) CE-324: Modern Information Retrieval Sharif University of Technology
Latent Semantic Indexing (LSI) CE-324: Modern Information Retrieval Sharif University of Technology M. Soleymani Fall 2016 Most slides have been adapted from: Profs. Manning, Nayak & Raghavan (CS-276,
arxiv: v1 [cs.ir] 26 Oct 2018
![arxiv: v1 [cs.ir] 26 Oct 2018](/thumbs/89/99842770.jpg "arxiv: v1 [cs.ir] 26 Oct 2018")
Investigating non-classical correlations between decision fused multi-modal documents. Dimitris Gkoumas 1, Sagar Uprety 1, and Dawei Song 1,2 arxiv:1810.11303v1 [cs.ir] 26 Oct 2018 1 The Open University,
.. CSC 566 Advanced Data Mining Alexander Dekhtyar..
.. CSC 566 Advanced Data Mining Alexander Dekhtyar.. Information Retrieval Latent Semantic Indexing Preliminaries Vector Space Representation of Documents: TF-IDF Documents. A single text document is a
Matrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A =
30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can
USING SINGULAR VALUE DECOMPOSITION (SVD) AS A SOLUTION FOR SEARCH RESULT CLUSTERING
POZNAN UNIVE RSIY OF E CHNOLOGY ACADE MIC JOURNALS No. 80 Electrical Engineering 2014 Hussam D. ABDULLA* Abdella S. ABDELRAHMAN* Vaclav SNASEL* USING SINGULAR VALUE DECOMPOSIION (SVD) AS A SOLUION FOR
Link Analysis Ranking
Link Analysis Ranking How do search engines decide how to rank your query results? Guess why Google ranks the query results the way it does How would you do it? Naïve ranking of query results Given query
IR Models: The Probabilistic Model. Lecture 8
IR Models: The Probabilistic Model Lecture 8 ' * ) ( % $ $ +#! "#! '& & Probability of Relevance? ' ', IR is an uncertain process Information need to query Documents to index terms Query terms and index
Linear Methods in Data Mining
Why Methods? linear methods are well understood, simple and elegant; algorithms based on linear methods are widespread: data mining, computer vision, graphics, pattern recognition; excellent general software
EE 381V: Large Scale Learning Spring Lecture 16 March 7
EE 381V: Large Scale Learning Spring 2013 Lecture 16 March 7 Lecturer: Caramanis & Sanghavi Scribe: Tianyang Bai 16.1 Topics Covered In this lecture, we introduced one method of matrix completion via SVD-based
ANONSINGULAR tridiagonal linear system of the form
Generalized Diagonal Pivoting Methods for Tridiagonal Systems without Interchanges Jennifer B. Erway, Roummel F. Marcia, and Joseph A. Tyson Abstract It has been shown that a nonsingular symmetric tridiagonal
Modeling User s Cognitive Dynamics in Information Access and Retrieval using Quantum Probability (ESR-6)
Modeling User s Cognitive Dynamics in Information Access and Retrieval using Quantum Probability (ESR-6) SAGAR UPRETY THE OPEN UNIVERSITY, UK QUARTZ Mid-term Review Meeting, Padova, Italy, 07/12/2018 Self-Introduction
Review of similarity transformation and Singular Value Decomposition
Review of similarity transformation and Singular Value Decomposition Nasser M Abbasi Applied Mathematics Department, California State University, Fullerton July 8 7 page compiled on June 9, 5 at 9:5pm
Introduction to Quantum Information Hermann Kampermann
Introduction to Quantum Information Hermann Kampermann Heinrich-Heine-Universität Düsseldorf Theoretische Physik III Summer school Bleubeuren July 014 Contents 1 Quantum Mechanics...........................
Entanglement in Quantum Field Theory
Entanglement in Quantum Field Theory John Cardy University of Oxford DAMTP, December 2013 Outline Quantum entanglement in general and its quantification Path integral approach Entanglement entropy in 1+1-dimensional
Machine Learning for Large-Scale Data Analysis and Decision Making A. Week #1
Machine Learning for Large-Scale Data Analysis and Decision Making 80-629-17A Week #1 Today Introduction to machine learning The course (syllabus) Math review (probability + linear algebra) The future
1998: enter Link Analysis
1998: enter Link Analysis uses hyperlink structure to focus the relevant set combine traditional IR score with popularity score Page and Brin 1998 Kleinberg Web Information Retrieval IR before the Web
The troubles with using a logical model of IR on a large collection of documents
The troubles with using a logical model of IR on a large collection of documents Fabio Crestani Dipartimento di Elettronica ed Informatica Universitá a degli Studi di Padova Padova - Italy Ian Ruthven
Data Mining and Matrices
Data Mining and Matrices 10 Graphs II Rainer Gemulla, Pauli Miettinen Jul 4, 2013 Link analysis The web as a directed graph Set of web pages with associated textual content Hyperlinks between webpages
Predicting Neighbor Goodness in Collaborative Filtering
Predicting Neighbor Goodness in Collaborative Filtering Alejandro Bellogín and Pablo Castells {alejandro.bellogin, pablo.castells}@uam.es Universidad Autónoma de Madrid Escuela Politécnica Superior Introduction:
Machine Learning. Principal Components Analysis. Le Song. CSE6740/CS7641/ISYE6740, Fall 2012
Machine Learning CSE6740/CS7641/ISYE6740, Fall 2012 Principal Components Analysis Le Song Lecture 22, Nov 13, 2012 Based on slides from Eric Xing, CMU Reading: Chap 12.1, CB book 1 2 Factor or Component
Linear Algebra and Eigenproblems
Appendix A A Linear Algebra and Eigenproblems A working knowledge of linear algebra is key to understanding many of the issues raised in this work. In particular, many of the discussions of the details
Lecture 13. Principal Component Analysis. Brett Bernstein. April 25, CDS at NYU. Brett Bernstein (CDS at NYU) Lecture 13 April 25, / 26
Principal Component Analysis Brett Bernstein CDS at NYU April 25, 2017 Brett Bernstein (CDS at NYU) Lecture 13 April 25, 2017 1 / 26 Initial Question Intro Question Question Let S R n n be symmetric. 1
Ma/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
Data Mining Recitation Notes Week 3
Data Mining Recitation Notes Week 3 Jack Rae January 28, 2013 1 Information Retrieval Given a set of documents, pull the (k) most similar document(s) to a given query. 1.1 Setup Say we have D documents
Spectrum (functional analysis) - Wikipedia, the free encyclopedia
1 of 6 18/03/2013 19:45 Spectrum (functional analysis) From Wikipedia, the free encyclopedia In functional analysis, the concept of the spectrum of a bounded operator is a generalisation of the concept
Machine Learning. B. Unsupervised Learning B.2 Dimensionality Reduction. Lars Schmidt-Thieme, Nicolas Schilling
Machine Learning B. Unsupervised Learning B.2 Dimensionality Reduction Lars Schmidt-Thieme, Nicolas Schilling Information Systems and Machine Learning Lab (ISMLL) Institute for Computer Science University
Reductionist View: A Priori Algorithm and Vector-Space Text Retrieval. Sargur Srihari University at Buffalo The State University of New York
Reductionist View: A Priori Algorithm and Vector-Space Text Retrieval Sargur Srihari University at Buffalo The State University of New York 1 A Priori Algorithm for Association Rule Learning Association
Correlated Information: A Logic for Multi-Partite Quantum Systems
Electronic Notes in Theoretical Computer Science 270 (2) (2011) 3 14 www.elsevier.com/locate/entcs Correlated Information: A Logic for Multi-Partite Quantum Systems Alexandru Baltag 1,2 Oxford University
EE16B Designing Information Devices and Systems II
EE16B Designing Information Devices and Systems II Lecture 9A Geometry of SVD, PCA Intro Last time: Described the SVD in Compact matrix form: U1SV1 T Full form: UΣV T Showed a procedure to SVD via A T
The Singular Value Decomposition
The Singular Value Decomposition Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) SVD Fall 2015 1 / 13 Review of Key Concepts We review some key definitions and results about matrices that will
Notes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.
Notes on singular value decomposition for Math 54 Recall that if A is a symmetric n n matrix, then A has real eigenvalues λ 1,, λ n (possibly repeated), and R n has an orthonormal basis v 1,, v n, where
Singular Value Decomposition (SVD) and Polar Form
Chapter 2 Singular Value Decomposition (SVD) and Polar Form 2.1 Polar Form In this chapter, we assume that we are dealing with a real Euclidean space E. Let f: E E be any linear map. In general, it may
Fast LSI-based techniques for query expansion in text retrieval systems
Fast LSI-based techniques for query expansion in text retrieval systems L. Laura U. Nanni F. Sarracco Department of Computer and System Science University of Rome La Sapienza 2nd Workshop on Text-based
DATA MINING LECTURE 8. Dimensionality Reduction PCA -- SVD
DATA MINING LECTURE 8 Dimensionality Reduction PCA -- SVD The curse of dimensionality Real data usually have thousands, or millions of dimensions E.g., web documents, where the dimensionality is the vocabulary
Extended IR Models. Johan Bollen Old Dominion University Department of Computer Science
Extended IR Models. Johan Bollen Old Dominion University Department of Computer Science jbollen@cs.odu.edu http://www.cs.odu.edu/ jbollen January 20, 2004 Page 1 UserTask Retrieval Classic Model Boolean
Principal Component Analysis
Principal Component Analysis Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [based on slides from Nina Balcan] slide 1 Goals for the lecture you should understand
Linear Algebra- Final Exam Review
Linear Algebra- Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.
Matrices, Vector-Spaces and Information Retrieval
POLYTECHNIC UNIVERSITY Department of Computer and Information Science Matrices, Vector-Spaces and Information Retrieval K. Ming Leung Abstract: Recently developed information retrieval technologies are
Fall TMA4145 Linear Methods. Exercise set Given the matrix 1 2
Norwegian University of Science and Technology Department of Mathematical Sciences TMA445 Linear Methods Fall 07 Exercise set Please justify your answers! The most important part is how you arrive at an
1. The Polar Decomposition
A PERSONAL INTERVIEW WITH THE SINGULAR VALUE DECOMPOSITION MATAN GAVISH Part. Theory. The Polar Decomposition In what follows, F denotes either R or C. The vector space F n is an inner product space with
CS 143 Linear Algebra Review
CS 143 Linear Algebra Review Stefan Roth September 29, 2003 Introductory Remarks This review does not aim at mathematical rigor very much, but instead at ease of understanding and conciseness. Please see
Lecture 14: SVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices) Lecturer: Sanjeev Arora
princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 14: SVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices) Lecturer: Sanjeev Arora Scribe: Today we continue the
SVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices)
Chapter 14 SVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices) Today we continue the topic of low-dimensional approximation to datasets and matrices. Last time we saw the singular
RETRIEVAL MODELS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS
RETRIEVAL MODELS Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Retrieval models Boolean model Vector space model Probabilistic
Lecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
Lecture 19: Polar and singular value decompositions; generalized eigenspaces; the decomposition theorem (1)
Lecture 19: Polar and singular value decompositions; generalized eigenspaces; the decomposition theorem (1) Travis Schedler Thurs, Nov 17, 2011 (version: Thurs, Nov 17, 1:00 PM) Goals (2) Polar decomposition
Lecture 19: Polar and singular value decompositions; generalized eigenspaces; the decomposition theorem (1)
Lecture 19: Polar and singular value decompositions; generalized eigenspaces; the decomposition theorem (1) Travis Schedler Thurs, Nov 17, 2011 (version: Thurs, Nov 17, 1:00 PM) Goals (2) Polar decomposition
Latent Semantic Analysis. Hongning Wang
Latent Semantic Analysis Hongning Wang CS@UVa VS model in practice Document and query are represented by term vectors Terms are not necessarily orthogonal to each other Synonymy: car v.s. automobile Polysemy:
Singular Value Decompsition
Singular Value Decompsition Massoud Malek One of the most useful results from linear algebra, is a matrix decomposition known as the singular value decomposition It has many useful applications in almost