The tag has no wiki summary.

learn more… | top users | synonyms

3
votes
0answers
311 views

Similarity calculations for arrays

First of all, my apologies if I mess up the terminology. I've been out of math for several years, so I'm certain I'm going to use terms incorrectly. Also, though I concentrated mathematics in college, ...
2
votes
0answers
21 views

Evaluation of a semi-supervised ranking model

I learned ranking model with graph-based semi-supervised approach, while labeled (just positive) and unlabeled (positive and negative) data is both used in training. With the model, all of the data ...
2
votes
0answers
131 views

Why are ERR (Expected Reciprocal Ranking) scores not normalized?

It seems to me that normalized ERR (Expected Reciprocal Ranking) scores (ERR scores of your ranking algorithm divided by ERR score calculated for the ground truth ranking) are more useful than the ...
2
votes
0answers
82 views

Software library for Hidden Markov Modeling of a large text database

Given we have a large database of texts (e.g. product descriptions) and we want to extract multiple types of information (e.g. brand, release date, features, price, etc.) what's a good library to ...
2
votes
0answers
156 views

How to to calculate the topic distribution of a document

I have a simple (may be stupid) question. I want to calculate Kullback–Leibler divergence on two documents. It requires probability distribution of each document. I do not know how to calculate ...
1
vote
0answers
11 views

Information retrieval performance measures for unknown test collection?

I am evaluating a web search relevance feedback algorithm. The algorithm uses Bing API as source for its result sets. To evaluate the algorithm I will be conducting a user study. In the end I will ...
1
vote
0answers
64 views

Learning to Rank: query-dependent vs. query-independent features

I've been doing some reading about learning to rank - specifically lambdaMART - and one thing I am confused about is the role of features. When training a model, should one only use query-dependent ...
1
vote
0answers
63 views

Mutual Information for clustering

I'm working on a document clustering application and decided to use Normalized Mutual Information as one of the measures of effectivenes. But I don't really understand how to implement this in that ...
1
vote
0answers
57 views

MAE/MSE with or without square root

I read some papers about recommender systems and information retrieval, where Mean Absolut Error and Mean Squared Error are mentioned. But I've found some differences between the formal definition of ...
1
vote
0answers
83 views

Is that overfitting?

Given a document-term matrix $X$, where $$X(d, t) = \textit{occurrences of 't' in 'd'}$$, it's possible to compute it's Truncated Singular Value Decomposition:$$X_k = U_k \Sigma_k V_k^T$$ Then, for a ...
1
vote
0answers
108 views

Using sentiment lexicons or all words processing for sentiment analysis?

I am learning sentiment analysis to apply it to twitter real time data to predict user's mood. I ponder about using which alternative way to do that data mining job. Use all words to process and ...
1
vote
0answers
30 views

Evaluation and Testsets for NNMF

I am trying to evaluate my recommender system which uses Non-negative Matrix Factorization. Some things that I evaluate are How does the size of the feature matrix affect the recommendations How ...
0
votes
0answers
7 views

Context-aware information retrieval?

I was asked a puzzle lately and so I decided to cheat and find the answer on Google. The puzzle was asked to me in a different language than English, so I had to think about the main context and then ...
0
votes
0answers
26 views

Difference between Weighted Average Entropy and Adjusted Mutual Information (for evaluating Clustering)

I was advised by my team leader to use this weighted average entropy to evaluating the performance of my dbscan clustering algorithm, and its mathematical formulation is: Scikit provides what many ...
0
votes
0answers
18 views

choosing best value for N when using N-Gram approach

the question is quite general, but I am doing a research related to supervised machine learning to classify two set of characters into two categories. in fact, I want to compute some measures of ...
0
votes
0answers
5 views

Get positions/values from heat costs bill

for a project I need to extract values from customers yearly heat costs bill. The customer takes a photo of the bill and the program should extract the values heating period of the billing, type of ...
0
votes
0answers
46 views

Using relative frequency for Euclidean and cosine distance (dissimilarity)

How to calculate the Euclidean distance (dissimilarity) between two documents, e.g., D1 and D2 using relative frequency? Here is an example of both cosine and Euclidean distance between two ...
0
votes
0answers
9 views

Search for similar documents on growing term-base

Could you please recommend any approach (if it exists) for similar document search considering the following: It's necessary to provide term base explicitly. This is a dictionary of specific named ...
0
votes
0answers
15 views

Can LSA find correlations between multiple words?

I need to find correlations between multiple terms (say, 3 or 4) in a single-term search index. I'm trying to figure out if LSA fits to the problem. Am I right that LSA is no more than a term-to-term ...
0
votes
0answers
14 views

Evaluation of IR approach without test collections

I am trying to evaluate an information retrieval approach. More specifically, it's a query expansion algorithm, based on topic distribution in retrieved documents. I want to evaluate my approach ...
0
votes
0answers
23 views

maximize mean F1 score in multilabel information retrieval problem

I have a multilabel text classification problem where each observation will have one or more labels associated to it. The metric I want to maximize is mean F1 score. Are there standard ways to ...
0
votes
0answers
45 views

Build corpus with phrases

I have my documents as: doc1 = beautifull, very good, very bad, you are great doc2 = very bad, good restaurent, nice place to visit I want to make my corpus ...
0
votes
0answers
25 views

LexRank damping factor

I am looking into using LexRank to do some text summarization. I am looking at the original paper. One thing that puzzles me is whether a damping factor is used or not. The formulae are all using it, ...
0
votes
0answers
11 views

relevance feedback - (Pseudo relevance feedback)

While studying relevance feedback(Pseudo relevance feedback), I have learn that the model can go horribly wrong for some queries. Can anyone give reasons why this is?
0
votes
0answers
40 views

Rocchio algorithm - relevance feedback

I am studying the Rocchio alorithm. I understand how it works. And typically we set Positive feedback is more valuable than negative feedback (so, set β < γ; e.g. γ = 0.25, β = 0.75). And many ...
0
votes
0answers
48 views

Calculation of normalization constant

This is an equation from the paper "A Content-based Probabilistic Correction Model for OCR Document Retrieval" - Rong Jin, Alex G. Hauptmann , ChengXiang Zhai $$P(w|M_{\text{orig}})= ...
0
votes
0answers
39 views

User intent identification in web search queries using unlabeled data

Given a list of unlabeled search queries, is it possible to say which query is related to a certain topic? For example, if we want to select the queries where the intent of the user is to download or ...
0
votes
0answers
41 views

Algorithms for keyphrase clustering

Are there any standard algorithms for keyphrase clustering. There are several algorithms for keyphrase extraction from a corpus. For e.g. this publication reviews some of the popular keyphrase ...