Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Reinforcement learning (7)
- Data mining (4)
- Clustering (3)
- Data Mining (3)
- Data integration (3)
-
- Personas (3)
- Plan learning (3)
- Self-organizing neural networks (3)
- Unsupervised learning (3)
- Vehicle routing (3)
- Adaptive resonance theory (2)
- Anomaly Detection (2)
- Click-through data (2)
- Coupling Learning (2)
- Crowdsourcing (2)
- Data analysis (2)
- Data fusion (2)
- Distribution (2)
- Feature Selection (2)
- Feature selection (2)
- Heuristic algorithms (2)
- Image search (2)
- Inter-source agreements (2)
- Knowledge Graph (2)
- Labor supply (2)
- Machine Learning: Data Mining (2)
- Machine learning (2)
- Minefield navigation (2)
- Multi-agent systems (2)
- Multi-valued data items (2)
- Publication Year
- Publication
- Publication Type
Articles 31 - 60 of 176
Full-Text Articles in Databases and Information Systems
Querying Recurrent Convoys Over Trajectory Data, Munkh-Erdene Yadamjav, Zhifeng Bao, Baihua Zheng, Farhana M. Choudhury, Hanan Samet
Querying Recurrent Convoys Over Trajectory Data, Munkh-Erdene Yadamjav, Zhifeng Bao, Baihua Zheng, Farhana M. Choudhury, Hanan Samet
Research Collection School Of Computing and Information Systems
Moving objects equipped with location-positioning devices continuously generate a large amount of spatio-temporal trajectory data. An interesting finding over a trajectory stream is a group of objects that are travelling together for a certain period of time. Existing studies on mining co-moving objects do not consider an important correlation between co-moving objects, which is the reoccurrence of the movement pattern. In this study, we define a problem of finding recurrent pattern of co-moving objects from streaming trajectories and propose an efficient solution that enables us to discover recent co-moving object patterns repeated within a given time period. Experimental results on …
Learning Transferrable Parameters For Long-Tailed Sequential User Behavior Modeling, Jianwen Yin, Chenghao Liu, Weiqing Wang, Jianling Sun, Steven C. H. Hoi
Learning Transferrable Parameters For Long-Tailed Sequential User Behavior Modeling, Jianwen Yin, Chenghao Liu, Weiqing Wang, Jianling Sun, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Sequential user behavior modeling plays a crucial role in online user-oriented services, such as product purchasing, news feed consumption, and online advertising. The performance of sequential modeling heavily depends on the scale and quality of historical behaviors. However, the number of user behaviors inherently follows a long-tailed distribution, which has been seldom explored. In this work, we argue that focusing on tail users could bring more benefits and address the long tails issue by learning transferrable parameters from both optimization and feature perspectives. Specifically, we propose a gradient alignment optimizer and adopt an adversarial training scheme to facilitate knowledge transfer …
Social Participation Performance Of Wheelchair Users Using Clustering And Geolocational Sensor's Data, Yukun Yin, Kar Way Tan
Social Participation Performance Of Wheelchair Users Using Clustering And Geolocational Sensor's Data, Yukun Yin, Kar Way Tan
Research Collection School Of Computing and Information Systems
For wheelchair users, social participation and physical mobility play a significant part in determining their mental health and quality of life outcomes. However, little is known about how wheelchair users move about and engage in social interactions within their life-spaces. In this project, we investigate the social participation performance of the wheelchair users based on a combination of geolocational and lifestyle survey data collected over a period of three months. This paper adopts a multi-variate approach combining geolocational travel patterns and various factors such as independence, willingness and self-perception to provide multi-faceted analysis to their lifestyles. We provide profiles of …
Deep Learning For Real-World Object Detection, Xiongwei Wu
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 …
Goods Consumed During Transit In Split Delivery Vehicle Routing Problems: Modeling And Solution, Wenzhe Yang, Di Wang, Wei Pang, Ah-Hwee Tan, You Zhou
Goods Consumed During Transit In Split Delivery Vehicle Routing Problems: Modeling And Solution, Wenzhe Yang, Di Wang, Wei Pang, Ah-Hwee Tan, You Zhou
Research Collection School Of Computing and Information Systems
This article presents the modeling and solution of an extended type of split delivery vehicle routing problem (SDVRP). In SDVRP, the demands of customers need to be met by efficiently routing a given number of capacitated vehicles, wherein each customer may be served multiple times by more than one vehicle. Furthermore, in many real-world scenarios, consumption of vehicles en route is the same as the goods being delivered to customers, such as food, water and fuel in rescue or replenishment missions in harsh environments. Moreover, the consumption may also be in virtual forms, such as time spent in constrained tasks. …
Route Choice Behaviour And Travel Information In A Congested Network: Static And Dynamic Recursive Models, Giselle De Moraes Ramos, Tien Mai, Winnie Daamen, Emma Frejinger
Route Choice Behaviour And Travel Information In A Congested Network: Static And Dynamic Recursive Models, Giselle De Moraes Ramos, Tien Mai, Winnie Daamen, Emma Frejinger
Research Collection School Of Computing and Information Systems
Travel information has the potential to influence travellers choices, in order to steer travellers to less congested routes and alleviate congestion. This paper investigates, on the one hand, how travel information affects route choice behaviour, and on the other hand, the impact of the travel time representation on the interpretation of parameter estimates and prediction accuracy. To this end, we estimate recursive models using data from an innovative data collection effort consisting of route choice observation data from GPS trackers, travel diaries and link travel times on the overall network. Though such combined data sets exist, these have not yet …
Using Knowledge Bases For Question Answering, Yunshi Lan
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 …
Feature Agglomeration Networks For Single Stage Face Detection, Jialiang Zhang, Xiongwei Wu, Steven C. H. Hoi, Jianke Zhu
Feature Agglomeration Networks For Single Stage Face Detection, Jialiang Zhang, Xiongwei Wu, Steven C. H. Hoi, Jianke Zhu
Research Collection School Of Computing and Information Systems
Recent years have witnessed promising results of exploring deep convolutional neural network for face detection. Despite making remarkable progress, face detection in the wild remains challenging especially when detecting faces at vastly different scales and characteristics. In this paper, we propose a novel simple yet effective framework of “Feature Agglomeration Networks” (FANet) to build a new single-stage face detector, which not only achieves state-of-the-art performance but also runs efficiently. As inspired by Feature Pyramid Networks (FPN) (Lin et al., 2017), the key idea of our framework is to exploit inherent multi-scale features of a single convolutional neural network by aggregating …
Optimal Feature Selection For Learning-Based Algorithms For Sentiment Classification, Zhaoxia Wang, Zhiping Lin
Optimal Feature Selection For Learning-Based Algorithms For Sentiment Classification, Zhaoxia Wang, Zhiping Lin
Research Collection School Of Computing and Information Systems
Sentiment classification is an important branch of cognitive computation—thus the further studies of properties of sentiment analysis is important. Sentiment classification on text data has been an active topic for the last two decades and learning-based methods are very popular and widely used in various applications. For learning-based methods, a lot of enhanced technical strategies have been used to improve the performance of the methods. Feature selection is one of these strategies and it has been studied by many researchers. However, an existing unsolved difficult problem is the choice of a suitable number of features for obtaining the best sentiment …
Identifying Regional Trends In Avatar Customization, Peter Mawhorter, Sercan Sengun, Haewoon Kwak, D. Fox Harrell
Identifying Regional Trends In Avatar Customization, Peter Mawhorter, Sercan Sengun, Haewoon Kwak, D. Fox Harrell
Research Collection School Of Computing and Information Systems
Since virtual identities such as social media profiles and avatars have become a common venue for self-expression, it has become important to consider the ways in which existing systems embed the values of their designers. In order to design virtual identity systems that reflect the needs and preferences of diverse users, understanding how the virtual identity construction differs between groups is important. This paper presents a new methodology that leverages deep learning and differential clustering for comparative analysis of profile images, with a case study of almost 100 000 avatars from a large online community using a popular avatar creation …
Ridesourcing Systems: A Framework And Review, Hai Wang, Hai Yang
Ridesourcing Systems: A Framework And Review, Hai Wang, Hai Yang
Research Collection School Of Computing and Information Systems
With the rapid development and popularization of mobile and wireless communication technologies, ridesourcing companies have been able to leverage internet-based platforms to operate e-hailing services in many cities around the world. These companies connect passengers and drivers in real time and are disruptively changing the transportation indus- try. As pioneers in a general sharing economy context, ridesourcing shared transportation platforms consist of a typical two-sided market. On the demand side, passengers are sensi- tive to the price and quality of the service. On the supply side, drivers, as freelancers, make working decisions flexibly based on their income from the platform …
Deep Hashing By Discriminating Hard Examples, Cheng Yan, Guansong Pang, Xiao Bai, Chunhua Shen, Jun Zhou, Edwin Hancock
Deep Hashing By Discriminating Hard Examples, Cheng Yan, Guansong Pang, Xiao Bai, Chunhua Shen, Jun Zhou, Edwin Hancock
Research Collection School Of Computing and Information Systems
This paper tackles a rarely explored but critical problem within learning to hash, i.e., to learn hash codes that effectively discriminate hard similar and dissimilar examples, to empower large-scale image retrieval. Hard similar examples refer to image pairs from the same semantic class that demonstrate some shared appearance but have different fine-grained appearance. Hard dissimilar examples are image pairs that come from different semantic classes but exhibit similar appearance. These hard examples generally have a small distance due to the shared appearance. Therefore, effective encoding of the hard examples can well discriminate the relevant images within a small Hamming distance, …
Why Reinventing The Wheels? An Empirical Study On Library Reuse And Re-Implementation, Bowen Xu, Le An, Ferdian Thung, Foutse Khomh, David Lo
Why Reinventing The Wheels? An Empirical Study On Library Reuse And Re-Implementation, Bowen Xu, Le An, Ferdian Thung, Foutse Khomh, David Lo
Research Collection School Of Computing and Information Systems
Nowadays, with the rapid growth of open source software (OSS), library reuse becomes more and more popular since a large amount of third- party libraries are available to download and reuse. A deeper understanding on why developers reuse a library (i.e., replacing self-implemented code with an external library) or re-implement a library (i.e., replacing an imported external library with self-implemented code) could help researchers better understand the factors that developers are concerned with when reusing code. This understanding can then be used to improve existing libraries and API recommendation tools for researchers and practitioners by using the developers concerns identified …
Confusion And Information Triggered By Photos In Persona Profiles, Joni Salminen, Soon-Gyo Jung, Jisun An, Haewoon Kwak, Lene Nielsen, Bernard J. Jansen
Confusion And Information Triggered By Photos In Persona Profiles, Joni Salminen, Soon-Gyo Jung, Jisun An, Haewoon Kwak, Lene Nielsen, Bernard J. Jansen
Research Collection School Of Computing and Information Systems
We investigate whether additional photos beyond a single headshot makes a persona profile more informative without confusing the end user. We conduct an eye-tracking experiment and qualitative interviews with digital content creators after varying the persona in photos via a single headshot, a headshot and photo of the persona in different contexts, and a headshot with photos of different people with key persona attributes the gender and age. Findings show that contextual photos provide significantly more persona information to end users; however, showing photos of multiple people engenders confusion and lowers informativeness. Also, as anticipated, viewing additional photos requires more …
Low-Rank Sparse Subspace For Spectral Clustering, Xiaofeng Zhu, Shichao Zhang, Yonggang Li, Jilian Zhang, Lifeng Yang, Yue Fang
Low-Rank Sparse Subspace For Spectral Clustering, Xiaofeng Zhu, Shichao Zhang, Yonggang Li, Jilian Zhang, Lifeng Yang, Yue Fang
Research Collection School Of Computing and Information Systems
The current two-step clustering methods separately learn the similarity matrix and conduct k means clustering. Moreover, the similarity matrix is learnt from the original data, which usually contain noise. As a consequence, these clustering methods cannot achieve good clustering results. To address these issues, this paper proposes a new graph clustering methods (namely Low-rank Sparse Subspace clustering (LSS)) to simultaneously learn the similarity matrix and conduct the clustering from the low-dimensional feature space of the original data. Specifically, the proposed LSS integrates the learning of similarity matrix of the original feature space, the learning of similarity matrix of the low-dimensional …
Correlation-Sensitive Next-Basket Recommendation, Duc Trong Le, Hady Wirawan Lauw, Yuan Fang
Correlation-Sensitive Next-Basket Recommendation, Duc Trong Le, Hady Wirawan Lauw, Yuan Fang
Research Collection School Of Computing and Information Systems
Items adopted by a user over time are indicative ofthe underlying preferences. We are concerned withlearning such preferences from observed sequencesof adoptions for recommendation. As multipleitems are commonly adopted concurrently, e.g., abasket of grocery items or a sitting of media consumption, we deal with a sequence of baskets asinput, and seek to recommend the next basket. Intuitively, a basket tends to contain groups of relateditems that support particular needs. Instead of recommending items independently for the next basket, we hypothesize that incorporating informationon pairwise correlations among items would help toarrive at more coherent basket recommendations.Towards this objective, we develop a …
Model And Analysis Of Labor Supply For Ride-Sharing Platforms In The Presence Of Sample Self-Selection And Endogeneity, Hao Sun, Hai Wang, Zhixi Wan
Model And Analysis Of Labor Supply For Ride-Sharing Platforms In The Presence Of Sample Self-Selection And Endogeneity, Hao Sun, Hai Wang, Zhixi Wan
Research Collection School Of Computing and Information Systems
With the popularization of ride-sharing services, drivers working as freelancers on ride-sharing platforms can design their schedules flexibly. They make daily decisions regard- ing whether to participate in work, and if so, how many hours to work. Factors such as hourly income rate affect both the participation decision and working-hour decision, and evaluation of the impacts of hourly income rate on labor supply becomes important. In this paper, we propose an econometric framework with closed-form measures to estimate both the participation elasticity (i.e., extensive margin elasticity) and working-hour elasticity (i.e., intensive margin elasticity) of labor supply. We model the sample …
Metagraph-Based Learning On Heterogeneous Graphs, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Jiaqi Shi, Kevin Chang, Xiao-Li Li
Metagraph-Based Learning On Heterogeneous Graphs, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Jiaqi Shi, Kevin Chang, Xiao-Li Li
Research Collection School Of Computing and Information Systems
Data in the form of graphs are prevalent, ranging from biological and social networks to citation graphs and the Web. Inparticular, most real-world graphs are heterogeneous, containing objects of multiple types, which present new opportunities for manyproblems on graphs. Consider a typical proximity search problem on graphs, which boils down to measuring the proximity between twogiven nodes. Most earlier studies on homogeneous or bipartite graphs only measure a generic form of proximity, without accounting fordifferent “semantic classes”—for instance, on a social network two users can be close for different reasons, such as being classmates orfamily members, which represent two distinct …
Matching Passengers And Drivers With Multiple Objectives In Ride Sharing Markets, Guodong Lyu, Chung Piaw Teo, Wangchi Cheung, Hai Wang
Matching Passengers And Drivers With Multiple Objectives In Ride Sharing Markets, Guodong Lyu, Chung Piaw Teo, Wangchi Cheung, Hai Wang
Research Collection School Of Computing and Information Systems
In many cities in the world, ride sharing companies, such as Uber, Didi, Grab and Lyft, have been able to leverage on Internet-based platforms to conduct online decision making to connect passengers and drivers. These online platforms facilitate the integration of passengers and drivers’ mobility data on smart phones in real-time, which enables a convenient matching between demand and supply in real time. These clear operational advantages have motivated many similar shared service business models in the public transportation arena, and have been a disruptive force to the traditional taxi industry.
Cure: Flexible Categorical Data Representation By Hierarchical Coupling Learning, Songlei Jian, Guansong Pang, Longbing Cao, Kai Lu, Hang Gao
Cure: Flexible Categorical Data Representation By Hierarchical Coupling Learning, Songlei Jian, Guansong Pang, Longbing Cao, Kai Lu, Hang Gao
Research Collection School Of Computing and Information Systems
The representation of categorical data with hierarchical value coupling relationships (i.e., various value-to-value cluster interactions) is very critical yet challenging for capturing complex data characteristics in learning tasks. This paper proposes a novel and flexible coupled unsupervised categorical data representation (CURE) framework, which not only captures the hierarchical couplings but is also flexible enough to be instantiated for contrastive learning tasks. CURE first learns the value clusters of different granularities based on multiple value coupling functions and then learns the value representation from the couplings between the obtained value clusters. With two complementary value coupling functions, CURE is instantiated into …
Community Discovery In Heterogeneous Social Networks, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch
Community Discovery In Heterogeneous Social Networks, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch
Research Collection School Of Computing and Information Systems
Discovering social communities of web users through clustering analysis of heterogeneous link associations has drawn much attention. However, existing approaches typically require the number of clusters a priori, do not address the weighting problem for fusing heterogeneous types of links, and have a heavy computational cost. This chapter studies the commonly used social links of users and explores the feasibility of the proposed heterogeneous data co-clustering algorithm GHF-ART, as introduced in Sect. 3.6, for discovering user communities in social networks. Contrary to the existing algorithms proposed for this task, GHF-ART performs real-time matching of patterns and one-pass learning, which guarantees …
Modeling Sequential And Basket-Oriented Associations For Top-K Recommendation, Duc-Trong Le Duc Trong
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 …
A Coordination Framework For Multi-Agent Persuasion And Adviser Systems, Budhitama Subagdja, Ah-Hwee Tan, Yilin Kang
A Coordination Framework For Multi-Agent Persuasion And Adviser Systems, Budhitama Subagdja, Ah-Hwee Tan, Yilin Kang
Research Collection School Of Computing and Information Systems
Assistive agents have been used to give advices to the users regarding activities in daily lives. Although adviser bots are getting smarter and gaining more popularity these days they are usually developed and deployed independent from each other. When several agents operate together in the same context, their advices may no longer be effective since they may instead overwhelm or confuse the user if not properly arranged. Only little attentions have been paid to coordinating different agents to give different advices to a user within the same environment. However, aligning the advices on-the-fly with the appropriate presentation timing at the …
Deep Unsupervised Pixelization, Chu Han, Qiang Wen, Shengfeng He, Qianshu Zhu, Yinjie Tan, Guoqiang Han, Tien-Tsin Wong
Deep Unsupervised Pixelization, Chu Han, Qiang Wen, Shengfeng He, Qianshu Zhu, Yinjie Tan, Guoqiang Han, Tien-Tsin Wong
Research Collection School Of Computing and Information Systems
In this paper, we present a novel unsupervised learning method for pixelization. Due to the difficulty in creating pixel art, preparing the paired training data for supervised learning is impractical. Instead, we propose an unsupervised learning framework to circumvent such difficulty. We leverage the dual nature of the pixelization and depixelization, and model these two tasks in the same network in a bi-directional manner with the input itself as training supervision. These two tasks are modeled as a cascaded network which consists of three stages for different purposes. GridNet transfers the input image into multi-scale grid-structured images with different aliasing …
An Interpretable Neural Fuzzy Inference System For Predictions Of Underpricing In Initial Public Offerings, Di Wang, Xiaolin Qian, Chai Quek, Ah-Hwee Tan, Chunyan Miao, Xiaofeng Zhang, Geok See Ng, You Zhou
An Interpretable Neural Fuzzy Inference System For Predictions Of Underpricing In Initial Public Offerings, Di Wang, Xiaolin Qian, Chai Quek, Ah-Hwee Tan, Chunyan Miao, Xiaofeng Zhang, Geok See Ng, You Zhou
Research Collection School Of Computing and Information Systems
Due to their aptitude in both accurate data processing and human comprehensible reasoning, neural fuzzy inference systems have been widely adopted in various application domains as decision support systems. Especially in real-world scenarios such as decision making in financial transactions, the human experts may be more interested in knowing the comprehensive reasons of certain advices provided by a decision support system in addition to how confident the system is on such advices. In this paper, we apply an integrated autonomous computational model termed genetic algorithm and rough set incorporated neural fuzzy inference system (GARSINFIS) to predict underpricing in initial public …
Is There Space For Violence?: A Data-Driven Approach To The Exploration Of Spatial-Temporal Dimensions Of Conflict, Tin Seong Kam, Vincent Zhi
Is There Space For Violence?: A Data-Driven Approach To The Exploration Of Spatial-Temporal Dimensions Of Conflict, Tin Seong Kam, Vincent Zhi
Research Collection School Of Computing and Information Systems
With recent increases in incidences of political violence globally, the world has now become more uncertain and less predictable. Of particular concern is the case of violence against civilians, who are often caught in the crossfire between armed state or non-state actors. Classical methods of studying political violence and international relations need to be updated. Adopting the use of data analytic tools and techniques of studying big data would enable academics and policy makers to make sense of a rapidly changing world.
Interpretable Multimodal Retrieval For Fashion Products, Lizi Liao, Xiangnan He, Bo Zhao, Chong-Wah Ngo, Tat-Seng Chua
Interpretable Multimodal Retrieval For Fashion Products, Lizi Liao, Xiangnan He, Bo Zhao, Chong-Wah Ngo, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Deep learning methods have been successfully applied to fashion retrieval. However, the latent meaning of learned feature vectors hinders the explanation of retrieval results and integration of user feedback. Fortunately, there are many online shopping websites organizing fashion items into hierarchical structures based on product taxonomy and domain knowledge. Such structures help to reveal how human perceive the relatedness among fashion products. Nevertheless, incorporating structural knowledge for deep learning remains a challenging problem. This paper presents techniques for organizing and utilizing the fashion hierarchies in deep learning to facilitate the reasoning of search results and user intent. The novelty of …
Learning Representations Of Ultrahigh-Dimensional Data For Random Distance-Based Outlier Detection, Guansong Pang, Longbing Cao, Ling Chen, Defu Lian, Huan Liu
Learning Representations Of Ultrahigh-Dimensional Data For Random Distance-Based Outlier Detection, Guansong Pang, Longbing Cao, Ling Chen, Defu Lian, Huan Liu
Research Collection School Of Computing and Information Systems
Learning expressive low-dimensional representations of ultrahigh-dimensional data, e.g., data with thousands/millions of features, has been a major way to enable learning methods to address the curse of dimensionality. However, existing unsupervised representation learning methods mainly focus on preserving the data regularity information and learning the representations independently of subsequent outlier detection methods, which can result in suboptimal and unstable performance of detecting irregularities (i.e., outliers).This paper introduces a ranking model-based framework, called RAMODO, to address this issue. RAMODO unifies representation learning and outlier detection to learn low-dimensional representations that are tailored for a state-of-the-art outlier detection approach - the random …
Customer Segmentation Using Online Platforms: Isolating Behavioral And Demographic Segments For Persona Creation Via Aggregated User Data, Jisun An, Haewoon Kwak, Soon‑Gyo Jung, Joni Salminen, Bernard J. Jansen
Customer Segmentation Using Online Platforms: Isolating Behavioral And Demographic Segments For Persona Creation Via Aggregated User Data, Jisun An, Haewoon Kwak, Soon‑Gyo Jung, Joni Salminen, Bernard J. Jansen
Research Collection School Of Computing and Information Systems
We propose a novel approach for isolating customer segments using online customer data for products that are distributed via online social media platforms. We use non-negative matrix factorization to first identify behavioral customer segments and then to identify demographic customer segments. We employ a methodology for linking the two segments to present integrated and holistic customer segments, also known as personas. Behavioral segments are generated from customer interactions with online content. Demographic segments are generated using the gender, age, and location of these customers. In addition to evaluating our approach, we demonstrate its practicality via a system leveraging these customer …
Exact Processing Of Uncertain Top-K Queries In Multi-Criteria Settings, Kyriakos Mouratidis, Bo Tang
Exact Processing Of Uncertain Top-K Queries In Multi-Criteria Settings, Kyriakos Mouratidis, Bo Tang
Research Collection School Of Computing and Information Systems
Traditional rank-aware processing assumes a dataset that contains available options to cover a specific need (e.g., restaurants, hotels, etc) and users who browse that dataset via top-k queries with linear scoring functions, i.e., by ranking the options according to the weighted sum of their attributes, for a set of given weights. In practice, however, user preferences (weights) may only be estimated with bounded accuracy, or may be inherently uncertain due to the inability of a human user to specify exact weight values with absolute accuracy. Motivated by this, we introduce the uncertain top-k query (UTK). Given uncertain preferences, that is, …