Data Visualization

Author(s):  
Ravishankar Palaniappan

Data visualization has the potential to aid humanity not only in exploring and analyzing large volume datasets but also in identifying and predicting trends and anomalies/outliers in a “simple and consumable” approach. These are vital to good and timely decisions for business advantage. Data Visualization is an active research field, focusing on the different techniques and tools for qualitative exploration in conjunction with quantitative analysis of data. However, an increase in volume, multivariate, frequency, and interrelationships of data will make the data visualization process notoriously difficult. This necessitates “innovative and iterative” display techniques. Either overlooking any dimensions/relationships of data structure or choosing an unfitting visualization method will quickly lead to a humanitarian uninterpretable “junk chart,” which leads to incorrect inferences or conclusions. The purpose of this chapter is to introduce the different phases of data visualization and various techniques which help to connect and empower data to mine insights. It exemplifies on how “data visualization” helps to unravel the important, meaningful, and useful insights including trends and outliers from real world datasets, which might otherwise be unnoticed. The use case in this chapter uses both simulated and real-world datasets to illustrate the effectiveness of data visualization.

2017 ◽  
pp. 576-605
Author(s):  
Ravishankar Palaniappan

Data visualization has the potential to aid humanity not only in exploring and analyzing large volume datasets but also in identifying and predicting trends and anomalies/outliers in a “simple and consumable” approach. These are vital to good and timely decisions for business advantage. Data Visualization is an active research field, focusing on the different techniques and tools for qualitative exploration in conjunction with quantitative analysis of data. However, an increase in volume, multivariate, frequency, and interrelationships of data will make the data visualization process notoriously difficult. This necessitates “innovative and iterative” display techniques. Either overlooking any dimensions/relationships of data structure or choosing an unfitting visualization method will quickly lead to a humanitarian uninterpretable “junk chart,” which leads to incorrect inferences or conclusions. The purpose of this chapter is to introduce the different phases of data visualization and various techniques which help to connect and empower data to mine insights. It exemplifies on how “data visualization” helps to unravel the important, meaningful, and useful insights including trends and outliers from real world datasets, which might otherwise be unnoticed. The use case in this chapter uses both simulated and real-world datasets to illustrate the effectiveness of data visualization.


Author(s):  
S. R. Mani Sekhar ◽  
Siddesh G. M. ◽  
Sunilkumar S. Manvi

Data visualization helps the users to understand the relationships and associations between information. Visualization helps in minimizing the errors generated during decision making. Different visualization methods have been developed to unlock the valuable insight. These methods have been developed on the supposition that the information to be present is free from ambiguity. This chapter provides an overview of data visualization techniques in R programming. Various methods have been discussed with supported explanation and examples which in turn helps the reader to create their own visualization method. Later, four different case studies are presented to understand the importance and use of data visualization in real-world problems.


2021 ◽  
Author(s):  
Zuguang Gu ◽  
Daniel Huebschmann

Spiral layout has two major advantages for data visualization. First, it is able to visualize data with long axes, which greatly improves the resolution of visualization. Second, it is efficient for time series data to reveal periodic patterns. Here we present the R package spiralize that provides a general solution for visualizing data on spirals. spiralize implements numerous graphics functions so that self-defined high-level graphics can be easily implemented by users. The power of spiralize is demonstrated by five real world datasets.


Author(s):  
Xiaoyuan Liang ◽  
Martin Renqiang Min ◽  
Hongyu Guo ◽  
Guiling Wang

Traditional embedding approaches associate a real-valued embedding vector with each symbol or data point, which is equivalent to applying a linear transformation to ``one-hot" encoding of discrete symbols or data objects. Despite simplicity, these methods generate storage-inefficient representations and fail to effectively encode the internal semantic structure of data, especially when the number of symbols or data points and the dimensionality of the real-valued embedding vectors are large. In this paper, we propose a regularized autoencoder framework to learn compact Hierarchical K-way D-dimensional (HKD) discrete embedding of symbols or data points, aiming at capturing essential semantic structures of data. Experimental results on synthetic and real-world datasets show that our proposed HKD embedding can effectively reveal the semantic structure of data via hierarchical data visualization and greatly reduce the search space of nearest neighbor retrieval while preserving high accuracy.


2018 ◽  
Author(s):  
Shivika Narang ◽  
Praphul Chandra ◽  
Shweta Jain ◽  
Narahari Y

The blockchain concept forms the backbone of a new wave technology that promises to be deployed extensively in a wide variety of industrial and societal applications. In this article, we present the scientific foundations and technical strengths of this technology. Our emphasis is on blockchains that go beyond the original application to digital currencies such as bitcoin. We focus on the blockchain data structure and its characteristics; distributed consensus and mining; and different types of blockchain architectures. We conclude with a section on applications in industrial and societal settings, elaborating upon a few applications such as land registry ledger, tamper-proof academic transcripts, crowdfunding, and a supply chain B2B platform. We discuss what we believe are the important challenges in deploying the blockchain technology successfully in real-world settings.


Sensors ◽  
2015 ◽  
Vol 15 (10) ◽  
pp. 26675-26693 ◽  
Author(s):  
Yiqing Li ◽  
Yu Wang ◽  
Yanyang Zi ◽  
Mingquan Zhang

2021 ◽  
Vol 21 (3) ◽  
pp. 1-17
Author(s):  
Wu Chen ◽  
Yong Yu ◽  
Keke Gai ◽  
Jiamou Liu ◽  
Kim-Kwang Raymond Choo

In existing ensemble learning algorithms (e.g., random forest), each base learner’s model needs the entire dataset for sampling and training. However, this may not be practical in many real-world applications, and it incurs additional computational costs. To achieve better efficiency, we propose a decentralized framework: Multi-Agent Ensemble. The framework leverages edge computing to facilitate ensemble learning techniques by focusing on the balancing of access restrictions (small sub-dataset) and accuracy enhancement. Specifically, network edge nodes (learners) are utilized to model classifications and predictions in our framework. Data is then distributed to multiple base learners who exchange data via an interaction mechanism to achieve improved prediction. The proposed approach relies on a training model rather than conventional centralized learning. Findings from the experimental evaluations using 20 real-world datasets suggest that Multi-Agent Ensemble outperforms other ensemble approaches in terms of accuracy even though the base learners require fewer samples (i.e., significant reduction in computation costs).


Data ◽  
2020 ◽  
Vol 6 (1) ◽  
pp. 1
Author(s):  
Ahmed Elmogy ◽  
Hamada Rizk ◽  
Amany M. Sarhan

In data mining, outlier detection is a major challenge as it has an important role in many applications such as medical data, image processing, fraud detection, intrusion detection, and so forth. An extensive variety of clustering based approaches have been developed to detect outliers. However they are by nature time consuming which restrict their utilization with real-time applications. Furthermore, outlier detection requests are handled one at a time, which means that each request is initiated individually with a particular set of parameters. In this paper, the first clustering based outlier detection framework, (On the Fly Clustering Based Outlier Detection (OFCOD)) is presented. OFCOD enables analysts to effectively find out outliers on time with request even within huge datasets. The proposed framework has been tested and evaluated using two real world datasets with different features and applications; one with 699 records, and another with five millions records. The experimental results show that the performance of the proposed framework outperforms other existing approaches while considering several evaluation metrics.


Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 680
Author(s):  
Hanyang Lin ◽  
Yongzhao Zhan ◽  
Zizheng Zhao ◽  
Yuzhong Chen ◽  
Chen Dong

There is a wealth of information in real-world social networks. In addition to the topology information, the vertices or edges of a social network often have attributes, with many of the overlapping vertices belonging to several communities simultaneously. It is challenging to fully utilize the additional attribute information to detect overlapping communities. In this paper, we first propose an overlapping community detection algorithm based on an augmented attribute graph. An improved weight adjustment strategy for attributes is embedded in the algorithm to help detect overlapping communities more accurately. Second, we enhance the algorithm to automatically determine the number of communities by a node-density-based fuzzy k-medoids process. Extensive experiments on both synthetic and real-world datasets demonstrate that the proposed algorithms can effectively detect overlapping communities with fewer parameters compared to the baseline methods.


2021 ◽  
Vol 15 (3) ◽  
pp. 1-33
Author(s):  
Wenjun Jiang ◽  
Jing Chen ◽  
Xiaofei Ding ◽  
Jie Wu ◽  
Jiawei He ◽  
...  

In online systems, including e-commerce platforms, many users resort to the reviews or comments generated by previous consumers for decision making, while their time is limited to deal with many reviews. Therefore, a review summary, which contains all important features in user-generated reviews, is expected. In this article, we study “how to generate a comprehensive review summary from a large number of user-generated reviews.” This can be implemented by text summarization, which mainly has two types of extractive and abstractive approaches. Both of these approaches can deal with both supervised and unsupervised scenarios, but the former may generate redundant and incoherent summaries, while the latter can avoid redundancy but usually can only deal with short sequences. Moreover, both approaches may neglect the sentiment information. To address the above issues, we propose comprehensive Review Summary Generation frameworks to deal with the supervised and unsupervised scenarios. We design two different preprocess models of re-ranking and selecting to identify the important sentences while keeping users’ sentiment in the original reviews. These sentences can be further used to generate review summaries with text summarization methods. Experimental results in seven real-world datasets (Idebate, Rotten Tomatoes Amazon, Yelp, and three unlabelled product review datasets in Amazon) demonstrate that our work performs well in review summary generation. Moreover, the re-ranking and selecting models show different characteristics.


Sign in / Sign up

Export Citation Format

Share Document