Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Dissertations and Theses Collection (Open Access)

Discipline
Keyword
Publication Year

Articles 1 - 20 of 20

Full-Text Articles in Engineering

Connecting The Dots For Contextual Information Retrieval, Pei-Chi Lo May 2023

Connecting The Dots For Contextual Information Retrieval, Pei-Chi Lo

Dissertations and Theses Collection (Open Access)

There are many information retrieval tasks that depend on knowledge graphs to return contextually relevant result of the query. We call them Knowledgeenriched Contextual Information Retrieval (KCIR) tasks and these tasks come in many different forms including query-based document retrieval, query answering and others. These KCIR tasks often require the input query to contextualized by additional facts from a knowledge graph, and using the context representation to perform document or knowledge graph retrieval and prediction. In this dissertation, we present a meta-framework that identifies Contextual Representation Learning (CRL) and Contextual Information Retrieval (CIR) to be the two key components in …


Nudging Social Online Referrals: Evidence From A Randomized Field Experiment, Qian Zeng Sep 2022

Nudging Social Online Referrals: Evidence From A Randomized Field Experiment, Qian Zeng

Dissertations and Theses Collection (Open Access)

With the rise of social commerce platforms and customer engagement in online products and services, firms are focusing their attention on effective social online referral program to encourage customers’ online referral behaviors to grow their customer base. Hence, how to influence customers to participate in online referral is a matter of the utmost importance to firms. However, little empirical research has examined the impact of online referral program on customers’ online referral on social commerce platform. To close this research gap, this dissertation investigates the effectiveness of digital nudging for consumers’ social online referral on social commerce platforms.

Working with …


Finding Top-M Leading Records In Temporal Data, Yiyi Wang Jul 2022

Finding Top-M Leading Records In Temporal Data, Yiyi Wang

Dissertations and Theses Collection (Open Access)

A traditional top-k query retrieves the records that stand out at a certain point in time. On the other hand, a durable top-k query considers how long the records retain their supremacy, i.e., it reports those records that are consistently among the top-k in a given time interval. In this thesis, we introduce a new query to the family of durable top-k formulations. It finds the top-m leading records, i.e., those that rank among the top-k for the longest duration within the query interval. Practically, this query assesses the records based on how long …


Credit Assignment In Multiagent Reinforcement Learning For Large Agent Population, Arambam James Singh Aug 2021

Credit Assignment In Multiagent Reinforcement Learning For Large Agent Population, Arambam James Singh

Dissertations and Theses Collection (Open Access)

In the current age, rapid growth in sectors like finance, transportation etc., involve fast digitization of industrial processes. This creates a huge opportunity for next-generation artificial intelligence system with multiple agents operating at scale. Multiagent reinforcement learning (MARL) is the field of study that addresses problems in the multiagent systems. In this thesis, we develop and evaluate novel MARL methodologies that address the challenges in large scale multiagent system with cooperative setting. One of the key challenge in cooperative MARL is the problem of credit assignment. Many of the previous approaches to the problem relies on agent's individual trajectory which …


Deep Learning For Real-World Object Detection, Xiongwei Wu Jul 2020

Deep Learning For Real-World Object Detection, Xiongwei Wu

Dissertations and Theses Collection (Open Access)

Despite achieving significant progresses, most existing detectors are designed to detect objects in academic contexts but consider little in real-world scenarios. In real-world applications, the scale variance of objects can be significantly higher than objects in academic contexts; In addition, existing methods are designed for achieving localization with relatively low precision, however more precise localization is demanded in real-world scenarios; Existing methods are optimized with huge amount of annotated data, but in certain real-world scenarios, only a few samples are available. In this dissertation, we aim to explore novel techniques to address these research challenges to make object detection algorithms …


Using Knowledge Bases For Question Answering, Yunshi Lan Mar 2020

Using Knowledge Bases For Question Answering, Yunshi Lan

Dissertations and Theses Collection (Open Access)

A knowledge base (KB) is a well-structured database, which contains many of entities and their relations. With the fast development of large-scale knowledge bases such as Freebase, DBpedia and YAGO, knowledge bases have become an important resource, which can serve many applications, such as dialogue system, textual entailment, question answering and so on. These applications play significant roles in real-world industry.

In this dissertation, we try to explore the entailment information and more general entity-relation information from the KBs. Recognizing textual entailment (RTE) is a task to infer the entailment relations between sentences. We need to decide whether a hypothesis …


Preference Learning And Similarity Learning Perspectives On Personalized Recommendation, Duy Dung Le Sep 2019

Preference Learning And Similarity Learning Perspectives On Personalized Recommendation, Duy Dung Le

Dissertations and Theses Collection (Open Access)

Personalized recommendation, whose objective is to generate a limited list of items (e.g., products on Amazon, movies on Netflix, or pins on Pinterest, etc.) for each user, has gained extensive attention from both researchers and practitioners in the last decade. The necessity of personalized recommendation is driven by the explosion of available options online, which makes it difficult, if not downright impossible, for each user to investigate every option. Product and service providers rely on recommendation algorithms to identify manageable number of the most likely or preferred options to be presented to each user. Also, due to the limited screen …


Modeling Sequential And Basket-Oriented Associations For Top-K Recommendation, Duc-Trong Le Duc Trong Apr 2019

Modeling Sequential And Basket-Oriented Associations For Top-K Recommendation, Duc-Trong Le Duc Trong

Dissertations and Theses Collection (Open Access)

Top-K recommendation is a typical task in Recommender Systems. In traditional approaches, it mainly relies on the modeling of user-item associations, which emphasizes the user-specific factor or personalization. Here, we investigate another direction that models item-item associations, especially with the notions of sequence-aware and basket-level adoptions . Sequences are created by sorting item adoptions chronologically. The associations between items along sequences, referred to as “sequential associations”, indicate the influence of the preceding adoptions on the following adoptions. Considering a basket of items consumed at the same time step (e.g., a session, a day), “basket-oriented associations” imply correlative dependencies among these …


Feature-Based Transfer Learning In Natural Language Processing, Jianfei Yu Dec 2018

Feature-Based Transfer Learning In Natural Language Processing, Jianfei Yu

Dissertations and Theses Collection (Open Access)

In the past few decades, supervised machine learning approach is one of the most important methodologies in the Natural Language Processing (NLP) community. Although various kinds of supervised learning methods have been proposed to obtain the state-of-the-art performance across most NLP tasks, the bottleneck of them lies in the heavy reliance on the large amount of manually annotated data, which is not always available in our desired target domain/task. To alleviate the data sparsity issue in the target domain/task, an attractive solution is to find sufficient labeled data from a related source domain/task. However, for most NLP applications, due to …


Modeling Movement Decisions In Networks: A Discrete Choice Model Approach, Larry Lin Junjie Dec 2018

Modeling Movement Decisions In Networks: A Discrete Choice Model Approach, Larry Lin Junjie

Dissertations and Theses Collection (Open Access)

In this dissertation, we address the subject of modeling and simulation of agents and their movement decision in a network environment. We emphasize the development of high quality agent-based simulation models as a prerequisite before utilization of the model as an evaluation tool for various recommender systems and policies. To achieve this, we propose a methodological framework for development of agent-based models, combining approaches such as discrete choice models and data-driven modeling.

The discrete choice model is widely used in the field of transportation, with a distinct utility function (e.g., demand or revenue-driven). Through discrete choice models, the movement decision …


Empathetic Computing For Inclusive Application Design, Kenny Choo Tsu Wei Dec 2018

Empathetic Computing For Inclusive Application Design, Kenny Choo Tsu Wei

Dissertations and Theses Collection (Open Access)

The explosive growth of the ecosystem of personal and ambient computing de- vices coupled with the proliferation of high-speed connectivity has enabled ex- tremely powerful and varied mobile computing applications that are used every- where. While such applications have tremendous potential to improve the lives of impaired users, most mobile applications have impoverished designs to be inclusive– lacking support for users with specific disabilities. Mobile app designers today haveinadequate support to design existing classes of apps to support users with specific disabilities, and more so, lack the support to design apps that specifically target these users. One way to resolve …


Analyzing And Modeling Users In Multiple Online Social Platforms, Roy Lee Ka Wei Nov 2018

Analyzing And Modeling Users In Multiple Online Social Platforms, Roy Lee Ka Wei

Dissertations and Theses Collection (Open Access)

This dissertation addresses the empirical analysis on user-generated data from multiple online social platforms (OSPs) and modeling of latent user factors in multiple OSPs setting.

In the first part of this dissertation, we conducted cross-platform empirical studies to better understand user's social and work activities in multiple OSPs. In particular, we proposed new methodologies to analyze users' friendship maintenance and collaborative activities in multiple OSPs. We also apply the proposed methodologies on real-world OSP datasets, and the findings from our empirical studies have provided us with a better understanding on users' social and work activities which are previously not uncovered …


Exploring Offline Friendships On The Social Information Network: Network Characteristics, Information Diffusion, And Tie Strength, Felicia Natali Jul 2018

Exploring Offline Friendships On The Social Information Network: Network Characteristics, Information Diffusion, And Tie Strength, Felicia Natali

Dissertations and Theses Collection (Open Access)

The rapid increase in online social networking services over the last decade has pre- sented an unprecedented opportunity to observe users’ behaviour both on a societal and individual level. The insight gained from analysing such data can help foster a deeper understanding of social media users and the flow of information, while also offering valuable business applications. User relationships are among the most studied aspects of online behaviour. These relationships are not homogeneous. Past research has shown that people use social networks to both socialize and source in- formation. Hence, different types of links – used to socialize, gain information, …


Entity Summarization Of Reviews And Micro-Reviews, Thanh Son Nguyen May 2018

Entity Summarization Of Reviews And Micro-Reviews, Thanh Son Nguyen

Dissertations and Theses Collection (Open Access)

Along with the regular review content, there is a new type of user-generated content arising from the prevalence of mobile devices and social media, that is micro-review. Micro-reviews are bite-size reviews (usually under 200 char- acters), commonly posted on social media or check-in services, using a mobile device. They capture the immediate reaction of users, and they are rich in information, concise, and to the point. Both reviews and micro-reviews are useful for users to get to know the entity of interest, thus facilitating users in making their decision of purchasing or dining. However, the abundant number of both reviews …


From Digital Traces To Marketing Insights: Recovering Consumer Preferences For Digital Entertainment Services And Online Shopping, Ai Phuong Hoang May 2018

From Digital Traces To Marketing Insights: Recovering Consumer Preferences For Digital Entertainment Services And Online Shopping, Ai Phuong Hoang

Dissertations and Theses Collection (Open Access)

IT innovations disrupt traditional business models and challenge conventional thinking. Thus, industry incumbents face fierce competition from start-ups with new business models and new ways of engaging customers. Digital entertainment goods and personalized services have become a lucrative market, which has undergone a transformation enabled by seamless Internet connections. Meanwhile, social networks and other online platforms have brought people and business even closer.


Proactive Sequential Resource (Re)Distribution For Improving Efficiency In Urban Environments, Supriyo Ghosh Dec 2017

Proactive Sequential Resource (Re)Distribution For Improving Efficiency In Urban Environments, Supriyo Ghosh

Dissertations and Theses Collection (Open Access)

Due to the increasing population and lack of coordination, there is a mismatch in supply and demand of common resources (e.g., shared bikes, ambulances, taxis) in urban environments, which has deteriorated a wide variety of quality of life metrics such as success rate in issuing shared bikes, response times for emergency needs, waiting times in queues etc. Thus, in my thesis, I propose efficient algorithms that optimise the quality of life metrics by proactively redistributing the resources using intelligent operational (day-to-day) and strategic (long-term) decisions in the context of urban transportation and health & safety. For urban transportation, Bike Sharing …


Generic Instance-Specific Automated Parameter Tuning Framework, Linda Lindawati Jan 2014

Generic Instance-Specific Automated Parameter Tuning Framework, Linda Lindawati

Dissertations and Theses Collection (Open Access)

Meta-heuristic algorithms play an important role in solving combinatorial optimization problems (COP) in many practical applications. The caveat is that the performance of these meta-heuristic algorithms is highly dependent on their parameter configuration which controls the algorithm behaviour. Selecting the best parameter configuration is often a difficult, tedious and unsatisfying task. This thesis studies the problem of automating the selection of good parameter configurations. Existing approaches to address the challenges of parameter configuration can be classified into one-size-fits-all and instance-specific approaches. One-size-fits-all approaches focus on finding a single best parameter configuration for a set of problem instances, while instance-specific approaches …


Dynamic Queue Management For Hospital Emergency Room Services, Kar Way Tan Dec 2013

Dynamic Queue Management For Hospital Emergency Room Services, Kar Way Tan

Dissertations and Theses Collection (Open Access)

The emergency room (ER) – or emergency department (ED) – is often seen as a place with long waiting times and a lack of doctors to serve the patients. However, it is one of the most important departments in a hospital, and must efficiently serve patients with critical medical needs. In the existing literature, addressing the issue of long waiting times in an ED often takes the form of single-faceted queue-management strategies that are either from a demand perspective or from a supply perspective. From the demand perspective, there is work on queue design such as priority queues, or queue …


Go Niche Or Go Home: Influence Maximization In The Presence Of Strong Opponent, Long Foong Liow Jan 2012

Go Niche Or Go Home: Influence Maximization In The Presence Of Strong Opponent, Long Foong Liow

Dissertations and Theses Collection (Open Access)

In hotly contested product categories dominated by a few powerful firms, it is quite common for weaker or late entrants to focus only on particular segments of the whole market. The rationale for such strategy is intuitive: to avoid direct confrontation with heavy-weight firms, and to concentrate in segments where these weaker firms have comparative advantages. In marketing, this is what people called “go niche or go home”. The niche-building strategy may rely on “homophily”, which implies that consumers in a particular market segment might possess certain set of attributes that cause them to appreciate certain products better (in other …


Robust Execution Strategy For Scheduling Under Uncertainity, Na Fu Jan 2012

Robust Execution Strategy For Scheduling Under Uncertainity, Na Fu

Dissertations and Theses Collection (Open Access)

Resource Constrained Project Scheduling Problems with minimum and maximum time lags (RCPSP/max) provides a general model for resource scheduling in many real-world problems (such as manufacturing and construction engineering). Due to its practical importance and generality, providing effective algorithms and scalable solutions for RCPSP/max is a topic of growing research. Traditional methods have addressed deterministic models with all parameters known with certainty. In this thesis, we are concerned with RCPSP/max problems in an uncertain environment where durations of activities are stochastic and resource availabilities are subject to unforeseen breakdowns. We propose methods for generating robust execution strategy to protect against …