Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Basket-Oriented Association (1)
- Basket-Sensitive Recommendation (1)
- Categorical data representation (1)
- Categorization (1)
- Causal inference (1)
-
- Clustering (1)
- Contract theory (1)
- Correlative Association (1)
- Coupling learning (1)
- Data commercialization (1)
- Decision bias (1)
- Deep Hashing (1)
- Empirical research (1)
- Encrypted email system (1)
- Environmental policy (1)
- Geospatial policy analytics (1)
- HHW grants (1)
- Hard Examples (1)
- Hinge Loss (1)
- Household hazardous waste (HHW) (1)
- Identity based encryption (1)
- Image Retrieval (1)
- Image and Video Synthesis (1)
- Inside keyword guessing attacks (1)
- Item-Item Association (1)
- Just-in-Time Defect Prediction (1)
- Mining Software Repositories (1)
- Modeling robustness (1)
- Noisy Data (1)
- Non-IID learning (1)
- Publication
- Publication Type
Articles 1 - 10 of 10
Full-Text Articles in Engineering
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, …
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 …
Do Grant Funding And Pro-Environmental Spillovers Influence Household Hazardous Waste Collection?, Kustini Lim-Wavde, Robert J Kauffman, Tin Seong Kam, Gregory S. Dawsond
Do Grant Funding And Pro-Environmental Spillovers Influence Household Hazardous Waste Collection?, Kustini Lim-Wavde, Robert J Kauffman, Tin Seong Kam, Gregory S. Dawsond
Research Collection School Of Computing and Information Systems
Agency and state grant funding should be disseminated in ways so it will result in better management of household hazardous waste (HHW) and environmental sustainability. Since location seems to matter in HHW collection activities, it is important to consider pro-environmental spatial spillovers that occur, based on agency actions and waste collection behavior taking place in other locations. These may influence HHW-related practices in close-by regions. Using a county-level spatio-temporal dataset that consists of economic, demographic, and HHW data in California from 2004 to 2015, we evaluate the impact of HHW grants on HHW collection activities while considering pro-environmental spillovers. We …
The Impact Of Changes Mislabeled By Szz On Just-In-Time Defect Prediction, Yuanrui Fan, Xin Xia, Daniel A. Costa, David Lo, Ahmed E. Hassan, Shanping Li
The Impact Of Changes Mislabeled By Szz On Just-In-Time Defect Prediction, Yuanrui Fan, Xin Xia, Daniel A. Costa, David Lo, Ahmed E. Hassan, Shanping Li
Research Collection School Of Computing and Information Systems
Just-in-Time (JIT) defect prediction—a technique which aims to predict bugs at change level—has been paid more attention. JIT defect prediction leverages the SZZ approach to identify bug-introducing changes. Recently, researchers found that the performance of SZZ (including its variants) is impacted by a large amount of noise. SZZ may considerably mislabel changes that are used to train a JIT defect prediction model, and thus impact the prediction accuracy. In this paper, we investigate the impact of the mislabeled changes by different SZZ variants on the performance and interpretation of JIT defect prediction models. We analyze four SZZ variants (i.e., B-SZZ, …
R2gan: Cross-Modal Recipe Retrieval With Generative Adversarial Network, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Yanbin Hao
R2gan: Cross-Modal Recipe Retrieval With Generative Adversarial Network, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Yanbin Hao
Research Collection School Of Computing and Information Systems
Representing procedure text such as recipe for crossmodal retrieval is inherently a difficult problem, not mentioning to generate image from recipe for visualization. This paper studies a new version of GAN, named Recipe Retrieval Generative Adversarial Network (R2GAN), to explore the feasibility of generating image from procedure text for retrieval problem. The motivation of using GAN is twofold: learning compatible cross-modal features in an adversarial way, and explanation of search results by showing the images generated from recipes. The novelty of R2GAN comes from architecture design, specifically a GAN with one generator and dual discriminators is used, which makes the …
Adversarial Contract Design For Private Data Commercialization, Parinaz Naghizadeh, Arunesh Sinha
Adversarial Contract Design For Private Data Commercialization, Parinaz Naghizadeh, Arunesh Sinha
Research Collection School Of Computing and Information Systems
The proliferation of data collection and machine learning techniques has created an opportunity for commercialization of private data by data aggregators. In this paper, we study this data monetization problem as a mechanism design problem, specifically using a contract-theoretic approach. Our proposed adversarial contract design framework provides a fundamental extension to the classic contract theory set-up in order to account for the heterogeneity in honest buyers’ demands for data, as well as the presence of adversarial buyers who may purchase data to compromise its privacy. We propose the notion of Price of Adversary (PoAdv) to quantify the effects of adversarial …
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 …
Designated-Server Identity-Based Authenticated Encryption With Keyword Search For Encrypted Emails, Hongbo Li, Qiong Huang, Jian Shen, Guomin Yang, Willy Susilo
Designated-Server Identity-Based Authenticated Encryption With Keyword Search For Encrypted Emails, Hongbo Li, Qiong Huang, Jian Shen, Guomin Yang, Willy Susilo
Research Collection School Of Computing and Information Systems
In encrypted email system, how to search over encrypted cloud emails without decryption is an important and practical problem. Public key encryption with keyword search (PEKS) is an efficient solution to it. However, PEKS suffers from the complex key management problem in the public key infrastructure. Its variant in the identity-based setting addresses the drawback, however, almost all the schemes does not resist against offline keyword guessing attacks (KGA) by inside adversaries. In this work we introduce the notion of designated-server identity-based authenticated encryption with keyword search (dIBAEKS), in which the email sender authenticates the message while encrypting so that …
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 …
Vireo @ Video Browser Showdown 2019, Phuong Anh Nguyen, Chong-Wah Ngo, Danny Francis, Benoit Huet
Vireo @ Video Browser Showdown 2019, Phuong Anh Nguyen, Chong-Wah Ngo, Danny Francis, Benoit Huet
Research Collection School Of Computing and Information Systems
In this paper, the VIREO team video retrieval tool is described in details. As learned from Video Browser Showdown (VBS) 2018, the visualization of video frames is a critical need to improve the browsing effectiveness. Based on this observation, a hierarchical structure that represents the video frame clusters has been built automatically using k-means and self-organizing-map and used for visualization. Also, the relevance feedback module which relies on real-time supportvector-machine classification becomes unfeasible with the large dataset provided in VBS 2019 and has been replaced by a browsing module with pre-calculated nearest neighbors. The preliminary user study results on IACC.3 …