Open Access. Powered by Scholars. Published by Universities.®
Numerical Analysis and Scientific Computing
Research Collection School Of Computing and Information Systems
- Keyword
-
- Assignment problems (1)
- Average Distance (1)
- Biological system modeling (1)
- Blogging (1)
- Capacity constraints (1)
-
- Computational modeling (1)
- Continuous queries (1)
- Data Mining (1)
- Data models (1)
- Depression (1)
- Euclidean (1)
- Geometric characteristics (1)
- K selection problem (1)
- K-Means clustering (1)
- Machine learning (1)
- Marketing (1)
- Minkowski distance (1)
- Mobile users (1)
- Mobility patterns (1)
- Number of clusters (1)
- Optimal assignment (1)
- Predictive models (1)
- Quality metrics (1)
- Small-group (1)
- Social Media (1)
- Squared distances (1)
- Stress (1)
- Support Vector Machine (1)
- Training data (1)
- User location (1)
Articles 1 - 6 of 6
Full-Text Articles in Computer Engineering
Data Provenance Via Differential Auditing, Xin Mu, Ming Pang, Feida Zhu
Data Provenance Via Differential Auditing, Xin Mu, Ming Pang, Feida Zhu
Research Collection School Of Computing and Information Systems
With the rising awareness of data assets, data governance, which is to understand where data comes from, how it is collected, and how it is used, has been assuming evergrowing importance. One critical component of data governance gaining increasing attention is auditing machine learning models to determine if specific data has been used for training. Existing auditing techniques, like shadow auditing methods, have shown feasibility under specific conditions such as having access to label information and knowledge of training protocols. However, these conditions are often not met in most real-world applications. In this paper, we introduce a practical framework for …
A Quality Metric For K-Means Clustering Based On Centroid Locations, Manoj Thulasidas
A Quality Metric For K-Means Clustering Based On Centroid Locations, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
K-Means clustering algorithm does not offer a clear methodology to determine the appropriate number of clusters; it does not have a built-in mechanism for K selection. In this paper, we present a new metric for clustering quality and describe its use for K selection. The proposed metric, based on the locations of the centroids, as well as the desired properties of the clusters, is developed in two stages. In the initial stage, we take into account the full covariance matrix of the clustering variables, thereby making it mathematically similar to a reduced chi2. We then extend it to account for …
Stressmon: Scalable Detection Of Perceived Stress And Depression Using Passive Sensing Of Changes In Work Routines And Group Interactions, Nur Camellia Binte Zakaria, Rajesh Balan, Youngki Lee
Stressmon: Scalable Detection Of Perceived Stress And Depression Using Passive Sensing Of Changes In Work Routines And Group Interactions, Nur Camellia Binte Zakaria, Rajesh Balan, Youngki Lee
Research Collection School Of Computing and Information Systems
Stress and depression are a common affliction in all walks of life. When left unmanaged, stress can inhibit productivity or cause depression. Depression can occur independently of stress. There has been a sharp rise in mobile health initiatives to monitor stress and depression. However, these initiatives usually require users to install dedicated apps or multiple sensors, making such solutions hard to scale. Moreover, they emphasise sensing individual factors and overlook social interactions, which plays a significant role in influencing stress and depression while being a part of a social system. We present StressMon, a stress and depression detection system that …
Fixation And Confusion: Investigating Eye-Tracking Participants' Exposure To Information In Personas, Joni Salminen, Bernard J. Jansen, Jisun An, Soon-Gyo Jung, Lene Nielsen, Haewoon Kwak
Fixation And Confusion: Investigating Eye-Tracking Participants' Exposure To Information In Personas, Joni Salminen, Bernard J. Jansen, Jisun An, Soon-Gyo Jung, Lene Nielsen, Haewoon Kwak
Research Collection School Of Computing and Information Systems
To more effectively convey relevant information to end users of persona profiles, we conducted a user study consisting of 29 participants engaging with three persona layout treatments. We were interested in confusion engendered by the treatments on the participants, and conducted a within-subjects study in the actual work environment, using eye-tracking and talk-aloud data collection. We coded the verbal data into classes of informativeness and confusion and correlated it with fixations and durations on the Areas of Interests recorded by the eye-tracking device. We used various analysis techniques, including Mann-Whitney, regression, and Levenshtein distance, to investigate how confused users differed …
Using Support Vector Machine Ensembles For Target Audience Classification On Twitter, Siaw Ling Lo, Raymond Chiong, David Cornforth
Using Support Vector Machine Ensembles For Target Audience Classification On Twitter, Siaw Ling Lo, Raymond Chiong, David Cornforth
Research Collection School Of Computing and Information Systems
The vast amount and diversity of the content shared on social media can pose a challenge for any business wanting to use it to identify potential customers. In this paper, our aim is to investigate the use of both unsupervised and supervised learning methods for target audience classification on Twitter with minimal annotation efforts. Topic domains were automatically discovered from contents shared by followers of an account owner using Twitter Latent Dirichlet Allocation (LDA). A Support Vector Machine (SVM) ensemble was then trained using contents from different account owners of the various topic domains identified by Twitter LDA. Experimental results …
Continuous Spatial Assignment Of Moving Users, Hou U Leong, Kyriakos Mouratidis, Nikos Mamoulis
Continuous Spatial Assignment Of Moving Users, Hou U Leong, Kyriakos Mouratidis, Nikos Mamoulis
Research Collection School Of Computing and Information Systems
Consider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations are fixed), …