VLDB 2026 Research / reviewers in the wild / expert
Rani Qumsiyeh
dblp:33/7537
· DBLP profile ↗
10ranked-venue papers
7as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 7 · 4 first-authorArtificial intelligence and machine learning · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 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
2 papers |
Recommender systems · 60% Information retrieval · 40% | |
| Artificial intelligence
1 paper |
Question answering and dialogue systems · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
content-based recommendation |
0.1 | 1 | 2012 | Predicting the ratings of multimedia items for making personalized recommendations · SIGIR 2012 |
Recommender systems
multimodal recommendation |
0.1 | 1 | 2012 | Predicting the ratings of multimedia items for making personalized recommendations · SIGIR 2012 |
Recommender systems › collaborative filtering
rating prediction |
0.1 | 1 | 2012 | Predicting the ratings of multimedia items for making personalized recommendations · SIGIR 2012 |
Information retrieval › ranking › search ranking
proximity ranking |
0.1 | 1 | 2011 | Generating Exact- and Ranked Partially-Matched Answers to Questions in Advertisements · Proc. VLDB Endow. 2011 |
Information retrieval
ranking |
0.1 | 1 | 2011 | Generating Exact- and Ranked Partially-Matched Answers to Questions in Advertisements · Proc. VLDB Endow. 2011 |
Information retrieval › query processing
boolean query processing |
0.0 | 1 | 2011 | Generating Exact- and Ranked Partially-Matched Answers to Questions in Advertisements · Proc. VLDB Endow. 2011 |
Methods — techniques the papers use, named apart from their topics
boolean model · 0.2collaborative filtering · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Enhancing web search by using query-based clusters and multi-document summaries
Rani Qumsiyeh, Yiu-Kai Ng |
Knowl. Inf. Syst. | 1 |
| 2015 | Clustering Retrieved Web Documents to Speed Up Web Searches
Rani Qumsiyeh, Yiu-Kai Ng |
ICCSA (1) | 1 |
| 2014 | Assisting web search using query suggestion based on word similarity measure and query modification patterns
Rani Qumsiyeh, Yiu-Kai Ng |
World Wide Web | 1 |
| 2013 | Enhancing Web Search Using Query-Based Clusters and LabelsabstractCurrent web search engines, such as Google, Bing, and Yahoo!, rank the set of documents S retrieved in response to a user query and display the URL of each document D in S with a title and a snippet, which serves as an abstract of D. Snippets, however, are not as useful as they are designed for, which is supposed to assist its users to quickly identify results of interest, if they exist. These snippets fail to (i) provide distinct information and (ii) capture the main contents of the corresponding documents. Moreover, when the intended information need specified in a search query is ambiguous, it is very difficult, if not impossible, for a search engine to identify precisely the set of documents that satisfy the user's intended request without requiring additional inputs. Furthermore, a document title is not always a good indicator of the content of the corresponding document. All of these design problems can be solved by our proposed query-based cluster and labeler, called QCL. QCL generates concise clusters of documents covering various subject areas retrieved in response to a user query, which saves the user's time and effort in searching for specific information of interest without having to browse through the documents one by one. Experimental results show that QCL is effective and efficient in generating high-quality clusters of documents on specific topics with informative labels. Rani Qumsiyeh, Yiu-Kai Ng |
Web Intelligence | 1 |
| 2013 | Web-based closed-domain data extraction on online advertisements
Maria Soledad Pera, Rani Qumsiyeh, Yiu-Kai Ng |
Inf. Syst. | 2 |
| 2012 | Predicting the ratings of multimedia items for making personalized recommendationsabstractExisting multimedia recommenders suggest a specific type of multimedia items rather than items of different types personalized for a user based on his/her preference. Assume that a user is interested in a particular family movie, it is appealing if a multimedia recommendation system can suggest other movies, music, books, and paintings closely related to the movie. We propose a comprehensive, personalized multimedia recommendation system, denoted MudRecS, which makes recommendations on movies, music, books, and paintings similar in content to other movies, music, books, and/or paintings that a MudRecS user is interested in. MudRecS does not rely on users' access patterns/histories, connection information extracted from social networking sites, collaborated filtering methods, or user personal attributes (such as gender and age) to perform the recommendation task. It simply considers the users' ratings, genres, role players (authors or artists), and reviews of different multimedia items, which are abundant and easy to find on the Web. MudRecS predicts the ratings of multimedia items that match the interests of a user to make recommendations. The performance ofMudRecS has been compared with current state-of-the-art multimedia recommenders using various multimedia datasets, and the experimental results show that MudRecS significantly outperforms other systems in accurately predicting the ratings of multimedia items to be recommended. Rani Qumsiyeh, Yiu-Kai Ng |
SIGIR | 1 |
| 2011 | A query-based multi-document sentiment summarizerabstractReview websites, such as Epinions.com, which offer users a platform to share their opinions on diverse products and services, provide a valuable source of opinion-rich information. Browsing through archived reviews to locate different opinions on a product or service, however, is a time-consuming and tedious task, and in most cases, the large amount of available information is difficult for users to absorb. To facilitate the process of synthesizing opinions expressed in reviews on a product or service P specified in a user query/question Q, we introduce QMSS, a query-based multi-document sentiment summarizer. QMSS creates a summary for Q, which either reflects the general opinions on P or is tailored to specific facets (i.e., features) and/or sentiment of P as specified in Q. QMSS (i) identifies the facets addressed in reviews retrieved for Q, (ii) employs a sentence-based, sentiment classifier to determine the polarity of each sentence in each review, and (iii) clusters sentences in reviews according to the facets captured in the sentences, which are identified using a keyword-label extraction algorithm. This process dictates which sentences in the reviews should be included in the summary for Q. Empirical studies have verified that QMSS is highly effective in generating summaries that satisfy users' information needs and ranks on top among the state-of-the-art query-based multi-document sentiment summarizers Maria Soledad Pera, Rani Qumsiyeh, Yiu-Kai Ng |
CIKM | 2 |
| 2011 | ReadAid: A Robust and Fully-Automated Readability Assessment ToolabstractReading is an integral part of educational development, however, it is frustrating for people who struggle to understand (are not motivated to read, respectively) text documents that are beyond (below, respectively) their readability levels. Finding appropriate reading materials, with or without first scanning through their contents, is a challenge, since there are tremendous amount of documents these days and a clear majority of them are not tagged with their readability levels. Even though existing readability assessment tools determine readability levels of text documents, they analyze solely the lexical, syntactic, and/or semantic properties of a document, which are neither fully-automated, generalized, nor well-defined and are mostly based on observations. To advance the current readability analysis technique, we propose a robust, fully-automated readability analyzer, denoted ReadAid, which employs support vector machines to combine features from the US Curriculum and College Board, traditional readability measures, and the author(s) and subject area(s) of a text document d to assess the readability level of d. ReadAid can be applied for (i) filtering documents (retrieved in response to a web query) of a particular readability level, (ii) determining the readability levels of digitalized text documents, such as book chapters, magazine articles, and news stories, or (iii) dynamically analyzing, in real time, the grade level of a text document being created. The novelty of ReadAid lies on using authorship, subject areas, and academic concepts and grammatical constructions extracted from the US Curriculum to determine the readability level of a text document. Experimental results show that ReadAid is highly effective and outperforms existing state-of-the-art readability assessment tools. Rani Qumsiyeh, Yiu-Kai Ng |
ICTAI | 1 |
| 2011 | Generating Exact- and Ranked Partially-Matched Answers to Questions in AdvertisementsabstractTaking advantage of the Web, many advertisements (ads for short) websites, which aspire to increase client's transactions and thus profits, offer searching tools which allow users to (i) post keyword queries to capture their information needs or (ii) invoke form-based interfaces to create queries by selecting search options, such as a price range, filled-in entries, check boxes, or drop-down menus. These search mechanisms, however, are inadequate, since they cannot be used to specify a natural-language query with rich syntactic and semantic content, which can only be handled by a question answering (QA) system. Furthermore, existing ads websites are incapable of evaluating arbitrary Boolean queries or retrieving partially-matched answers that might be of interest to the user whenever a user's search yields only a few or no results at all. In solving these problems, we present a QA system for ads, called CQAds, which (i) allows users to post a natural-language questionQfor retrieving relevant ads, if they exist, (ii) identifies ads as answers that partially-match the requested information expressed inQ, if insufficient or no answers toQcan be retrieved, which are ordered using asimilarity-rankingapproach, and (iii) analyzes incomplete or ambiguous questions to perform the "best guess" in retrieving answers that "best match" the selection criteria specified inQ. CQAds is also equipped with a Boolean model to evaluate Boolean operators that are eitherexplicitlyorimplicitlyspecified inQ, i.e., with or without Boolean operators specified by the users, respectively. CQAds is easy to use, scalable to all ads domains, and more powerful than search tools provided by existing ads websites, since its query-processing strategy retrieves relevant ads of higher quality and quantity. We have verified the accuracy of CQAds in retrieving ads on eight ads domains and compared its ranking strategy with other well-known ranking approaches. Rani Qumsiyeh, Maria Soledad Pera, Yiu-Kai Ng |
Proc. VLDB Endow. | 1 |
| 2010 | An Unsupervised Sentiment Classifier on Summarized or Full Reviews
Maria Soledad Pera, Rani Qumsiyeh, Yiu-Kai Ng |
WISE | 2 |