Open Access. Powered by Scholars. Published by Universities.®
Numerical Analysis and Scientific Computing Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (671)
- University of Dayton (31)
- Central Bank of Nigeria (20)
- University of Arkansas, Fayetteville (7)
- University of Nebraska - Lincoln (6)
-
- LSU New Orleans (4)
- California Polytechnic State University, San Luis Obispo (3)
- City University of New York (CUNY) (3)
- Montclair State University (3)
- Purdue University (3)
- San Jose State University (3)
- Technological University Dublin (3)
- Bryant University (2)
- Chapman University (2)
- Clemson University (2)
- East Tennessee State University (2)
- Embry-Riddle Aeronautical University (2)
- Georgia Southern University (2)
- Old Dominion University (2)
- Portland State University (2)
- Southern Methodist University (2)
- The University of Akron (2)
- University of Kentucky (2)
- University of Nevada, Las Vegas (2)
- California State University, San Bernardino (1)
- Claremont Colleges (1)
- Columbus State University (1)
- DePaul University (1)
- Eastern Washington University (1)
- Fort Hays State University (1)
- Keyword
-
- Data mining (25)
- Social media (20)
- Query processing (19)
- Classification (17)
- Online learning (16)
-
- Twitter (15)
- Machine learning (13)
- Algorithms (12)
- Machine Learning (12)
- Neural networks (11)
- Algorithm (10)
- Natural language processing (10)
- Sentiment analysis (9)
- Artificial intelligence (8)
- Deep Learning (8)
- Spatial databases (8)
- Data structures (7)
- Database (7)
- Location-based services (7)
- Recommender systems (7)
- Spatial database (7)
- Text mining (7)
- Data models (6)
- Deep learning (6)
- Feature extraction (6)
- Information retrieval (6)
- Online Learning (6)
- Road network (6)
- Semantics (6)
- Social network (6)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (661)
- Computer Science Faculty Publications (33)
- CBN Journal of Applied Statistics (JAS) (20)
- Dissertations and Theses Collection (Open Access) (6)
- Graduate Theses and Dissertations (5)
-
- LSU New Orleans Theses and Dissertations (4)
- Theses and Dissertations (4)
- Department of Computer Science Faculty Scholarship and Creative Works (3)
- All Dissertations (2)
- College of Graduate Studies: Theses & Dissertations (2)
- Department of Agricultural and Biological Systems Engineering: Dissertations, Theses, and Student Research (2)
- Electronic Theses and Dissertations (2)
- Honors Projects in Information Systems and Analytics (2)
- Research Collection Lee Kong Chian School Of Business (2)
- SMU Data Science Review (2)
- STAR Program Research Presentations (2)
- SWITCH (2)
- School of Computing: Dissertations, Theses, and Student Research (2)
- The Summer Undergraduate Research Fellowship (SURF) Symposium (2)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (2)
- Williams Honors College, Honors Research Projects (2)
- Asian Management Insights (1)
- Bulletin of TUIT: Management and Communication Technologies (1)
- CMC Senior Theses (1)
- College of Computing and Digital Media Dissertations (1)
- Computer Science and Computer Engineering Faculty Publications and Presentations (1)
- Computer Science and Computer Engineering Undergraduate Honors Theses (1)
- Computer Science and Software Engineering (1)
- Conference papers (1)
- Department of Computer Science Publications (1)
- Publication Type
Articles 241 - 270 of 809
Full-Text Articles in Numerical Analysis and Scientific Computing
Finding All Nearest Neighbors With A Single Graph Traversal, Yixin Xu, Qi Jianzhong, Borovica‐Gajic Renata, Kulik Lars
Finding All Nearest Neighbors With A Single Graph Traversal, Yixin Xu, Qi Jianzhong, Borovica‐Gajic Renata, Kulik Lars
Research Collection School Of Computing and Information Systems
Finding the nearest neighbor is a key operation in data analysis and mining. An important variant of nearest neighbor query is the all nearest neighbor (ANN) query, which reports all nearest neighbors for a given set of query objects. Existing studies on ANN queries have focused on Euclidean space. Given the widespread occurrence of spatial networks in urban environments, we study the ANN query in spatial network settings. An example of an ANN query on spatial networks is finding the nearest car parks for all cars currently on the road. We propose VIVET, an index-based algorithm to efficiently process ANN …
Discovering Hidden Topical Hubs And Authorities In Online Social Networks, Roy Ka-Wei Lee, Tuan-Anh Hoang, Ee-Peng Lim
Discovering Hidden Topical Hubs And Authorities In Online Social Networks, Roy Ka-Wei Lee, Tuan-Anh Hoang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Finding influential users in online social networks is an important problem with many possible useful applications. HITS and other link analysis methods, in particular, have been often used to identify hub and authority users in web graphs and online social networks. These works, however, have not considered topical aspect of links in their analysis. A straightforward approach to overcome this limitation is to first apply topic models to learn the user topics before applying the HITS algorithm. In this paper, we instead propose a novel topic model known as Hub and Authority Topic (HAT) model to combines the two process …
Feature Detection In Medical Images Using Deep Learning, Anthony Pasquarelli
Feature Detection In Medical Images Using Deep Learning, Anthony Pasquarelli
Honors Projects in Information Systems and Analytics
This project explores the use of deep learning to predict age based on pediatric hand X-Rays. Data from the Radiological Society of North America’s pediatric bone age challenge were used to train and evaluate a convolutional neural network. The project used InceptionV3, a CNN developed by Google, that was pre-trained on ImageNet, a popular online image dataset. Our fine-tuned version of InceptionV3 yielded an average error of less than 10 months between predicted and actual age. This project shows the effectiveness of deep learning in analyzing medical images and the potential for even greater improvements in the future. In addition …
Octopus: An Online Topic-Aware Influence Analysis System For Social Networks, Ju Fan, Jiarong Qiu, Yuchen Li, Qingfei Meng, Dongxiang Zhang, Guoliang Li, Kian-Lee Tan, Xiaoyong Du
Octopus: An Online Topic-Aware Influence Analysis System For Social Networks, Ju Fan, Jiarong Qiu, Yuchen Li, Qingfei Meng, Dongxiang Zhang, Guoliang Li, Kian-Lee Tan, Xiaoyong Du
Research Collection School Of Computing and Information Systems
The wide adoption of social networks has brought a new demand on influence analysis. This paper presents OCTOPUS that offers social network users and analysts valuable insights through topic-aware social influence analysis services. OCTOPUS has the following novel features. First, OCTOPUS provides a user-friendly interface that allows users to employ simple and easy-to-use keywords to perform influence analysis. Second, OCTOPUS provides three powerful keyword-based topic-aware influence analysis tools: keyword-based influential user discovery, personalized influential keywords suggestion, and interactive influential paths exploration. These tools can not only discover influential users, but also provide insights on how the users influence the network. …
Exploiting User And Venue Characteristics For Fine-Grained Tweet Geolocation, Wen Haw Chong, Ee Peng Lim
Exploiting User And Venue Characteristics For Fine-Grained Tweet Geolocation, Wen Haw Chong, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Which venue is a tweet posted from? We call this a fine-grained geolocation problem. Given an observed tweet, the task is to infer its discrete posting venue, e.g., a specific restaurant. This recovers the venue context and differs from prior work, which geolocats tweets to location coordinates or cities/neighborhoods. First, we conduct empirical analysis to uncover venue and user characteristics for improving geolocation. For venues, we observe spatial homophily, in which venues near each other have more similar tweet content (i.e., text representations) compared to venues further apart. For users, we observe that they are spatially focused and more likely …
A Data-Driven Analysis Of Workers' Earnings On Amazon Mechanical Turk, Kotaro Hara, Abigail Adams, Kristy Milland, Saiph Savage, Chris Callison-Burch, Jeffrey P. Bigham
A Data-Driven Analysis Of Workers' Earnings On Amazon Mechanical Turk, Kotaro Hara, Abigail Adams, Kristy Milland, Saiph Savage, Chris Callison-Burch, Jeffrey P. Bigham
Research Collection School Of Computing and Information Systems
A growing number of people are working as part of on-line crowd work. Crowd work is often thought to be low wage work. However, we know little about the wage distribution in practice and what causes low/high earnings in this setting. We recorded 2,676 workers performing 3.8 million tasks on Amazon Mechanical Turk. Our task-level analysis revealed that workers earned a median hourly wage of only ~$2/h, and only 4% earned more than $7.25/h. While the average requester pays more than $11/h, lower-paying requesters post much more work. Our wage calculations are influenced by how unpaid work is accounted for, …
Social Network Monitoring For Bursty Cascade Detection, Wei Xie, Feida Zhu, Jing Xiao, Jianzong Wang
Social Network Monitoring For Bursty Cascade Detection, Wei Xie, Feida Zhu, Jing Xiao, Jianzong Wang
Research Collection School Of Computing and Information Systems
Social network services have become important and efficient platforms for users to share all kinds of information. The capability to monitor user-generated information and detect bursts from information diffusions in these social networks brings value to a wide range of real-life applications, such as viral marketing. However, in reality, as a third party, there is always a cost for gathering information from each user or so-called social network sensor. The question then arises how to select a budgeted set of social network sensors to form the data stream for burst detection without compromising the detection performance. In this article, we …
A Novel Representation And Compression For Queries On Trajectories In Road Networks, Xiaochun Yang, Bin Wang, Kai Yang, Chengfei Liu, Baihua Zheng
A Novel Representation And Compression For Queries On Trajectories In Road Networks, Xiaochun Yang, Bin Wang, Kai Yang, Chengfei Liu, Baihua Zheng
Research Collection School Of Computing and Information Systems
Recording and querying time-stamped trajectories incurs high cost of data storage and computing. In this paper, we explore several characteristics of the trajectories in road mbox{networks}, which have motivated the idea of coding trajectories by associating timestamps with relative spatial path and locations. Such a representation contains large number of duplicate information to achieve a lower entropy compared with the existing representations, thereby drastically cutting the storage cost. We propose several techniques to compress spatial path and locations separately, which can support fast positioning and achieve better compression ratio. For locations, we propose two novel encoding schemes such that the …
The Role Of Urban Mobility In Retail Business Survival, Krittika D'Silva, Kasthuri Jayarajah, Anastasios Noulas, Cecilia Mascolo, Archan Misra
The Role Of Urban Mobility In Retail Business Survival, Krittika D'Silva, Kasthuri Jayarajah, Anastasios Noulas, Cecilia Mascolo, Archan Misra
Research Collection School Of Computing and Information Systems
Economic and urban planning agencies have strong interest in tackling the hard problem of predicting the odds of survival of individual retail businesses. In this work, we tap urban mobility data available both from a location-based intelligence platform, Foursquare, and from public transportation agencies, and investigate whether mobility-derived features can help foretell the failure of such retail businesses, over a 6 month horizon, across 10 distinct cities spanning the globe. We hypothesise that the survival of such a retail outlet is correlated with not only venue-specific characteristics but also broader neighbourhood-level effects. Through careful statistical analysis of Foursquare and taxi …
A Sliding-Window Framework For Representative Subset Selection, Yanhao Wang, Yuchen Li, Kian-Lee Tan
A Sliding-Window Framework For Representative Subset Selection, Yanhao Wang, Yuchen Li, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Representative subset selection (RSS) is an important tool for users to draw insights from massive datasets. A common approach is to model RSS as the submodular maximization problem because the utility of extracted representatives often satisfies the "diminishing returns" property. To capture the data recency issue and support different types of constraints in real-world problems, we formulate RSS as maximizing a submodular function subject to a d-knapsack constraint (SMDK) over sliding windows. Then, we propose a novel KnapWindow framework for SMDK. Theoretically, KnapWindow is 1-ε/1+d - approximate for SMDK and achieves sublinear complexity. Finally, we evaluate the efficiency and effectiveness …
Does Journaling Encourage Healthier Choices? Analyzing Healthy Eating Behaviors Of Food Journalers, Palakorn Achananuparp, Ee Peng Lim, Vibhanshu Abhishek
Does Journaling Encourage Healthier Choices? Analyzing Healthy Eating Behaviors Of Food Journalers, Palakorn Achananuparp, Ee Peng Lim, Vibhanshu Abhishek
Research Collection School Of Computing and Information Systems
Past research has shown the benefits of food journaling in promoting mindful eating and healthier food choices. However, the links between journaling and healthy eating have not been thoroughly examined. Beyond caloric restriction, do journalers consistently and sufficiently consume healthful diets? How different are their eating habits compared to those of average consumers who tend to be less conscious about health? In this study, we analyze the healthy eating behaviors of active food journalers using data from MyFitnessPal. Surprisingly, our findings show that food journalers do not eat as healthily as they should despite their proclivity to health eating and …
Domain-Specific Cross-Language Relevant Question Retrieval, Bowen Xu, Zhenchang Xing, Xin Xia, David Lo, Shanping Li
Domain-Specific Cross-Language Relevant Question Retrieval, Bowen Xu, Zhenchang Xing, Xin Xia, David Lo, Shanping Li
Research Collection School Of Computing and Information Systems
Chinese developers often cannot effectively search questions in English, because they may have difficulties in translating technical words from Chinese to English and formulating proper English queries. For the purpose of helping Chinese developers take advantage of the rich knowledge base of Stack Overflow and simplify the question retrieval process, we propose an automated cross-language relevant question retrieval (CLRQR) system to retrieve relevant English questions for a given Chinese question. CLRQR first extracts essential information (both Chinese and English) from the title and description of the input Chinese question, then performs domain-specific translation of the essential Chinese information into English, …
Mining Sandboxes: Are We There Yet?, Lingfeng Bao, Tien Duy B. Le, David Lo
Mining Sandboxes: Are We There Yet?, Lingfeng Bao, Tien Duy B. Le, David Lo
Research Collection School Of Computing and Information Systems
The popularity of Android platform on mobile devices has attracted much attention from many developers and researchers, as well as malware writers. Recently, Jamrozik et al. proposed a technique to secure Android applications referred to as mining sandboxes. They used an automated test case generation technique to explore the behavior of the app under test and then extracted a set of sensitive APIs that were called. Based on the extracted sensitive APIs, they built a sandbox that can block access to APIs not used during testing. However, they only evaluated the proposed technique with benign apps but not investigated whether …
Compressive Representation For Device-Free Activity Recognition With Passive Rfid Signal Strength, Lina Yao, Quan Z. Sheng, Xue Li, Tao Gu, Mingkui Tan, Xianzhi Wang, Sen Wang, Wenjie Ruan
Compressive Representation For Device-Free Activity Recognition With Passive Rfid Signal Strength, Lina Yao, Quan Z. Sheng, Xue Li, Tao Gu, Mingkui Tan, Xianzhi Wang, Sen Wang, Wenjie Ruan
Research Collection School Of Computing and Information Systems
Understanding and recognizing human activities is a fundamental research topic for a wide range of important applications such as fall detection and remote health monitoring and intervention. Despite active research in human activity recognition over the past years, existing approaches based on computer vision or wearable sensor technologies present several significant issues such as privacy (e.g., using video camera to monitor the elderly at home) and practicality (e.g., not possible for an older person with dementia to remember wearing devices). In this paper, we present a low-cost, unobtrusive, and robust system that supports independent living of older people. The system …
Sparse Passive-Aggressive Learning For Bounded Online Kernel Methods, Jing Lu, Doyen Sahoo, Peilin Zhao, Steven C. H. Hoi
Sparse Passive-Aggressive Learning For Bounded Online Kernel Methods, Jing Lu, Doyen Sahoo, Peilin Zhao, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
One critical deficiency of traditional online kernel learning methods is their unbounded and growing number of support vectors in the online learning process, making them inefficient and non-scalable for large-scale applications. Recent studies on scalable online kernel learning have attempted to overcome this shortcoming, e.g., by imposing a constant budget on the number of support vectors. Although they attempt to bound the number of support vectors at each online learning iteration, most of them fail to bound the number of support vectors for the final output hypothesis, which is often obtained by averaging the series of hypotheses over all the …
Unified Locally Linear Classifiers With Diversity-Promoting Anchor Points, Chenghao Liu, Teng Zhang, Peilin Zhao, Jianling Sun, Steven C. H. Hoi
Unified Locally Linear Classifiers With Diversity-Promoting Anchor Points, Chenghao Liu, Teng Zhang, Peilin Zhao, Jianling Sun, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Locally Linear Support Vector Machine (LLSVM) has been actively used in classification tasks due to its capability of classifying nonlinear patterns. However, existing LLSVM suffers from two drawbacks: (1) a particular and appropriate regularization for LLSVM has not yet been addressed; (2) it usually adopts a three-stage learning scheme composed of learning anchor points by clustering, learning local coding coordinates by a predefined coding scheme, and finally learning for training classifiers. We argue that this decoupled approaches oversimplifies the original optimization problem, resulting in a large deviation due to the disparate purpose of each step. To address the first issue, …
Collaboration Patterns In Software Developer Network, Didi Surian, Ee-Peng Lim, David Lo
Collaboration Patterns In Software Developer Network, Didi Surian, Ee-Peng Lim, David Lo
Research Collection School Of Computing and Information Systems
In this entry, we mine collaboration patterns from a large software developer network (Surian et al. 2010). We consider high- and low-level patterns. High-level patterns correspond to various network-level statistics that we observe to hold in this network. Low-level patterns are topological subgraph patterns that are frequently observed among developers collaborating in the network. Mining topological subgraph patterns are difficult as it is an NP-hard problem. To address this issue, we use a combination of frequent subgraph mining and graph matching by leveraging the power law property exhibited by a large collaboration graph. The technique is applicable to any software …
Developing A Cyberterrorism Policy: Incorporating Individual Values, Osama Bassam J. Rabie
Developing A Cyberterrorism Policy: Incorporating Individual Values, Osama Bassam J. Rabie
Theses and Dissertations
Preventing cyberterrorism is becoming a necessity for individuals, organizations, and governments. However, current policies focus on technical and managerial aspects without asking for experts and non-experts values and preferences for preventing cyberterrorism. This study employs value focused thinking and public value forum to bare strategic measures and alternatives for complex policy decisions for preventing cyberterrorism. The strategic measures and alternatives are per socio-technical process.
Evaluating A Cluster Of Low-Power Arm64 Single-Board Computers With Mapreduce, Daniel Mcdermott
Evaluating A Cluster Of Low-Power Arm64 Single-Board Computers With Mapreduce, Daniel Mcdermott
EWU Masters Thesis Collection
With the meteoric rise of enormous data collection in science, industry, and the cloud, methods for processing massive datasets have become more crucial than ever. MapReduce is a restricted programing model for expressing parallel computations as simple serial functions, and an execution framework for distributing those computations over large datasets residing on clusters of commodity hardware. MapReduce abstracts away the challenging low-level synchronization and scalability details which parallel and distributed computing often necessitate, reducing the concept burden on programmers and scientists who require data processing at-scale. Typically, MapReduce clusters are implemented using inexpensive commodity hardware, emphasizing quantity over quality due …
Design And Implementation Of A Stand-Alone Tool For Metabolic Simulations, Milad Ghiasi Rad
Design And Implementation Of A Stand-Alone Tool For Metabolic Simulations, Milad Ghiasi Rad
School of Computing: Dissertations, Theses, and Student Research
In this thesis, we present the design and implementation of a stand-alone tool for metabolic simulations. This system is able to integrate custom-built SBML models along with external user’s input information and produces the estimation of any reactants participating in the chain of the reactions in the provided model, e.g., ATP, Glucose, Insulin, for the given duration using numerical analysis and simulations. This tool offers the food intake arguments in the calculations to consider the personalized metabolic characteristics in the simulations. The tool has also been generalized to take into consideration of temporal genomic information and be flexible for simulation …
Online Learning With Nonlinear Models, Doyen Sahoo
Online Learning With Nonlinear Models, Doyen Sahoo
Dissertations and Theses Collection (Open Access)
Recent years have witnessed the success of two broad categories of machine learning algorithms: (i) Online Learning; and (ii) Learning with nonlinear models. Typical machine learning algorithms assume that the entire data is available prior to the training task. This is often not the case in the real world, where data often arrives sequentially in a stream, or is too large to be stored in memory. To address these challenges, Online Learning techniques evolved as a promising solution to having highly scalable and efficient learning methodologies which could learn from data arriving sequentially. Next, as the real world data exhibited …
Leveraging Auxiliary Tasks For Document-Level Cross-Domain Sentiment Classification, Jianfei Yu, Jing Jiang
Leveraging Auxiliary Tasks For Document-Level Cross-Domain Sentiment Classification, Jianfei Yu, Jing Jiang
Research Collection School Of Computing and Information Systems
In this paper, we study domain adaptationwith a state-of-the-art hierarchicalneural network for document-level sentimentclassification. We first design a newauxiliary task based on sentiment scoresof domain-independent words. We thenpropose two neural network architecturesto respectively induce document embeddingsand sentence embeddings that workwell for different domains. When thesedocument and sentence embeddings areused for sentiment classification, we findthat with both pseudo and external sentimentlexicons, our proposed methods canperform similarly to or better than severalhighly competitive domain adaptationmethods on a benchmark dataset of productreviews.
Inferring Social Media Users’ Demographics From Profile Pictures: A Face++ Analysis On Twitter Users, Soon-Gyo Jung, Jisun An, Haewoon Kwak, Joni Salminen, Bernard J. Jansen
Inferring Social Media Users’ Demographics From Profile Pictures: A Face++ Analysis On Twitter Users, Soon-Gyo Jung, Jisun An, Haewoon Kwak, Joni Salminen, Bernard J. Jansen
Research Collection School Of Computing and Information Systems
In this research, we evaluate the applicability of using facial recognition of social media account profile pictures to infer the demographic attributes of gender, race, and age of the account owners leveraging a commercial and well-known image service, specifically Face++. Our goal is to determine the feasibility of this approach for actual system implementation. Using a dataset of approximately 10,000 Twitter profile pictures, we use Face++ to classify this set of images for gender, race, and age. We determine that about 30% of these profile pictures contain identifiable images of people using the current state-of-the-art automated means. We then employ …
A Fast Trajectory Outlier Detection Approach Via Driving Behavior Modeling, Hao Wu, Weiwei Sun, Baihua Zheng
A Fast Trajectory Outlier Detection Approach Via Driving Behavior Modeling, Hao Wu, Weiwei Sun, Baihua Zheng
Research Collection School Of Computing and Information Systems
Trajectory outlier detection is a fundamental building block for many location-based service (LBS) applications, with a large application base. We dedicate this paper on detecting the outliers from vehicle trajectories efficiently and effectively. In addition, we want our solution to be able to issue an alarm early when an outlier trajectory is only partially observed (i.e., the trajectory has not yet reached the destination). Most existing works study the problem on general Euclidean trajectories and require accesses to the historical trajectory database or computations on the distance metric that are very expensive. Furthermore, few of existing works consider some specific …
Semvis: Semantic Visualization For Interactive Topical Analysis, Le Van Minh Tuan, Hady Wirawan Lauw
Semvis: Semantic Visualization For Interactive Topical Analysis, Le Van Minh Tuan, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Exploratory analysis of a text corpus is an important task that can be aided by informative visualization. One spatially-oriented form of document visualization is a scatterplot, whereby every document is associated with a coordinate, and relationships among documents can be perceived through their spatial distances. Semantic visualization further infuses the visualization space with latent semantics, by incorporating a topic model that has a representation in the visualization space, allowing users to also perceive relationships between documents and topics spatially. We illustrate how a semantic visualization system called SemVis could be used to navigate a text corpus interactively and topically via …
Answerbot: Automated Generation Of Answer Summary To Developers’ Technical Questions, Bowen Xu, Zhenchang Xing, Xin Xia, David Lo
Answerbot: Automated Generation Of Answer Summary To Developers’ Technical Questions, Bowen Xu, Zhenchang Xing, Xin Xia, David Lo
Research Collection School Of Computing and Information Systems
The prevalence of questions and answers on domain-specific Q&A sites like Stack Overflow constitutes a core knowledge asset for software engineering domain. Although search engines can return a list of questions relevant to a user query of some technical question, the abundance of relevant posts and the sheer amount of information in them makes it difficult for developers to digest them and find the most needed answers to their questions. In this work, we aim to help developers who want to quickly capture the key points of several answer posts relevant to a technical question before they read the details …
Collaborative Topic Regression With Denoising Autoencoder For Content And Community Co-Representation, Trong T. Nguyen, Hady W. Lauw
Collaborative Topic Regression With Denoising Autoencoder For Content And Community Co-Representation, Trong T. Nguyen, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Personalized recommendation of items frequently faces scenarios where we have sparse observations on users' adoption of items. In the literature, there are two promising directions. One is to connect sparse items through similarity in content. The other is to connect sparse users through similarity in social relations. We seek to integrate both types of information, in addition to the adoption information, within a single integrated model. Our proposed method models item content via a topic model, and user communities via an autoencoder model, while bridging a user's community-based preference to her topic-based preference. Experiments on public real-life data showcase the …
Predicting Indoor Crowd Density Using Column-Structured Deep Neural Network, Akihito Sudo, Teck Hou (Deng Dehao) Teng, Hoong Chuin Lau, Yoshihide Sekimoto
Predicting Indoor Crowd Density Using Column-Structured Deep Neural Network, Akihito Sudo, Teck Hou (Deng Dehao) Teng, Hoong Chuin Lau, Yoshihide Sekimoto
Research Collection School Of Computing and Information Systems
This work proposes a deep neural network approach known as the column-structured deep neural network (COL-DNN-R) for predicting crowd density in an indoor environment using historical Wi-Fi traces of individual visitors. With a structure designed to minimize feature engineering, COL-DNN accepts raw features such as crowd density, opening and closing hours and peak visitor counts for extracting features. The extracted features are used by a regression model R for predicting the crowd densities. Standard regression models such as MLP, RF and SVM can be used as R. Experiments are performed to investigate the effect of feature representation and model structure …
Second-Order Online Active Learning And Its Applications, Shuji Hao, Jing Lu, Peilin Zhao, Chi Zhang, Steven C. H. Hoi, Chunyan Miao
Second-Order Online Active Learning And Its Applications, Shuji Hao, Jing Lu, Peilin Zhao, Chi Zhang, Steven C. H. Hoi, Chunyan Miao
Research Collection School Of Computing and Information Systems
The goal of online active learning is to learn predictive models from a sequence of unlabeled data given limited label querybudget. Unlike conventional online learning tasks, online active learning is considerably more challenging because of two reasons.Firstly, it is difficult to design an effective query strategy to decide when is appropriate to query the label of an incoming instance givenlimited query budget. Secondly, it is also challenging to decide how to update the predictive models effectively whenever the true labelof an instance is queried. Most existing approaches for online active learning are often based on a family of first-order online …
Highly Efficient Mining Of Overlapping Clusters In Signed Weighted Networks, Tuan-Anh Hoang, Ee-Peng Lim
Highly Efficient Mining Of Overlapping Clusters In Signed Weighted Networks, Tuan-Anh Hoang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
In many practical contexts, networks are weighted as their links are assigned numerical weights representing relationship strengths or intensities of inter-node interaction. Moreover, the links' weight can be positive or negative, depending on the relationship or interaction between the connected nodes. The existing methods for network clustering however are not ideal for handling very large signed weighted networks. In this paper, we present a novel method called LPOCSIN (short for "Linear Programming based Overlapping Clustering on Signed Weighted Networks") for efficient mining of overlapping clusters in signed weighted networks. Different from existing methods that rely on computationally expensive cluster cohesiveness …