The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The aim of Two-layer network visualization is to help users explore in the networks from the view of application requirement. The research abstracts applications and networks that carry them as business layer and carrier layer, which represent separately all kinds of business and service relationships among application entities and the path of information transmission in network world. A two-layer...
Force-directed algorithms are devoted to creating network visualization that better meet aesthetic standards but rarely consider interactive requirements, making it difficult to place certain nodes with semantic clustering features together through interactive operations. To solve this problem, we realize the interactive semantic clustering visualization through implicit connection. The key steps...
This paper introduces a new kind of geometric graph, called the degree-sensitive neighbourhood graph (dNNG), for a more precise modelling of neighbourhoods. Based on dNNG, we define better shape-based metrics and then propose a neighbourhood-driven force-directed algorithm, called NEFO, for neighbourhood faithfulness. Our evaluation on both real-world and randomly generated graphs shows that the dNNG...
With the explosive growth of information in dimension and magnitude, how to understand these complex data becomes a big challenge. Visualizing data with multivariate attributes is a hot research field in the information visualization domain. This paper makes a research of multivariate data visualization, and uses various attributes mapping method in visualizing movie network data for personalized...
Large scale network has the characteristics of large number of nodes and complex structure, which makes it difficult to display in limited space. The paper proposes an expandable community division method for network visualization. The method use community detection algorithm based on network modularity to detect the network node and greedy algorithm to find the maximum modularity community. Different...
Node occlusion and edge congestion problems, which are caused by the increasing scale and complexity of network, had become a hot spot in network visualization research. To solve the visual clutter problem in network, edges close to each other in network were bundled by curving them. A segmental forced-directed algorithm (FDA) simplification model and a community based compatible edge bundling network...
Kernel-based methods have experienced a substantial progress in the last years, tuning out an essential mechanism for data classification, clustering and pattern recognition. The effectiveness of kernel-based techniques, though, depends largely on the capability of the underlying kernel to properly embed data in the feature space associated to the kernel. However, visualizing how a kernel embeds the...
Networks in real world usually have multiple layers. Most of the current works concentrate on the single-layer network. Visualization of double-layer networks using 2.5D method is proposed in this paper to reveal the network structure and interdependent relations within network layers. A context-preserving layout method and matrix transformation is adopted to preserve node positions and reduce visual...
Visualizing dynamic graphs are challenging due to the difficulty to preserving a coherent mental map of the changing graphs. In this paper, we propose a novel layout algorithm which is capable of maintaining the overall structure of a sequence graphs. Through Laplacian constrained distance embedding, our method works online and maintains the aesthetic of individual graphs and the shape similarity...
Micro-blogging is a new kind of online broadcast medium rising in latest years which is called weibo in China. Every day, weibo users are fed with a large number of incurious micro-blogs. They may also pay close attention to what celebrities concerned about, but they would rather roughly know the summary of micro-blogs the celebrities, however, they can't add attentions to all the celebrities' friends...
As a formal description approach, the trust network can intuitively describe trust relationships among entities in virtual communities and attracts great attentions. The trust network visualization is a key to explore the mechanism of trust propagation and study the trust evaluation. Most existing network visualization approaches only take into account the undirected and unweighted graphs, which cannot...
Combining distinct visual metaphors has been the mechanism adopted by several systems to enable the simultaneous visualization of multiple levels of information in a single layout. However, providing a meaningful layout while avoiding visual clutter is still a challenge. In this work we combine word clouds and a rigid-body simulation engine into an intuitive visualization tool that allows a user to...
Modeling phenomena with networks has a wide application in many disciplines including biology, economics, sociology, and computer science. In network analysis modularity is an important measure for automatically extracting communities of closely connected nodes. Another important aspect of the network analysis is network visualization. Different techniques for network layout generation exist and the...
Most of the layout algorithms for clustered graphs have been designed to differentiate the groups within the graph, however they do not take into account the interactions between such groups. Identifying these interactions allows to understand how the different communities exchange messages or information, and allows the social network researcher to identify key actors, social roles and paths from...
This paper devotes into the technology of network topology visualization, introduces several current network topology visualization algorithms firstly. Then aimed to the display problem for large size network, puts forward a new network topology visualization algorithm which contains two policies: one is the layer model determined by network characters, another is the dynamic layout process by force-directed...
Common layout techniques for dynamic networks typically either keep node positions static as the graph changes, or operate by “tweening” optimized layouts between adjacent time slices. These techniques can be problematic because (in the first case) there is significant visual “noise” caused by unnecessary edge crossings, and (in the second case) the nodes change so much from one time slice to another...
In this paper, we introduce a visualization method that couples a trend chart with word clouds to illustrate temporal content evolutions in a set of documents. Specifically, we use a trend chart to encode the overall semantic evolution of document content over time. In our work, semantic evolution of a document collection is modeled by varied significance of document content, represented by a set...
The parallel processing of verbal elements like textual labels, annotations etc. with non-verbal i.e. visual elements, provides maximum integration of human mind. But it is a very challenging task to generate hand-made like illustration labels in automated system. The paper represents a noble approach for dynamic external labeling of segmented 2D computer tomography (CT) slices. Various efficient...
Collaborative or "social" filtering has been successfully deployed over the years as a technique for analyzing large amounts of user-preference knowledge to predict interesting items for an individual user. The black-box nature of most collaborative filtering (CF) applications leave the user wondering how the system arrived at its recommendation. In this paper we introduce PeerChooser, a...
Introduced in 2005, the Voronoi treemap algorithm is an information visualization technique for displaying hierarchical data. Voronoi treemaps use weighted, centroidal Voronoi diagrams to create a nested tessellation of convex polygons. However, despite appealing qualities, few real world examples of Voronoi treemaps exist. In this paper, we present a multi-touch tabletop application called Involv...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.