From Retweet To Believability: Utilizing Trust To Identify Rumor Spreaders On Twitter,
2017
Singapore Management University
From Retweet To Believability: Utilizing Trust To Identify Rumor Spreaders On Twitter, Bhavtosh Rath, Wei Gao, Jing Ma, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
Ubiquitous use of social media such as microblogging platforms brings about ample opportunities for the false information to diffuse online. It is very important not just to determine the veracity of information but also the authenticity of the users who spread the information, especially in time-critical situations like real-world emergencies, where urgent measures have to be taken for stopping the spread of fake information. In this work, we propose a novel machine learning based approach for automatic identification of the users spreading rumorous information by leveraging the concept of believability, i.e., the extent to which the propagated information is likely …
Predicting Locations Of Pollution Sources Using Convolutional Neural Networks,
2017
Purdue University
Predicting Locations Of Pollution Sources Using Convolutional Neural Networks, Yiheng Chi, Nickolas D. Winovich, Guang Lin
The Summer Undergraduate Research Fellowship (SURF) Symposium
Pollution is a severe problem today, and the main challenge in water and air pollution controls and eliminations is detecting and locating pollution sources. This research project aims to predict the locations of pollution sources given diffusion information of pollution in the form of array or image data. These predictions are done using machine learning. The relations between time, location, and pollution concentration are first formulated as pollution diffusion equations, which are partial differential equations (PDEs), and then deep convolutional neural networks are built and trained to solve these PDEs. The convolutional neural networks consist of convolutional layers, reLU layers …
A Case Study For Ecampus Spatial: Business Data Exploration,
2017
Technological University Dublin
A Case Study For Ecampus Spatial: Business Data Exploration, James Carswell, Thanh Thao Pham Ti, Andrea Ballatore, Junjun Yin, Linh Truong-Hong
Books/Book chapters
Location based querying is the core interaction paradigm between mobile citizens and the Internet of Things, so providing users with intelligent web-services that interact efficiently with web and wireless devices to recommend personalised services is a key goal. With today's popular Web Map Services, users can ask for general information at a specific location, but not detailed information such as related functionality or environments. This shortcoming comes from a lack of connection between non-spatial “business” data and spatial “map” data. This chapter presents a novel approach for location-based querying in web and wireless environments, in which non-spatial business data is …
Zero Textbook Cost Syllabus For Cis 3367 (Spreadsheet Applications In Business),
2017
CUNY Bernard M Baruch College
Zero Textbook Cost Syllabus For Cis 3367 (Spreadsheet Applications In Business), Soniya Dsouza
Open Educational Resources
The primary focus of this course is to learn how to construct and use powerful spreadsheets for effective managerial decision-making. This course is mostly project- oriented with a dual focus on spreadsheet engineering and quantitative modeling of financial applications. Students will learn to develop powerful spreadsheet models and perform data analysis using Pivot Tables, VLookUp, Data Validation techniques and Sub Total functions. Students will also learn how to enhance spreadsheets by creating dashboards on financial data. The Visual Basic (macro) concepts will also be introduced to students. With the knowledge and hands-on experience of these concepts, students will be prepared …
Generating Cultural Personas From Social Data: A Perspective Of Middle Eastern Users,
2017
Singapore Management University
Generating Cultural Personas From Social Data: A Perspective Of Middle Eastern Users, Salminen Joni, Sercan Sengün, Haewoon Kwak, Bernard Jansen, Jisun An, Soon-Gyo Jung, Sarah Vieweg, D. Fox Harrell
Research Collection School Of Computing and Information Systems
We conduct a mixed-method study to better understand the content consumption patterns of Middle Eastern social media users and to explore new ways to present online data by using automatic persona generation. First, we analyze millions of content interactions on YouTube to dynamically generate personas describing behavioral patterns of different demographic groups. Second, we analyze interview data on social media users in the Middle Eastern region to generate additional insights into the dynamically generated personas. Our findings provide insights into social media users in the Middle East, as well as present a novel methodology of using computational analysis and qualitative …
Accelerating Dynamic Graph Analytics On Gpus,
2017
National University of Singapore
Accelerating Dynamic Graph Analytics On Gpus, Mo Shan, Yuchen Li, Bingsheng He, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
As graph analytics often involves compute-intensive operations,GPUs have been extensively used to accelerate the processing. However, in many applications such as social networks, cyber security, and fraud detection, their representative graphs evolve frequently and one has to perform are build of the graph structure on GPUs to incorporate the updates. Hence, rebuilding the graphs becomes the bottleneck of processing high-speed graph streams. In this paper,we propose a GPU-based dynamic graph storage scheme to support existing graph algorithms easily. Furthermore,we propose parallel update algorithms to support efficient stream updates so that the maintained graph is immediately available for high-speed analytic processing …
A Scalable Graph-Coarsening Based Index For Dynamic Graph Databases,
2017
Boise State University
A Scalable Graph-Coarsening Based Index For Dynamic Graph Databases, Akshay Kansal
Boise State University Theses and Dissertations
Graph is a commonly used data structure for modeling complex data such as chemical molecules, images, social networks, and XML documents. This complex data is stored using a set of graphs, known as graph database D. To speed up query answering on graph databases, indexes are commonly used. State-of-the-art graph database indexes do not adapt or scale well to dynamic graph database use; they are static, and their ability to prune possible search responses to meet user needs worsens over time as databases change and grow. Users can re-mine indexes to gain some improvement, but it is time consuming. Users …
Dynamic Adversarial Mining - Effectively Applying Machine Learning In Adversarial Non-Stationary Environments.,
2017
University of Louisville
Dynamic Adversarial Mining - Effectively Applying Machine Learning In Adversarial Non-Stationary Environments., Tegjyot Singh Sethi
Electronic Theses and Dissertations
While understanding of machine learning and data mining is still in its budding stages, the engineering applications of the same has found immense acceptance and success. Cybersecurity applications such as intrusion detection systems, spam filtering, and CAPTCHA authentication, have all begun adopting machine learning as a viable technique to deal with large scale adversarial activity. However, the naive usage of machine learning in an adversarial setting is prone to reverse engineering and evasion attacks, as most of these techniques were designed primarily for a static setting. The security domain is a dynamic landscape, with an ongoing never ending arms race …
Don’T Bury Your Head In Warnings: A Game-Theoretic Approach For Intelligent Allocation Of Cyber-Security Alerts,
2017
Singapore Management University
Don’T Bury Your Head In Warnings: A Game-Theoretic Approach For Intelligent Allocation Of Cyber-Security Alerts, Aaron Schlenker, Haifeng Xu, Mina Guirguis, Christopher Kiekintveld, Arunesh Sinha, Milind Tambe, Solomon Sonya, Darryl Balderas, Noah Dunstatter
Research Collection School Of Computing and Information Systems
In recent years, there have been a number of successful cyber attacks on enterprise networks by malicious actors which have caused severe damage. These networks have Intrusion Detection and Prevention Systems in place to protect them, but they are notorious for producing a high volume of alerts. These alerts must be investigated by cyber analysts to determine whether they are an attack or benign. Unfortunately, there are magnitude more alerts generated than there are cyber analysts to investigate them. This trend is expected to continue into the future creating a need for tools which find optimal assignments of the incoming …
Deepfacade: A Deep Learning Approach To Facade Parsing,
2017
Zhejiang University
Deepfacade: A Deep Learning Approach To Facade Parsing, Hantang Liu, Jialiang Zhang, Jianke Zhu, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
The parsing of building facades is a key component to the problem of 3D street scenes reconstruction, which is long desired in computer vision. In this paper, we propose a deep learning based method for segmenting a facade into semantic categories. Man-made structures often present the characteristic of symmetry. Based on this observation, we propose a symmetric regularizer for training the neural network. Our proposed method can make use of both the power of deep neural networks and the structure of man-made architectures. We also propose a method to refine the segmentation results using bounding boxes generated by the Region …
Modeling Trajectories With Recurrent Neural Networks,
2017
Fudan University
Modeling Trajectories With Recurrent Neural Networks, Hao Wu, Ziyang Chen, Weiwei Sun, Baihua Zheng, Wei Wang
Research Collection School Of Computing and Information Systems
Modeling trajectory data is a building block for many smart-mobility initiatives. Existing approaches apply shallow models such as Markov chain and inverse reinforcement learning to model trajectories, which cannot capture the long-term dependencies. On the other hand, deep models such as Recurrent Neura lNetwork (RNN) have demonstrated their strength of modeling variable length sequences. However, directly adopting RNN to model trajectories is not appropriate because of the unique topological constraints faced by trajectories. Motivated by these findings, we design two RNN-based models which can make full advantage of the strength of RNN to capture variable length sequence and meanwhile to …
Can Syntax Help? Improving An Lstm-Based Sentence Compression Model For New Domains,
2017
Singapore Management University
Can Syntax Help? Improving An Lstm-Based Sentence Compression Model For New Domains, Liangguo Wang, Jing Jiang, Hai Leong Chieu, Chen Hui Ong, Dandan Song, Lejian Liao
Research Collection School Of Computing and Information Systems
In this paper, we study how to improve thedomain adaptability of a deletion-basedLong Short-Term Memory (LSTM) neuralnetwork model for sentence compression.We hypothesize that syntactic informationhelps in making such modelsmore robust across domains. We proposetwo major changes to the model: usingexplicit syntactic features and introducingsyntactic constraints through Integer LinearProgramming (ILP). Our evaluationshows that the proposed model works betterthan the original model as well as a traditionalnon-neural-network-based modelin a cross-domain setting.
Real-Time Influence Maximization On Dynamic Social Streams,
2017
National University of Singapore
Real-Time Influence Maximization On Dynamic Social Streams, Yanhao Wang, Qi Fan, Yuchen Li, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Influence maximization (IM), which selects a set of k users(called seeds) to maximize the influence spread over a social network, is a fundamental problem in a wide range of applications such as viral marketing and network monitoring.Existing IM solutions fail to consider the highly dynamic nature of social influence, which results in either poor seed qualities or long processing time when the network evolves.To address this problem, we define a novel IM query named Stream Influence Maximization (SIM) on social streams.Technically, SIM adopts the sliding window model and maintains a set of k seeds with the largest influence value over …
Object Detection Meets Knowledge Graphs,
2017
Singapore Management University
Object Detection Meets Knowledge Graphs, Yuan Fang, Kingsley Kuan, Jie Lin, Cheston Tan, Vijay Chandrasekhar
Research Collection School Of Computing and Information Systems
Object detection in images is a crucial task in computer vision, with important applications ranging from security surveillance to autonomous vehicles. Existing state-of-the-art algorithms, including deep neural networks, only focus on utilizing features within an image itself, largely neglecting the vast amount of background knowledge about the real world. In this paper, we propose a novel framework of knowledge-aware object detection, which enables the integration of external knowledge such as knowledge graphs into any object detection algorithm. The framework employs the notion of semantic consistency to quantify and generalize knowledge, which improves object detection through a re-optimization process to achieve …
Recommendation Vs Sentiment Analysis: A Text-Driven Latent Factor Model For Rating Prediction With Cold-Start Awareness,
2017
Singapore Management University
Recommendation Vs Sentiment Analysis: A Text-Driven Latent Factor Model For Rating Prediction With Cold-Start Awareness, Kaisong Song, Wei Gao, Shi Feng Feng, Daling Wang, Kam-Fai Wong, Chengqi Zhang
Research Collection School Of Computing and Information Systems
Review rating prediction is an important research topic. The problem was approached from either the perspective of recommender systems (RS) or that of sentiment analysis (SA). Recent SA research using deep neural networks (DNNs) has realized the importance of user and product interaction for better interpreting the sentiment of reviews. However, the complexity of DNN models in terms of the scale of parameters is very high, and the performance is not always satisfying especially when user-product interaction is sparse. In this paper, we propose a simple, extensible RS-based model, called Text-driven Latent Factor Model (TLFM), to capture the semantics of …
On Efficiently Finding Reverse K-Nearest Neighbors Over Uncertain Graphs,
2017
Zhejiang University
On Efficiently Finding Reverse K-Nearest Neighbors Over Uncertain Graphs, Yunjun Gao, Xiaoye Miao, Gang Chen, Baihua Zheng, Deng Cai, Huiyong Cui
Research Collection School Of Computing and Information Systems
Reverse k-nearest neighbor (RkNN) query on graphs returns the data objects that take a specified query object q as one of their k-nearest neighbors. It has significant influence in many real-life applications including resource allocation and profile-based marketing. However, to the best of our knowledge, there is little previous work on RkNN search over uncertain graph data, even though many complex networks such as traffic networks and protein–protein interaction networks are often modeled as uncertain graphs. In this paper, we systematically study the problem of reversek-nearest neighbor search on uncertain graphs (UG-RkNN search for short), where graph edges contain uncertainty. …
Indexing Metric Uncertain Data For Range Queries And Range Joins,
2017
Zhejiang University
Indexing Metric Uncertain Data For Range Queries And Range Joins, Lu Chen, Yunjun Gao, Aoxiao Zhong, Christian S. Jensen, Gang Chen, Baihua Zheng
Research Collection School Of Computing and Information Systems
Range queries and range joins in metric spaces have applications in many areas, including GIS, computational biology, and data integration, where metric uncertain data exist in different forms, resulting from circumstances such as equipment limitations, high-throughput sequencing technologies, and privacy preservation. We represent metric uncertain data by using an object-level model and a bi-level model, respectively. Two novel indexes, the uncertain pivot B+-tree (UPB-tree) and the uncertain pivot B+-forest (UPB-forest), are proposed in order to support probabilistic range queries and range joins for a wide range of uncertain data types and similarity metrics. Both index structures use a small set …
Pivot-Based Metric Indexing,
2017
Zhejiang University
Pivot-Based Metric Indexing, Lu Chen, Yunjun Gao, Baihua Zheng, Christian S. Jensen, Hanyu Yang, Keyu Yang
Research Collection School Of Computing and Information Systems
The general notion of a metric space encompasses a diverse range of data types and accompanying similarity measures. Hence, metric search plays an important role in a wide range of settings, including multimedia retrieval, data mining, and data integration. With the aim of accelerating metric search, a collection of pivot-based indexing techniques for metric data has been proposed, which reduces the number of potentially expensive similarity comparisons by exploiting the triangle inequality for pruning and validation. However, no comprehensive empirical study of those techniques exists. Existing studies each offers only a narrower coverage, and they use different pivot selection strategies …
Geometric Approaches For Top-K Queries [Tutorial],
2017
Singapore Management University
Geometric Approaches For Top-K Queries [Tutorial], Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Top-k processing is a well-studied problem with numerous applications that is becoming increasingly relevant with the growing availability of recommendation systems and decision-making software. The objective of this tutorial is twofold. First, we will delve into the geometric aspects of top-k processing. Second, we will cover complementary features to top-k queries, with strong practical relevance and important applications, that have a computational geometric nature. The tutorial will close with insights in the effect of dimensionality on the meaningfulness of top-k queries, and interesting similarities to nearest neighbor search.
Basket-Sensitive Personalized Item Recommendation,
2017
Singapore Management University
Basket-Sensitive Personalized Item Recommendation, Duc Trong Le, Hady W. Lauw, Yuan Fang
Research Collection School Of Computing and Information Systems
Personalized item recommendation is useful in narrowing down the list of options provided to a user. In this paper, we address the problem scenario where the user is currently holding a basket of items, and the task is to recommend an item to be added to the basket. Here, we assume that items currently in a basket share some association based on an underlying latent need, e.g., ingredients to prepare some dish, spare parts of some device. Thus, it is important that a recommended item is relevant not only to the user, but also to the existing items in the …
