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

Databases and Information Systems Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 2011 - 2040 of 3441

Full-Text Articles in Databases and Information Systems

Tweet Sentiment: From Classification To Quantification, Wei Gao, Fabrizio Sebastiani Aug 2015

Tweet Sentiment: From Classification To Quantification, Wei Gao, Fabrizio Sebastiani

Research Collection School Of Computing and Information Systems

Sentiment classification has become a ubiquitous enabling technology in the Twittersphere, since classifying tweets according to the sentiment they convey towards a given entity (be it a product, a person, a political party, or a policy) has many applications in political science, social science, market research, and many others. In this paper we contend that most previous studies dealing with tweet sentiment classification (TSC) use a suboptimal approach. The reason is that the final goal of most such studies is not estimating the class label (e.g., Positive, Negative, or Neutral) of individual tweets, but estimating the relative frequency (a.k.a. "prevalence") …

Go to article

Gibberish, Assistant, Or Master? Using Tweets Linking To News For Extractive Single-Document Summarization, Zhongyu Wei, Wei Gao Aug 2015

Gibberish, Assistant, Or Master? Using Tweets Linking To News For Extractive Single-Document Summarization, Zhongyu Wei, Wei Gao

Research Collection School Of Computing and Information Systems

Single-document summarization is a challenging task. In this paper, we explore effective ways using the tweets linking to news for generating extractive summary of each document. We reveal the very basic value of tweets that can be utilized by regarding every tweet as a vote for candidate sentences. Base on such finding, we resort to unsupervised summarization models by leveraging the linking tweets to master the ranking of candidate extracts via random walk on a heterogeneous graph. The advantage is that we can use the linking tweets to opportunistically "supervise" the summarization with no need of reference summaries. Furthermore, we …

Go to article

Memes As Building Blocks: A Case Study On Evolutionary Optimization + Transfer Learning For Routing Problems, Liang Feng, Yew-Soon Ong, Ah-Hwee Tan, Ivor W. Tsang Aug 2015

Memes As Building Blocks: A Case Study On Evolutionary Optimization + Transfer Learning For Routing Problems, Liang Feng, Yew-Soon Ong, Ah-Hwee Tan, Ivor W. Tsang

Research Collection School Of Computing and Information Systems

A significantly under-explored area of evolutionary optimization in the literature is the study of optimization methodologies that can evolve along with the problems solved. Particularly, present evolutionary optimization approaches generally start their search from scratch or the ground-zero state of knowledge, independent of how similar the given new problem of interest is to those optimized previously. There has thus been the apparent lack of automated knowledge transfers and reuse across problems. Taking this cue, this paper presents a Memetic Computational Paradigm based on Evolutionary Optimization + Transfer Learning for search, one that models how human solves problems, and embarks on …

Go to article

Neural Modeling Of Sequential Inferences And Learning Over Episodic Memory, Budhitama Subagdja, Ah-Hwee Tan Aug 2015

Neural Modeling Of Sequential Inferences And Learning Over Episodic Memory, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Episodic memory is a significant part of cognition for reasoning and decision making. Retrieval in episodic memory depends on the order relationships of memory items which provides flexibility in reasoning and inferences regarding sequential relations for spatio-temporal domain. However, it is still unclear how they are encoded and how they differ from representations in other types of memory like semantic or procedural memory. This paper presents a neural model of sequential representation and inferences on episodic memory. It contrasts with the common views on sequential representation in neural networks that instead of maintaining transitions between events to represent sequences, they …

Go to article

Facilitating Image Search With A Scalable And Compact Semantic Mapping, Meng Wang, Weisheng Li, Dong Liu, Bingbing Ni, Jialie Shen, Shuicheng Yan Aug 2015

Facilitating Image Search With A Scalable And Compact Semantic Mapping, Meng Wang, Weisheng Li, Dong Liu, Bingbing Ni, Jialie Shen, Shuicheng Yan

Research Collection School Of Computing and Information Systems

This paper introduces a novel approach to facilitating image search based on a compact semantic embedding. A novel method is developed to explicitly map concepts and image contents into a unified latent semantic space for the representation of semantic concept prototypes. Then, a linear embedding matrix is learned that maps images into the semantic space, such that each image is closer to its relevant concept prototype than other prototypes. In our approach, the semantic concepts equated with query keywords and the images mapped into the vicinity of the prototype are retrieved by our scheme. In addition, a computationally efficient method …

Go to article

Fast Object Retrieval Using Direct Spatial Matching, Zhiyuan Zhong, Jianke Zhu, Steven C. H. Hoi Aug 2015

Fast Object Retrieval Using Direct Spatial Matching, Zhiyuan Zhong, Jianke Zhu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The conventional bag-of-visual-words (BoW) model is popular for the large-scale object retrieval system but suffers from the critical drawback of ignoring spatial information. RANSAC-based methods attempt to remedy this drawback, but often require traversing all the feature matches for each hypothesis, leading to the heavy computational cost which limits the number of gallery images to be verified for each online query. We propose an efficient direct spatial matching (DSM) approach to directly estimate the scale variation using region sizes, in which all feature matches voted for estimating geometric transformation. DSM is much faster than RANSAC-based methods and exhaustive enumeration approaches. …

Go to article

Fusing Heterogeneous Data For Alzheimer's Disease Classification, P. S. Pillai, Tze-Yun Leong Aug 2015

Fusing Heterogeneous Data For Alzheimer's Disease Classification, P. S. Pillai, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

In multi-view learning, multimodal representations of a real world object or situation are integrated to learn its overall picture. Feature sets from distinct data sources carry different, yet complementary, information which, if analysed together, usually yield better insights and more accurate results. Neuro-degenerative disorders such as dementia are characterized by changes in multiple biomarkers. This work combines the features from neuroimaging and cerebrospinal fluid studies to distinguish Alzheimer's disease patients from healthy subjects. We apply statistical data fusion techniques on 101 subjects from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database. We examine whether fusion of biomarkers helps to improve diagnostic …

Go to article

On Mining Lifestyles From User Trip Data, Meng-Fen Chiang, Ee-Peng Lim Aug 2015

On Mining Lifestyles From User Trip Data, Meng-Fen Chiang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Large cities today are facing major challenges in planning and policy formulation to keep their growth sustainable. In this paper, we aim to gain useful insights about people living in a city by developing novel models to mine user lifestyles represented by the users' activity centers. Two models, namely ACMM and ACHMM, have been developed to learn the activity centers of each user using a large dataset of bus and subway train trips performed by passengers in Singapore. We show that ACHMM and ACMM yield similar accuracies in location prediction task. We also propose methods to automatically predict "home", "work" …

Go to article

Event Detection: Exploiting Socio-Physical Interactions In Physical Spaces, Kasthuri Jayarajah, Archan Misra, Xiao-Wen Ruan, Ee-Peng Lim Aug 2015

Event Detection: Exploiting Socio-Physical Interactions In Physical Spaces, Kasthuri Jayarajah, Archan Misra, Xiao-Wen Ruan, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

This paper investigates how digital traces of people's movements and activities in the physical world (e.g., at college campuses and commutes) may be used to detect local, short-lived events in various urban spaces. Past work that use occupancy-related features can only identify high-intensity events (those that cause large-scale disruption in visit patterns). In this paper, we first show how longitudinal traces of the coordinated and group-based movement episodes obtained from individual-level movement data can be used to create a socio-physical network (with edges representing tie strengths among individuals based on their physical world movement & collocation behavior). We then investigate …

Go to article

Faitcrowd: Fine Grained Truth Discovery For Crowdsourced Data Aggregation, Fenglong Ma, Yaliang Li, Qi Li, Minghui Qiu, Jing Gao, Shi Zhi, Lu Su, Bo Zhao, Jiawei Han Aug 2015

Faitcrowd: Fine Grained Truth Discovery For Crowdsourced Data Aggregation, Fenglong Ma, Yaliang Li, Qi Li, Minghui Qiu, Jing Gao, Shi Zhi, Lu Su, Bo Zhao, Jiawei Han

Research Collection School Of Computing and Information Systems

In crowdsourced data aggregation task, there exist conflicts in the answers provided by large numbers of sources on the same set of questions. The most important challenge for this task is to estimate source reliability and select answers that are provided by high-quality sources. Existing work solves this problem by simultaneously estimating sources' reliability and inferring questions' true answers (i.e., the truths). However, these methods assume that a source has the same reliability degree on all the questions, but ignore the fact that sources' reliability may vary significantly among different topics. To capture various expertise levels on different topics, we …

Go to article

Topic Modeling With Document Relative Similarities, Jianguang Du, Jing Jiang, Dandan Song, Lejian Liao Jul 2015

Topic Modeling With Document Relative Similarities, Jianguang Du, Jing Jiang, Dandan Song, Lejian Liao

Research Collection School Of Computing and Information Systems

Topic modeling has been widely used in text mining. Previous topic models such as Latent Dirichlet Allocation (LDA) are successful in learning hidden topics but they do not take into account metadata of documents. To tackle this problem, many augmented topic models have been proposed to jointly model text and metadata. But most existing models handle only categorical and numerical types of metadata. We identify another type of metadata that can be more natural to obtain in some scenarios. These are relative similarities among documents. In this paper, we propose a general model that links LDA with constraints derived from …

Go to article

An Adaptive Computational Model For Personalized Persuasion, Yilin Kang, Ah-Hwee Tan, Chunyan Miao Jul 2015

An Adaptive Computational Model For Personalized Persuasion, Yilin Kang, Ah-Hwee Tan, Chunyan Miao

Research Collection School Of Computing and Information Systems

While a variety of persuasion agents have been created and applied in different domains such as marketing, military training and health industry, there is a lack of a model which can provide a unified framework for different persuasion strategies. Specifically, persuasion is not adaptable to the individuals’ personal states in different situations. Grounded in the Elaboration Likelihood Model (ELM), this paper presents a computational model called Model for Adaptive Persuasion (MAP) for virtual agents. MAP is a semi-connected network model which enables an agent to adapt its persuasion strategies through feedback. We have implemented and evaluated a MAP-based virtual nurse …

Go to article

Personalized Sentiment Classification Based On Latent Individuality Of Microblog Users, Kaisong Song, Shi Feng, Wei Gao, Daling Wang, Ge Yu, Kam-Fai Wong Jul 2015

Personalized Sentiment Classification Based On Latent Individuality Of Microblog Users, Kaisong Song, Shi Feng, Wei Gao, Daling Wang, Ge Yu, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Sentiment expression in microblog posts often reflects user’s specific individuality due to different language habit, personal character, opinion bias and so on. Existing sentiment classification algorithms largely ignore such latent personal distinctions among different microblog users. Meanwhile, sentiment data of microblogs are sparse for individual users, making it infeasible to learn effective personalized classifier. In this paper, we propose a novel, extensible personalized sentiment classification method based on a variant of latent factor model to capture personal sentiment variations by mapping users and posts into a low-dimensional factor space. We alleviate the sparsity of personal texts by decomposing the posts …

Go to article

Log-Euclidean Metric Learning On Symmetric Positive Definite Manifold With Application To Image Set Classification, Zhiwu Huang, R. Wang, S. Shan, X. Li, X. Chen Jul 2015

Log-Euclidean Metric Learning On Symmetric Positive Definite Manifold With Application To Image Set Classification, Zhiwu Huang, R. Wang, S. Shan, X. Li, X. Chen

Research Collection School Of Computing and Information Systems

The manifold of Symmetric Positive Definite (SPD) matrices has been successfully used for data representation in image set classification. By endowing the SPD manifold with Log-Euclidean Metric, existing methods typically work on vector-forms of SPD matrix logarithms. This however not only inevitably distorts the geometrical structure of the space of SPD matrix logarithms but also brings low efficiency especially when the dimensionality of SPD matrix is high. To overcome this limitation, we propose a novel metric learning approach to work directly on logarithms of SPD matrices. Specifically, our method aims to learn a tangent map that can directly transform the …

Go to article

Using Tweets To Help Sentence Compression For News Highlights Generation, Zhongyu Wei, Yang Liu, Chen Li, Wei Gao Jul 2015

Using Tweets To Help Sentence Compression For News Highlights Generation, Zhongyu Wei, Yang Liu, Chen Li, Wei Gao

Research Collection School Of Computing and Information Systems

We explore using relevant tweets of a given news article to help sentence compression for generating compressive news highlights. We extend an unsupervised dependency-tree based sentence compression approach by incorporating tweet information to weight the tree edge in terms of informativeness and syntactic importance. The experimental results on a public corpus that contains both news articles and relevant tweets show that our proposed tweets guided sentence compression method can improve the summarization performance significantly compared to the baseline generic sentence compression method.

Go to article

A Comparative Study Between Motivated Learning And Reinforcement Learning, James T. Graham, Janusz A. Starzyk, Zhen Ni, Haibo He, T.-H. Teng, Ah-Hwee Tan Jul 2015

A Comparative Study Between Motivated Learning And Reinforcement Learning, James T. Graham, Janusz A. Starzyk, Zhen Ni, Haibo He, T.-H. Teng, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper analyzes advanced reinforcement learning techniques and compares some of them to motivated learning. Motivated learning is briefly discussed indicating its relation to reinforcement learning. A black box scenario for comparative analysis of learning efficiency in autonomous agents is developed and described. This is used to analyze selected algorithms. Reported results demonstrate that in the selected category of problems, motivated learning outperformed all reinforcement learning algorithms we compared with.

Go to article

Structured Learning From Heterogeneous Behavior For Social Identity Linkage, Siyuan Liu, Shuhui Wang, Feida Zhu Jul 2015

Structured Learning From Heterogeneous Behavior For Social Identity Linkage, Siyuan Liu, Shuhui Wang, Feida Zhu

Research Collection School Of Computing and Information Systems

Social identity linkage across different social media platforms is of critical importance to business intelligence by gaining from social data a deeper understanding and more accurate profiling of users. In this paper, we propose a solution framework, HYDRA, which consists of three key steps: (I) we model heterogeneous behavior by long-term topical distribution analysis and multi-resolution temporal behavior matching against high noise and information missing, and the behavior similarity are described by multi-dimensional similarity vector for each user pair; (II) we build structure consistency models to maximize the structure and behavior consistency on users' core social structure across different platforms, …

Go to article

Fast Optimal Aggregate Point Search For A Merged Set On Road Networks, Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu, Weimo Liu, Yan Huang Jul 2015

Fast Optimal Aggregate Point Search For A Merged Set On Road Networks, Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu, Weimo Liu, Yan Huang

Research Collection School Of Computing and Information Systems

Aggregate nearest neighbor query, which returns an optimal target point that minimizes the aggregate distance for a given query point set, is one of the most important operations in spatial databases and their application domains. This paper addresses the problem of finding the aggregate nearest neighbor for a merged set that consists of the given query point set and multiple points needed to be selected from a candidate set, which we name as merged aggregate nearest neighbor(MANN) query. This paper proposes two algorithms to process MANN query on road networks when aggregate function is max. Then, we extend the algorithms …

Go to article

A Convolution Kernel Approach To Identifying Comparisons In Text, Maksim Tkachenko, Hady W. Lauw Jul 2015

A Convolution Kernel Approach To Identifying Comparisons In Text, Maksim Tkachenko, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Comparisons in text, such as in online reviews, serve as useful decision aids. In this paper, we focus on the task of identifying whether a comparison exists between a specific pair of entity mentions in a sentence. This formulation is transformative, as previous work only seeks to determine whether a sentence is comparative, which is presumptuous in the event the sentence mentions multiple entities and is comparing only some, not all, of them. Our approach leverages not only lexical features such as salient words, but also structural features expressing the relationships among words and entity mentions. To model these features …

Go to article

Online Learning To Rank For Content-Based Image Retrieval, Ji Wan, Pengcheng Wu, Steven C. H. Hoi, Peilin Zhao, Xingyu Gao, Dayong Wang, Yongdong. Zhang, Jintao Li Jul 2015

Online Learning To Rank For Content-Based Image Retrieval, Ji Wan, Pengcheng Wu, Steven C. H. Hoi, Peilin Zhao, Xingyu Gao, Dayong Wang, Yongdong. Zhang, Jintao Li

Research Collection School Of Computing and Information Systems

A major challenge in Content-Based Image Retrieval (CBIR) is to bridge the semantic gap between low-level image contents and high-level semantic concepts. Although researchers have investigated a variety of retrieval techniques using different types of features and distance functions, no single best retrieval solution can fully tackle this challenge. In a real-world CBIR task, it is often highly desired to combine multiple types of different feature representations and diverse distance measures in order to close the semantic gap. In this paper, we investigate a new framework of learning to rank for CBIR, which aims to seek the optimal combination of …

Go to article

Solar: Scalable Online Learning Algorithms For Ranking, Jialei Wang, Ji Wan, Yongdong Zhang, Steven C. H. Hoi Jul 2015

Solar: Scalable Online Learning Algorithms For Ranking, Jialei Wang, Ji Wan, Yongdong Zhang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Traditional learning to rank methods learn ranking models from training data in a batch and offline learning mode, which suffers from some critical limitations, e.g., poor scalability as the model has to be retrained from scratch whenever new training data arrives. This is clearly nonscalable for many real applications in practice where training data often arrives sequentially and frequently. To overcome the limitations, this paper presents SOLAR- a new framework of Scalable Online Learning Algorithms for Ranking, to tackle the challenge of scalable learning to rank. Specifically, we propose two novel SOLAR algorithms and analyze their IR measure bounds theoretically. …

Go to article

A Hassle-Free Unsupervised Domain Adaptation Method Using Instance Similarity Features, Jianfei Yu, Jing Jiang Jul 2015

A Hassle-Free Unsupervised Domain Adaptation Method Using Instance Similarity Features, Jianfei Yu, Jing Jiang

Research Collection School Of Computing and Information Systems

We present a simple yet effective unsupervised domain adaptation method that can be generally applied for different NLP tasks. Our method uses unlabeled target domain instances to induce a set of instance similarity features. These features are then combined with the original features to represent labeled source domain instances. Using three NLP tasks, we show that our method consistently out-performs a few baselines, including SCL, an existing general unsupervised domain adaptation method widely used in NLP. More importantly, our method is very easy to implement and incurs much less computational cost than SCL.

Go to article

Landmark Classification With Hierarchical Multi-Modal Exemplar Feature, Lei Zhu, Jialie Shen, Hai Jin, Liang Xie, Ran Zheng Jul 2015

Landmark Classification With Hierarchical Multi-Modal Exemplar Feature, Lei Zhu, Jialie Shen, Hai Jin, Liang Xie, Ran Zheng

Research Collection School Of Computing and Information Systems

Landmark image classification attracts increasing research attention due to its great importance in real applications, ranging from travel guide recommendation to 3-D modelling and visualization of geolocation. While large amount of efforts have been invested, it still remains unsolved by academia and industry. One of the key reasons is the large intra-class variance rooted from the diverse visual appearance of landmark images. Distinguished from most existing methods based on scalable image search, we approach the problem from a new perspective and model landmark classification as multi-modal categorization, which enjoys advantages of low storage overhead and high classification efficiency. Toward this …

Go to article

Qcri: Answer Selection For Community Question Answering - Experiment For Arabic And English, Massimo Nicosia, Simone Filice, Alberto Barron-Cedeno, Iman Saleh, Hamdy Mubarak, Wei Gao, Preslav Nakov, Giovanni Da San Martino, Alessandro Moschitti, Kareem Darwish, Lluis Marquz Marquz, Shafiq Joty, Walid Magdy Magdy Jun 2015

Qcri: Answer Selection For Community Question Answering - Experiment For Arabic And English, Massimo Nicosia, Simone Filice, Alberto Barron-Cedeno, Iman Saleh, Hamdy Mubarak, Wei Gao, Preslav Nakov, Giovanni Da San Martino, Alessandro Moschitti, Kareem Darwish, Lluis Marquz Marquz, Shafiq Joty, Walid Magdy Magdy

Research Collection School Of Computing and Information Systems

This paper describes QCRI’s participation in SemEval-2015 Task 3 “Answer Selection in Community Question Answering”, which targeted real-life Web forums, and was offered in both Arabic and English. We apply a supervised machine learning approach considering a manifold of features including among others word n-grams, text similarity, sentiment analysis, the presence of specific words, and the context of a comment. Our approach was the best performing one in the Arabic subtask and the third best in the two English subtasks

Go to article

Online Multimodal Co-Indexing And Retrieval Of Weakly Labeled Web Image Collections, Lei Meng, Ah-Hwee Tan, Cyril Leung, Liqiang Nie, Tan-Seng Chua, Chunyan Miao Jun 2015

Online Multimodal Co-Indexing And Retrieval Of Weakly Labeled Web Image Collections, Lei Meng, Ah-Hwee Tan, Cyril Leung, Liqiang Nie, Tan-Seng Chua, Chunyan Miao

Research Collection School Of Computing and Information Systems

Weak supervisory information of web images, such as captions, tags, and descriptions, make it possible to better understand images at the semantic level. In this paper, we propose a novel online multimodal co-indexing algorithm based on Adaptive Resonance Theory, named OMC-ART, for the automatic co-indexing and retrieval of images using their multimodal information. Compared with existing studies, OMC-ART has several distinct characteristics. First, OMCART is able to perform online learning of sequential data. Second, OMC-ART builds a two-layer indexing structure, in which the first layer co-indexes the images by the key visual and textual features based on the generalized distributions …

Go to article

Face Video Retrieval With Image Query Via Hashing Across Euclidean Space And Riemannian Manifold, Y. Li, R. Wang, Zhiwu Huang, S. Shan, X. Chen Jun 2015

Face Video Retrieval With Image Query Via Hashing Across Euclidean Space And Riemannian Manifold, Y. Li, R. Wang, Zhiwu Huang, S. Shan, X. Chen

Research Collection School Of Computing and Information Systems

Retrieving videos of a specific person given his/her face image as query becomes more and more appealing for applications like smart movie fast-forwards and suspect searching. It also forms an interesting but challenging computer vision task, as the visual data to match, i.e., still image and video clip are usually represented quite differently. Typically, face image is represented as point (i.e., vector) in Euclidean space, while video clip is seemingly modeled as a point (e.g., covariance matrix) on some particular Riemannian manifold in the light of its recent promising success. It thus incurs a new hashing-based retrieval problem of matching …

Go to article

Semi-Supervised Domain Adaptation With Subspace Learning For Visual Recognition, Ting Yao, Yingwei Pan, Chong-Wah Ngo, Houqiang Li, Tao Mei Jun 2015

Semi-Supervised Domain Adaptation With Subspace Learning For Visual Recognition, Ting Yao, Yingwei Pan, Chong-Wah Ngo, Houqiang Li, Tao Mei

Research Collection School Of Computing and Information Systems

In many real-world applications, we are often facing the problem of cross domain learning, i.e., to borrow the labeled data or transfer the already learnt knowledge from a source domain to a target domain. However, simply applying existing source data or knowledge may even hurt the performance, especially when the data distribution in the source and target domain is quite different, or there are very few labeled data available in the target domain. This paper proposes a novel domain adaptation framework, named Semi-supervised Domain Adaptation with Subspace Learning (SDASL), which jointly explores invariant lowdimensional structures across domains to correct data …

Go to article

Multimodal Learning With Deep Boltzmann Machine For Emotion Prediction In User Generated Videos, Lei Pang, Chong-Wah Ngo Jun 2015

Multimodal Learning With Deep Boltzmann Machine For Emotion Prediction In User Generated Videos, Lei Pang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Detecting emotions from user-generated videos, such as“anger” and “sadness”, has attracted widespread interest recently. The problem is challenging as effectively representing video data with multi-view information (e.g., audio, video or text) is not trivial. In contrast to the existing works that extract features from each modality (view) separately followed by early or late fusion, we propose to learn a joint density model over the space of multi-modal inputs (including visual, auditory and textual modalities) with Deep Boltzmann Machine (DBM). The model is trained directly on the user-generated Web videos without any labeling effort. More importantly, the deep architecture enlightens the …

Go to article

Method For Matching Probabilistic Encrypted Data, Hwee Hwa Pang, Xuhua Ding Jun 2015

Method For Matching Probabilistic Encrypted Data, Hwee Hwa Pang, Xuhua Ding

Research Collection School Of Computing and Information Systems

Determining if a first encrypted data of a first data value is equal to a second encrypted data of a second data value. Comprising: a first cyclic group; a second cyclic group including a first element. Applying an operation to the first cyclic group to map its elements to an element in the second cyclic group. Randomly selecting a second element from the first cyclic group; producing the first encrypted data by mapping the second element and the first data value into one or more elements of the first cyclic group. Randomly selecting a third element from the first cyclic …

Go to article

Projection Metric Learning On Grassmann Manifold With Application To Video Based Face Recognition, Zhiwu Huang, R. Wang, S. Shan, X. Chen Jun 2015

Projection Metric Learning On Grassmann Manifold With Application To Video Based Face Recognition, Zhiwu Huang, R. Wang, S. Shan, X. Chen

Research Collection School Of Computing and Information Systems

In video based face recognition, great success has been made by representing videos as linear subspaces, which typically lie in a special type of non-Euclidean space known as Grassmann manifold. To leverage the kernel-based methods developed for Euclidean space, several recent methods have been proposed to embed the Grassmann manifold into a high dimensional Hilbert space by exploiting the well established Project Metric, which can approximate the Riemannian geometry of Grassmann manifold. Nevertheless, they inevitably introduce the drawbacks from traditional kernel-based methods such as implicit map and high computational cost to the Grassmann manifold. To overcome such limitations, we propose …

Go to article

First Prev Next Last