Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mostafa Keikha

dblp:20/2663 · DBLP profile ↗
← Back
15ranked-venue papers
12as first author
0since 2021 · last 2014
0009-0009-0058-6105ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 14 · 11 first-authorArtificial intelligence and machine learning · 4 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
6 papers
Information retrieval · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 16 heaviest of 16, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › web search › web information retrieval › social media retrieval
blog retrieval
0.332011
Time-based relevance models · SIGIR 2011
Investigation on smoothing and aggregation methods in blog retrieval · SIGIR 2010
Blog distillation using random walks · SIGIR 2009
Information retrieval › web search › web information retrieval › social media retrieval
blog distillation
0.222010
Investigation on smoothing and aggregation methods in blog retrieval · SIGIR 2010
Blog distillation using random walks · SIGIR 2009
Information retrieval › query reformulation
query expansion
0.232012
Time-based relevance models · SIGIR 2011
Automatic refinement of patent queries using concept importance predictors · SIGIR 2012
Investigation on smoothing and aggregation methods in blog retrieval · SIGIR 2010
Information retrieval › document retrieval › passage retrieval
answer passage retrieval
0.212014
Evaluating answer passages using summarization measures · SIGIR 2014
Information retrieval
evaluation
0.212014
Evaluating answer passages using summarization measures · SIGIR 2014
Information retrieval › document retrieval
passage retrieval
0.212014
Evaluating answer passages using summarization measures · SIGIR 2014
Information retrieval › document retrieval › domain-specific retrieval › legal information retrieval
patent retrieval
0.112012
Automatic refinement of patent queries using concept importance predictors · SIGIR 2012
Information retrieval › query understanding
query disambiguation
0.112012
Automatic refinement of patent queries using concept importance predictors · SIGIR 2012
Information retrieval › query understanding
query modeling
0.112012
Automatic refinement of patent queries using concept importance predictors · SIGIR 2012
Information retrieval › web search
blog feed search
0.112011
Time-based relevance models · SIGIR 2011
Information retrieval › document retrieval › opinion retrieval
blog opinion retrieval
0.112011
Aggregating multiple opinion evidence in proximity-based opinion retrieval · SIGIR 2011
Information retrieval › document retrieval
opinion retrieval
0.112011
Aggregating multiple opinion evidence in proximity-based opinion retrieval · SIGIR 2011
Information retrieval
relevance feedback
0.112011
Time-based relevance models · SIGIR 2011
Information retrieval › evaluation › relevance judgment
human judgment
0.112014
Evaluating answer passages using summarization measures · SIGIR 2014
Information retrieval › document retrieval
temporal information retrieval
0.012011
Time-based relevance models · SIGIR 2011
Graph algorithms and graph theory
random walk
0.012009
Blog distillation using random walks · SIGIR 2009

Methods — techniques the papers use, named apart from their topics

random walk · 0.2language modeling · 0.2summarization evaluation measures · 0.2noun phrase extraction · 0.1concept importance prediction · 0.1time-based query expansion · 0.1ordered weighted averaging · 0.1smoothing · 0.1aggregation · 0.1
YearPublicationVenuePosition
2014 Evaluating answer passages using summarization measures
abstract
Passage-based retrieval models have been studied for some time and have been shown to have some benefits for document ranking. Finding passages that are not only topically relevant, but are also answers to the users' questions would have a significant impact in applications such as mobile search. To develop models for answer passage retrieval, we need to have appropriate test collections and evaluation measures. Making annotations at the passage level is, however, expensive and can have poor coverage. In this paper, we describe the advantages of document summarization measures for evaluating answer passage retrieval and show that these measures have high correlation with existing measures and human judgments.
Mostafa Keikha, W. Bruce Croft
SIGIR1
2013 Generalizing diversity detection in blog feed retrieval
abstract
The goal of a blog retrieval system is to retrieve and rank blogs, as collections of documents, in response to a given query. Previous studies have shown that diversity among the top retrieved posts from a blog is a positive feature for indicating relevance of the blog to the query. However, existing methods capture the diversity of a blog using post-level properties that limits their application to a specific category of retrieval methods. In this paper, we propose a blog-level diversity measure where there is no assumption made about the underlying blog-ranking technique. The proposed measure enables us to integrate diversity in any existing blog retrieval method. Our experimental results show that the proposed method, while being more general, produces comparable results to the post-level diversity detection methods.
Mostafa Keikha, Fabio Crestani, W. Bruce Croft
CIKM1
2012 Diversity in blog feed retrieval
abstract
Blog distillation (blog feed retrieval) is a task in blog retrieval where the goal is to rank blogs according to their recurrent relevance to a query topic. One of the main properties of blog feed retrieval is that the unit of retrieval is a collection of documents as opposed to a single document as in other IR tasks. This collection retrieval nature of blog distillation introduces new challenges and requires new investigations specific to this problem.
Mostafa Keikha, Fabio Crestani, W. Bruce Croft
CIKM1
2012 Automatic refinement of patent queries using concept importance predictors
abstract
Patent prior art queries are full patent applications which are much longer than standard web search topics. Such queries are composed of hundreds of terms and do not represent a focused information need. One way to make the queries more focused is to select a group of key terms as representatives. Existing works show that such a selection to reduce patent queries is a challenging task mainly because of the presence of ambiguous terms. Given this setup, we present a query modeling approach where we utilize patent-specific characteristics to generate more precise queries. We propose to automatically disambiguate query terms by employing noun phrases that are extracted using the global analysis of the patent collection. We further introduce a method for predicting whether expansion using noun phrases would improve the retrieval effectiveness.
Parvaz Mahdabi, Linda Andersson, Mostafa Keikha, Fabio Crestani
SIGIR3
2012 Linguistic aggregation methods in blog retrieval
Mostafa Keikha, Fabio Crestani
Inf. Process. Manag.1
2012 Employing document dependency in blog search
abstract
Abstract The goal in blog search is to rank blogs according to their recurrent relevance to the topic of the query. State‐of‐the‐art approaches view it as an expert search or resource selection problem. We investigate the effect of content‐based similarity between posts on the performance of the retrieval system. We test two different approaches for smoothing (regularizing) relevance scores of posts based on their dependencies. In the first approach, we smooth term distributions describing posts by performing a random walk over a document‐term graph in which similar posts are highly connected. In the second, we directly smooth scores for posts using a regularization framework that aims to minimize the discrepancy between scores for similar documents. We then extend these approaches to consider the time interval between the posts in smoothing the scores. The idea is that if two posts are temporally close, then they are good sources for smoothing each other's relevance scores. We compare these methods with the state‐of‐the‐art approaches in blog search that employ Language Modeling‐based resource selection algorithms and fusion‐based methods for aggregating post relevance scores. We show performance gains over the baseline techniques which do not take advantage of the relation between posts for smoothing relevance estimates.
Mostafa Keikha, Fabio Crestani, Mark J. Carman
J. Assoc. Inf. Sci. Technol.1
2011 Predicting document effectiveness in pseudo relevance feedback
abstract
Pseudo relevance feedback (PRF) is one of effective practices in Information Retrieval. In particular, PRF via the relevance model (RM) has been widely used due to the theoretical soundness and effectiveness. In a PRF scenario, an underlying relevance model is inferred by combining language models of the top retrieved documents where the contribution of each document is assumed to be proportional to its score for the initial query. However, it is not clear that selecting the top retrieved documents only by the initial retrieval scores is actually the optimal way for query expansion.
Mostafa Keikha, Jangwon Seo, W. Bruce Croft, Fabio Crestani
CIKM1
2011 Personal Blog Retrieval Using Opinion Features
Shima Gerani, Mostafa Keikha, Mark J. Carman, Fabio Crestani
ECIR2
2011 TEMPER: A Temporal Relevance Feedback Method
Mostafa Keikha, Shima Gerani, Fabio Crestani
ECIR1
2011 Aggregating multiple opinion evidence in proximity-based opinion retrieval
abstract
Blog post opinion retrieval is the problem of ranking blog posts according to the likelihood that the post is relevant to the query and that the author was expressing an opinion about the topic (of the query). A recent study has proposed a method for finding the opinion density at query term positions in a document which uses the proximity of query term and opinion term as an indicator of their relatedness. The maximum opinion density between different query positions was used as an opinion score of the whole document. In this paper we investigate the effect of exploiting multiple opinion evidence of a document. We propose using the ordered weighted averaging (OWA) operator in order to combine the opinion score of different query positions for a final score of a document, in the proximity-based opinion retrieval system.
Shima Gerani, Mostafa Keikha, Fabio Crestani
SIGIR2
2011 Time-based relevance models
abstract
This paper addresses blog feed retrieval where the goal is to retrieve the most relevant blog feeds for a given user query. Since the retrieval unit is a blog, as a collection of posts, performing relevance feedback techniques and selecting the most appropriate documents for query expansion becomes challenging. By assuming time as an effective parameter on the blog posts content, we propose a time-based query expansion method. In this method, we select terms for expansion using most relevant days for the query, as opposed to most relevant documents. This provide us with more trustable terms for expansion. Our preliminary experiments on Blog08 collection shows that this method can outperform state of the art relevance feedback methods in blog retrieval.
Mostafa Keikha, Shima Gerani, Fabio Crestani
SIGIR1
2010 Investigation on smoothing and aggregation methods in blog retrieval
abstract
Recently, user generated data is growing rapidly and becoming one of the most important source of information in the web. Blogosphere (the collection of blogs on the web) is one of the main source of information in this category. In my work for my PhD, I mainly focussed on the blog distillation task which is: given a user query find the blogs that are most related to the query topic [3].
Mostafa Keikha
SIGIR1
2009 Effectiveness of Aggregation Methods in Blog Distillation
Mostafa Keikha, Fabio Crestani
FQAS1
2009 Blog distillation using random walks
abstract
This paper addresses the blog distillation problem. That is, given a user query find the blogs most related to the query topic. We model the blogosphere as a single graph that includes extra information besides the content of the posts. By performing a random walk on this graph we extract most relevant blogs for each query. Our experiments on the TREC'07 data set show 15% improvement in MAP and 8% improvement in [email protected] over the Language Modeling baseline.
Mostafa Keikha, Mark J. Carman, Fabio Crestani
SIGIR1
2009 Rich document representation and classification: An analysis
Mostafa Keikha, Ahmad Khonsari, Farhad Oroumchian
Knowl. Based Syst.1