Search

Spring 2017

Shao, Zhaoyang

Edge-labeled graphs are widely used to describe relationships between entities in a database. We study a class of queries on edge-labeled graphs, referred to as exemplar queries, where each query gives an example of what the user is searching for. Given an exemplar query, we study the problem of...

Spring 2020

Sarabchi, Saeed

The web contains a large volume of tables that provide structured information about entities and relationships. This data may be used as a source for exploratory searches and to gather information about desired entities. This thesis focuses on one particular exploratory search where given a query...

Fall 2009

Zhao, Yang

Lookup tables are frequently used in many applications to store and retrieve keyvalue pairs. Designing efficient lookup tables can be challenging with constraints placed on storage, query response time and/or result accuracy. This thesis proposes Geometric filter, a lookup table with a space...

Fall 2014

Yu, Jiangwei

We study the problem of geotagging named entities where the goal is to identify the most relevant location of a named entity based on the content of the Web pages where the entity is mentioned. We hypothesize the relationship between the mentions of an entity and its geo-center in web pages, and...

Spring 2012

Chubak, Pirooz

Natural language text is a prominent source of representing and communicating information and knowledge. It is often desirable to search in granularities of text that are smaller than a document or to query the syntactic roles and relationships within syntactically annotated text sentences, often...

Fall 2021

Hasnat, Md Arif

We study the problem of set discovery where given a few example tuples of a desired set, we want to find the set in a collection of sets. A challenge is that the example tuples may not uniquely identify a set, and a large number of candidate sets may be returned. Our focus is on interactive...

Spring 2016

Zhou, Kai

Set expansion aims at expanding a given query seed set into a larger and more complete set by adding elements that are likely to belong to the same grouping as the elements of the query set. This thesis studies the problem of efficient set expansion; in particular, given a collection of data...

Fall 2023

Samadi, Mohammadreza

In this thesis, we study the problem of performance prediction for open-domain multi-hop Question Answering (QA), where the task is to estimate the difficulty of evaluating a multi-hop question over a corpus. Despite the extensive research on predicting the performance of ad-hoc and QA retrieval...

Fall 2023

Naeim Abadi, Ali

Product Entity Matching (PEM) is a challenging subfield of record linkage that involves linking records referring to the same real-world product. Despite recent transformer models showing near-perfect performance scores on various datasets, they struggle the most when dealing with PEM datasets....

Fall 2022

Kamalloo, Ehsan

Answering information-seeking question involves retrieving relevant documents from a massive haystack of unstructured text corpora. This dissertation aims at building question answering (QA) systems that can be deployed in the wild where incoming questions may be noisy and their distribution...