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

Numerical Analysis and Scientific Computing Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 601 - 630 of 1024

Full-Text Articles in Numerical Analysis and Scientific Computing

A Latent Variable Model For Viewpoint Discovery From Threaded Forum Posts, Minghui Qiu, Jing Jiang Jun 2013

A Latent Variable Model For Viewpoint Discovery From Threaded Forum Posts, Minghui Qiu, Jing Jiang

Research Collection School Of Computing and Information Systems

Threaded discussion forums provide an important social media platform. Its rich user generated content has served as an important source of public feedback. To automatically discover the viewpoints or stances on hot issues from forum threads is an important and useful task. In this paper, we propose a novel latent variable model for viewpoint discovery from threaded forum posts. Our model is a principled generative latent variable model which captures three important factors: viewpoint specific topic preference, user identity and user interactions. Evaluation results show that our model clearly outperforms a number of baseline models in terms of both clustering …

Go to article

Mining User Relations From Online Discussions Using Sentiment Analysis And Probabilistic Matrix Factorization, Minghui Qiu, Liu Yang, Jing Jiang Jun 2013

Mining User Relations From Online Discussions Using Sentiment Analysis And Probabilistic Matrix Factorization, Minghui Qiu, Liu Yang, Jing Jiang

Research Collection School Of Computing and Information Systems

Advances in sentiment analysis have enabled extraction of user relations implied in online textual exchanges such as forum posts. However, recent studies in this direction only consider direct relation extraction from text. As user interactions can be sparse in online discussions, we propose to apply collaborative filtering through probabilistic matrix factorization to generalize and improve the opinion matrices extracted from forum posts. Experiments with two tasks show that the learned latent factor representation can give good performance on a relation polarity prediction task and improve the performance of a subgroup detection task.

Go to article

Approximate Inference In Collective Graphical Models, Daniel Sheldon, Tao Sun, Akshat Kumar, Thomas G. Dietterich Jun 2013

Approximate Inference In Collective Graphical Models, Daniel Sheldon, Tao Sun, Akshat Kumar, Thomas G. Dietterich

Research Collection School Of Computing and Information Systems

We study the problem of approximate inference in collective graphical models (CGMs), which were recently introduced to model the problem of learning and inference with noisy aggregate observations. We first analyze the complexity of inference in CGMs: unlike inference in conventional graphical models, exact inference in CGMs is NP-hard even for tree-structured models. We then develop a tractable convex approximation to the NP-hard MAP inference problem in CGMs, and show how to use MAP inference for approximate marginal inference within the EM framework. We demonstrate empirically that these approximation techniques can reduce the computational cost of inference by two orders …

Go to article

Introducing Programmers To Pair Programming: A Controlled Experiment, A. S. M. Sajeev, Subhajit Datta Jun 2013

Introducing Programmers To Pair Programming: A Controlled Experiment, A. S. M. Sajeev, Subhajit Datta

Research Collection School Of Computing and Information Systems

Pair programming is a key characteristic of the Extreme Programming (XP) method. Through a controlled experiment we investigate pair programming behaviour of programmers without prior experience in XP. The factors investigated are: (a) characteristics of pair programming that are less favored (b) perceptions of team effectiveness and how they relate to product quality, and (c) whether it is better to train a pair by giving routine tasks first or by giving complex tasks first. Our results show that: (a) the least liked aspects of pair programming were having to share the screen, keyboard and mouse, and having to switch between …

Go to article

R-Energy For Evaluating Robustness Of Dynamic Networks, Ming Gao, Ee Peng Lim, David Lo May 2013

R-Energy For Evaluating Robustness Of Dynamic Networks, Ming Gao, Ee Peng Lim, David Lo

Research Collection School Of Computing and Information Systems

The robustness of a network is determined by how well its vertices are connected to one another so as to keep the network strong and sustainable. As the network evolves its robustness changes and may reveal events as well as periodic trend patterns that affect the interactions among users in the network. In this paper, we develop R-energy as a new measure of network robustness based on the spectral analysis of normalized Laplacian matrix. R-energy can cope with disconnected networks, and is efficient to compute with a time complexity of O (jV j + jEj) where V and E are …

Go to article

Traditional Media Seen From Social Media, Jisun An, Daniele Quercia, Meeyoung Cha, Krishna Gummadi, Jon Crowcroft May 2013

Traditional Media Seen From Social Media, Jisun An, Daniele Quercia, Meeyoung Cha, Krishna Gummadi, Jon Crowcroft

Research Collection School Of Computing and Information Systems

With the advent of social media services, media outlets have started reaching audiences on social-networking sites. On Twitter, users actively follow a wide set of media sources, form interpersonal networks, and propagate interesting stories to their peers. These media subscription and interaction patterns, which had previously been hidden behind media corporations' databases, offer new opportunities to understand media supply and demand on a large scale. Through a map that connects 77 media outlets based on Twitter subscription patterns, we are able to answer a variety of questions: to what extent New York Times and the Wall Street Journal readers overlap? …

Go to article

Fans: Face Annotation By Searching Large-Scale Web Facial Images, Steven Hoi, Dayong Wang, I Yeu Cheng, Elmer Lin, Jianke Zhu, Ying He, Chunyan Miao May 2013

Fans: Face Annotation By Searching Large-Scale Web Facial Images, Steven Hoi, Dayong Wang, I Yeu Cheng, Elmer Lin, Jianke Zhu, Ying He, Chunyan Miao

Research Collection School Of Computing and Information Systems

Auto face annotation is an important technique for many real-world applications, such as online photo album management, new video summarization, and so on. It aims to automatically detect human faces from a photo image and further name the faces with the corresponding human names. Recently, mining web facial images on the internet has emerged as a promising paradigm towards auto face annotation. In this paper, we present a demonstration system of search-based face annotation: FANS - Face ANnotation by Searching large-scale web facial images. Given a query facial image for annotation, we first retrieve a short list of the most …

Go to article

Your Love Is Public Now: Questioning The Use Of Personal Information In Authentication, Payas Gupta, Swapna Gottipati, Jing Jiang, Debin Gao May 2013

Your Love Is Public Now: Questioning The Use Of Personal Information In Authentication, Payas Gupta, Swapna Gottipati, Jing Jiang, Debin Gao

Research Collection School Of Computing and Information Systems

Most social networking platforms protect user's private information by limiting access to it to a small group of members, typically friends of the user, while allowing (virtually) everyone's access to the user's public data. In this paper, we exploit public data available on Facebook to infer users' undisclosed interests on their profile pages. In particular, we infer their undisclosed interests from the public data fetched using Graph APIs provided by Facebook. We demonstrate that simply liking a Facebook page does not corroborate that the user is interested in the page. Instead, we perform sentiment-oriented mining on various attributes of a …

Go to article

It Is Not Just What We Say, But How We Say Them: Lda-Based Behavior-Topic Model, Minghui Qiu, Feida Zhu, Jing Jiang May 2013

It Is Not Just What We Say, But How We Say Them: Lda-Based Behavior-Topic Model, Minghui Qiu, Feida Zhu, Jing Jiang

Research Collection School Of Computing and Information Systems

Textual information exchanged among users on online social network platforms provides deep understanding into users' interest and behavioral patterns. However, unlike traditional text-dominant settings such as o ine publishing, one distinct feature for online social network is users' rich interactions with the textual content, which, unfortunately, has not yet been well incorporated in the existing topic modeling frameworks. In this paper, we propose an LDA-based behavior-topic model (B-LDA) which jointly models user topic interests and behavioral patterns. We focus the study of the model on online social network settings such as microblogs like Twitter where the textual content is relatively …

Go to article

Retweeting: An Act Of Viral Users, Susceptible Users, Or Viral Topics?, Tuan-Anh Hoang, Ee Peng Lim May 2013

Retweeting: An Act Of Viral Users, Susceptible Users, Or Viral Topics?, Tuan-Anh Hoang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

When a user retweets, there are three behavioral factors that cause the actions. They are the topic virality, user virality and user susceptibility. Topic virality captures the degree to which a topic attracts retweets by users. For each topic, user virality and susceptibility refer to the likelihood that a user attracts retweets and performs retweeting respectively. To model a set of observed retweet data as a result of these three topic specific factors, we first represent the retweets as a three-dimensional tensor of the tweet authors, their followers, and the tweets themselves. We then propose the V 2S model, a …

Go to article

Disclosing Climate Change Patterns Using An Adaptive Markov Chain Pattern Detection Method, Zhaoxia Wang, Gary Lee, Hoong Maeng Chan, Reuben Li, Xiuju Fu, Rick Goh, Pauline A. W. Poh Kim, Martin L. Hibberd, Hoong Chor Chin May 2013

Disclosing Climate Change Patterns Using An Adaptive Markov Chain Pattern Detection Method, Zhaoxia Wang, Gary Lee, Hoong Maeng Chan, Reuben Li, Xiuju Fu, Rick Goh, Pauline A. W. Poh Kim, Martin L. Hibberd, Hoong Chor Chin

Research Collection School Of Computing and Information Systems

This paper proposes an adaptive Markov chain pattern detection (AMCPD) method for disclosing the climate change patterns of Singapore through meteorological data mining. Meteorological variables, including daily mean temperature, mean dew point temperature, mean visibility, mean wind speed, maximum sustained wind speed, maximum temperature and minimum temperature are simultaneously considered for identifying climate change patterns in this study. The results depict various weather patterns from 1962 to 2011 in Singapore, based on the records of the Changi Meteorological Station. Different scenarios with varied cluster thresholds are employed for testing the sensitivity of the proposed method. The robustness of the proposed …

Go to article

Vistruclizer: A Structural Visualizer For Multi-Dimensional Social Networks, Bingtian Dai, Agus Trisnajaya Kwee, Ee Peng Lim Apr 2013

Vistruclizer: A Structural Visualizer For Multi-Dimensional Social Networks, Bingtian Dai, Agus Trisnajaya Kwee, Ee Peng Lim

Research Collection School Of Computing and Information Systems

With the popularity of Web 2.0 sites, social networks today increasingly involve different kinds of relationships among different types of users in a single network. Such social networks are said to be multi-dimensional. Analyzing multi-dimensional networks is a challenging research task that requires intelligent visualization techniques. In this paper, we therefore propose a visual analytics tool called ViStruclizer to analyze structures embedded in a multi-dimensional social network. ViStruclizer incorporates structure analyzers that summarize social networks into both node clusters each representing a set of users, and edge clusters representing relationships between users in the node clusters. ViStruclizer supports user interactions …

Go to article

Delayed Insertion And Rule Effect Moderation Of Domain Knowledge For Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan Apr 2013

Delayed Insertion And Rule Effect Moderation Of Domain Knowledge For Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Though not a fundamental pre-requisite to efficient machine learning, insertion of domain knowledge into adaptive virtual agent is nonetheless known to improve learning efficiency and reduce model complexity. Conventionally, domain knowledge is inserted prior to learning. Despite being effective, such approach may not always be feasible. Firstly, the effect of domain knowledge is assumed and can be inaccurate. Also, domain knowledge may not be available prior to learning. In addition, the insertion of domain knowledge can frame learning and hamper the discovery of more effective knowledge. Therefore, this work advances the use of domain knowledge by proposing to delay the …

Go to article

Roundtriprank: Graph-Based Proximity With Importance And Specificity, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw Apr 2013

Roundtriprank: Graph-Based Proximity With Importance And Specificity, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Graph-based proximity has many applications with different ranking needs. However, most previous works only stress the sense of importance by finding "popular” results for a query. Often times important results are overly general without being well-tailored to the query, lacking a sense of specificity— which only emerges recently. Even then, the two senses are treated independently, and only combined empirically. In this paper, we generalize the well-studied importance-based random walk into a round trip and develop RoundTripRank, seamlessly integrating specificity and importance in one coherent process. We also recognize the need for a flexible trade-off between the two senses, and …

Go to article

Dynamic Label Propagation In Social Networks, Juan Du, Feida Zhu, Ee Peng Lim Apr 2013

Dynamic Label Propagation In Social Networks, Juan Du, Feida Zhu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Label propagation has been studied for many years, starting from a set of nodes with labels and then propagating to those without labels. In social networks, building complete user profiles like interests and affiliations contributes to the systems like link prediction, personalized feeding, etc. Since the labels for each user are mostly not filled, we often employ some people to label these users. And therefore, the cost of human labeling is high if the data set is large. To reduce the expense, we need to select the optimal data set for labeling, which produces the best propagation result. In this …

Go to article

Finding The Optimal Social Trust Path For The Selection Of Trustworthy Service Providers In Complex Social Networks, Guanfeng Liu, Yan Wang, Mehmet A. Orgun, Ee Peng Lim Apr 2013

Finding The Optimal Social Trust Path For The Selection Of Trustworthy Service Providers In Complex Social Networks, Guanfeng Liu, Yan Wang, Mehmet A. Orgun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Online social networks have provided the infrastructure for a number of emerging applications in recent years, e.g., for the recommendation of service providers or the recommendation of files as services. In these applications, trust is one of the most important factors in decision making by a service consumer, requiring the evaluation of the trustworthiness of a service provider along the social trust paths from a service consumer to the service provider. However, there are usually many social trust paths between two participants who are unknown to one another. In addition, some social information, such as social relationships between participants and …

Go to article

Image Collection Summarization Via Dictionary Learning For Sparse Representation, Chunlei Yang, Jialie Shen, Jinye Peng, Jianping Fan Mar 2013

Image Collection Summarization Via Dictionary Learning For Sparse Representation, Chunlei Yang, Jialie Shen, Jinye Peng, Jianping Fan

Research Collection School Of Computing and Information Systems

In this paper, a novel approach is developed to achieve automatic image collection summarization. The effectiveness of the summary is reflected by its ability to reconstruct the original set or each individual image in the set. We have leveraged the dictionary learning for sparse representation model to construct the summary and to represent the image. Specifically we reformulate the summarization problem into a dictionary learning problem by selecting bases which can be sparsely combined to represent the original image and achieve a minimum global reconstruction error, such as MSE (Mean Square Error). The resulting “Sparse Least Square” problem is NP-hard, …

Go to article

Structures Of Broken Ties: Exploring Unfollow Behavior On Twitter, Bo Xu, Yun Huang, Haewoon Kwak Feb 2013

Structures Of Broken Ties: Exploring Unfollow Behavior On Twitter, Bo Xu, Yun Huang, Haewoon Kwak

Research Collection School Of Computing and Information Systems

This study investigates unfollow behavior in Twitter, i.e. people removing others from their Twitter following lists. Considering the interdependency and dynamics of unfollow decisions, we use actor-oriented modeling (SIENA) to examine the impacts of reciprocity, status, embeddedness, homophily, and informativeness on tie dissolution. Focusing on ordinary users in tightly-knitted user groups, the results show that relational properties play key roles in the emergence of unfollow behavior: mutual following relations and common followees reduce the likelihood of unfollowing. And unfollow tends to be reciprocal: when a user is unfollowed by someone, he or she will unfollow back. However, there is no …

Go to article

Online Multi-Modal Distance Learning For Scalable Multimedia Retrieval, Hao Xia, Pengcheng Wu, Steven C. H. Hoi Feb 2013

Online Multi-Modal Distance Learning For Scalable Multimedia Retrieval, Hao Xia, Pengcheng Wu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

In many real-word scenarios, e.g., multimedia applications, data often originates from multiple heterogeneous sources or are represented by diverse types of representation, which is often referred to as "multi-modal data". The definition of distance between any two objects/items on multi-modal data is a key challenge encountered by many real-world applications, including multimedia retrieval. In this paper, we present a novel online learning framework for learning distance functions on multi-modal data through the combination of multiple kernels. In order to attack large-scale multimedia applications, we propose Online Multi-modal Distance Learning (OMDL) algorithms, which are significantly more efficient and scalable than the …

Go to article

Utility Of Potential Misdiagnoses In Predicting Foodborne Outbreaks, Lucia Lucia, Artur Dubrawski, Lujie Chen Jan 2013

Utility Of Potential Misdiagnoses In Predicting Foodborne Outbreaks, Lucia Lucia, Artur Dubrawski, Lujie Chen

Research Collection School Of Computing and Information Systems

To investigate utility of using inpatient and emergency room diagnoses to detect outbreaks of Salmonellosis in humans. To quantify the impact of including in the analysis cases diagnosed with conditions that may have physiological appearance similar to Salmonellosis.

Go to article

Hypergraph Index: An Index For Context-Aware Nearest Neighbor Query On Social Networks, Yazhe Wang, Baihua Zheng Jan 2013

Hypergraph Index: An Index For Context-Aware Nearest Neighbor Query On Social Networks, Yazhe Wang, Baihua Zheng

Research Collection School Of Computing and Information Systems

Social network has been touted as the No. 2 innovation in a recent IEEE Spectrum Special Report on “Top 11 Technologies of the Decade”, and it has cemented its status as a bona fide Internet phenomenon. With more and more people starting using social networks to share ideas, activities, events, and interests with other members within the network, social networks contain a huge amount of content. However, it might not be easy to navigate social networks to find specific information. In this paper, we define a new type of queries, namely context-aware nearest neighbor (CANN) search over social network to …

Go to article

Towards Next-Generation Multimedia Recommendation Systems, Jialie Shen, Shuicheng Yan, Xian-Sheng Hua Jan 2013

Towards Next-Generation Multimedia Recommendation Systems, Jialie Shen, Shuicheng Yan, Xian-Sheng Hua

Research Collection School Of Computing and Information Systems

Empowered by advances in information technology, such as social media network, digital library and mobile computing, there emerges an ever-increasing amounts of multimedia data. As the key technology to address the problem of information overload, multimedia recommendation system has been received a lot of attentions from both industry and academia. This course aims to 1) provide a series of detailed review of state-of-the-art in multimedia recommendation; 2) analyze key technical challenges in developing and evaluating next generation multimedia recommendation systems from different perspectives and 3) give some predictions about the road lies ahead of us.

Go to article

Cqarank: Jointly Model Topics And Expertise In Community Question Answering, Liu Yang, Minghui Qiu, Swapna Gottopati, Feida Zhu, Jing Jiang, Huiping Sun, Zhong Chen Jan 2013

Cqarank: Jointly Model Topics And Expertise In Community Question Answering, Liu Yang, Minghui Qiu, Swapna Gottopati, Feida Zhu, Jing Jiang, Huiping Sun, Zhong Chen

Research Collection School Of Computing and Information Systems

Community Question Answering (CQA) websites, where people share expertise on open platforms, have become large repositories of valuable knowledge. To bring the best value out of these knowledge repositories, it is critically important for CQA services to know how to find the right experts, retrieve archived similar questions and recommend best answers to new questions. To tackle this cluster of closely related problems in a principled approach, we proposed Topic Expertise Model (TEM), a novel probabilistic generative model with GMM hybrid, to jointly model topics and expertise by integrating textual content model and link structure analysis. Based on TEM results, …

Go to article

The Impact Of Smartphone Adoption On Consumers’ Switching Behavior In Broadband And Cable Tv Services, Gwangjae Jung Jan 2013

The Impact Of Smartphone Adoption On Consumers’ Switching Behavior In Broadband And Cable Tv Services, Gwangjae Jung

Research Collection School Of Computing and Information Systems

The emergence of smartphones has brought a technology disruption to the telecom business. Due to the various services offered in association with smartphones, people can surf the web or watch TV. This research is related to telecom services overall, and has the goal of finding the impact of smartphone adoption to consumers’ switching behavior in broadband and cable TV services. This research adopts a quasi-experimental design and investigates the causal effect of smartphone service adoption on broadband and cable TV service choices. The data collection involves five years of consumer service subscriptions in a Singaporean telecommunications company. I tested for …

Go to article

Multimedia Recommendation: Technology And Techniques, Jialie Shen, Meng Wang, Shuicheng Yan, Peng Cui Jan 2013

Multimedia Recommendation: Technology And Techniques, Jialie Shen, Meng Wang, Shuicheng Yan, Peng Cui

Research Collection School Of Computing and Information Systems

In recent years, we have witnessed a rapid growth in the availability of digital multimedia on various application platforms and domains. Consequently, the problem of information overload has become more and more serious. In order to tackle the challenge, various multimedia recommendation technologies have been developed by different research communities (e.g., multimedia systems, information retrieval, machine learning and computer version). Meanwhile, many commercial web systems (e.g., Flick, YouTube, and Last.fm) have successfully applied recommendation techniques to provide users personalized content and services in a convenient and flexible way. When looking back, the information retrieval (IR) community has a long history …

Go to article

Business Intelligence And Analytics: Research Directions, Ee Peng Lim, Hsinchun Chen, Guoqing Chen Jan 2013

Business Intelligence And Analytics: Research Directions, Ee Peng Lim, Hsinchun Chen, Guoqing Chen

Research Collection School Of Computing and Information Systems

Business intelligence and analytics (BIA) is about the development of technologies, systems, practices, and applications to analyze critical business data so as to gain new insights about business and markets. The new insights can be used for improving products and services, achieving better operational efficiency, and fostering customer relationships. In this article, we will categorize BIA research activities into three broad research directions: (a) big data analytics, (b) text analytics, and (c) network analytics. The article aims to review the state-of-the-art techniques and models and to summarize their use in BIA applications. For each research direction, we will also determine …

Go to article

Cost-Sensitive Online Classification, Jialei Wang, Peilin Zhao, Steven C. H. Hoi Dec 2012

Cost-Sensitive Online Classification, Jialei Wang, Peilin Zhao, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Both cost-sensitive classification and online learning have been extensively studied in data mining and machine learning communities, respectively. However, very limited study addresses an important intersecting problem, that is, “Cost-Sensitive Online Classification". In this paper, we formally study this problem, and propose a new framework for Cost-Sensitive Online Classification by directly optimizing cost-sensitive measures using online gradient descent techniques. Specifically, we propose two novel cost-sensitive online classification algorithms, which are designed to directly optimize two well-known cost-sensitive measures: (i) maximization of weighted sum of sensitivity and specificity, and (ii) minimization of weighted misclassification cost. We analyze the theoretical bounds of …

Go to article

A Survey Of Recommender Systems In Twitter, Su Mon Kywe, Ee Peng Lim, Feida Zhu Dec 2012

A Survey Of Recommender Systems In Twitter, Su Mon Kywe, Ee Peng Lim, Feida Zhu

Research Collection School Of Computing and Information Systems

Twitter is a social information network where short messages or tweets are shared among a large number of users through a very simple messaging mechanism. With a population of more than 100M users generating more than 300M tweets each day, Twitter users can be easily overwhelmed by the massive amount of information available and the huge number of people they can interact with. To overcome the above information overload problem, recommender systems can be introduced to help users make the appropriate selection. Researchers have began to study recommendation problems in Twitter but their works usually address individual recommendation tasks. There …

Go to article

Detecting Anomalies In Bipartite Graphs With Mutual Dependency Principles, Hanbo Dai, Feida Zhu, Ee Peng Lim, Hwee Hwa Pang Dec 2012

Detecting Anomalies In Bipartite Graphs With Mutual Dependency Principles, Hanbo Dai, Feida Zhu, Ee Peng Lim, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Bipartite graphs can model many real life applications including users-rating-products in online marketplaces, users-clicking-webpages on the World Wide Web and users referring users in social networks. In these graphs, the anomalousness of nodes in one partite often depends on that of their connected nodes in the other partite. Previous studies have shown that this dependency can be positive (the anomalousness of a node in one partite increases or decreases along with that of its connected nodes in the other partite) or negative (the anomalousness of a node in one partite rises or falls in opposite direction to that of its …

Go to article

Visualization For Anomaly Detection And Data Management By Leveraging Network, Sensor And Gis Techniques, Zhaoxia Wang, Chee Seng Chong, Rick S. M. Goh, Wanqing Zhou, Dan Peng, Hoong Chor Chin Dec 2012

Visualization For Anomaly Detection And Data Management By Leveraging Network, Sensor And Gis Techniques, Zhaoxia Wang, Chee Seng Chong, Rick S. M. Goh, Wanqing Zhou, Dan Peng, Hoong Chor Chin

Research Collection School Of Computing and Information Systems

This paper studies the importance of visualization for discerning and interpreting patterns of data and its application for solving real problems, such as anomaly detection and data management. There are various ways to realize visualization to cater to the needs of numerous real life applications. Depending on needs, a combination of some of these ways may be required for presenting an effective visualization. The authors present visualization schemes for anomaly detection/condition monitoring and data management by leveraging network techniques and combining them with modern techniques such as sensor, database, mobile communication, GPS and GIS techniques. Two case studies are presented …

Go to article

First Prev Next Last