Abstract: The invention provides a method and system for visualization of a data set, the method comprises: dividing the data set into a plurality of information layers based on different information dimensions; and visually processing the plurality of information layers based on different information dimensions, respectively, in order to present respective views of the plurality of information layers. In the present invention, by visualizing the data set through presenting different overviews of the data set from different information dimensions, respectively, the presentation of comprehensive information of the data set to a data set analyst is ensured while distortion of presented contents as well as visual clutter are prevented.

Abstract: Visualizing social media conflict is provided. Textual messages by a set of human users connected via a network regarding a particular topic are collected. Active users in the set of human users authoring a number of textual messages regarding the particular topic more than a threshold number of textual messages are selected. Keywords are selected that occur more than a threshold number of times within the textual messages regarding the particular topic. A sentiment score is computed for each of the keywords occurring more than the threshold number of times within the textual messages using a keyword co-occurrence graph. A sentiment of each of the active users is determined based on the computed sentiment score of each of the selected keywords that are authored by a particular active user.

Abstract: A system and method for analyzing chemical data including a processor and one or more classifiers, stored in memory and coupled to the processor, which further includes an indication predictive module configured to predict whether a given chemical treats a particular indication or not and a side effect predictive module configured to predict whether a given chemical causes a side-effect or not. A correlation engine is configured to determine one or more correlations between one or more indications and one or more side effects for the given chemical and a visualization tool is configured to analyze the one or more correlations and to output results of the analysis.

Abstract: A system and method for analyzing chemical data including a processor and one or more classifiers, stored in memory and coupled to the processor, which further includes an indication predictive module configured to predict whether a given chemical treats a particular indication or not and a side effect predictive module configured to predict whether a given chemical causes a side-effect or not. A correlation engine is configured to determine one or more correlations between one or more indications and one or more side effects for the given chemical and a visualization tool is configured to analyze the one or more correlations and to output results of the analysis.

Abstract: The invention provides a method and system for visualization of a data set, the method comprises: dividing the data set into a plurality of information layers based on different information dimensions; and visually processing the plurality of information layers based on different information dimensions, respectively, in order to present respective views of the plurality of information layers. In the present invention, by visualizing the data set through presenting different overviews of the data set from different information dimensions, respectively, the presentation of comprehensive information of the data set to a data set analyst is ensured while distortion of presented contents as well as visual clutter are prevented.

Abstract: A layout method in a display area for multiple graph components in a dynamic network. The multiple graph components are sorted according to their importance into a first subset S1 and a second subset S2 according to the order of their importance. The first subset S1 is divided into an upper subset Cp including only the most important graph component and a lower subset Cm. The display area is divided into display portions S1? and S2? proportionally according to the importance values of the first subset S1 and the second subset S2. Display portion S1? is divided into display portions Cp? and Cm? proportionally according to the importance values of the upper subset Cp and the lower subset Cm. The first division and the second division and the corresponding division of the display area are executed iteratively until the aspect ratio of display portion Cp? is close to 1.

Abstract: A method for generating 3D carousel visualization of large-scale tree data, which comprises the steps of: receiving a user's selection of a node in the carousel; according to the radius of a sub-carousel corresponding to the user-selected node and the radius of a carousel at which the selected node is located, judging whether or not the sub-carousel can be expanded at the carousel at which the selected node is located; expanding the sub-carousel at the carousel at which the selected node is located, if it is determined that the sub-carousel can be expanded at the carousel at which the selected node is located. A device capable of implementing the method is provided. The number of carousel levels visualized on a visualization device can be adjusted dynamically, and the visualization of a focus becomes more prominent, and relationships between nodes at each level of the tree data visualization get more apparent.

Abstract: A method and apparatus of animation planning for a dynamic graph is provided. A first method includes grouping changed nodes into atomic partitions according to the relationships between the changed nodes and existing nodes. The next step is clustering the atomic partitions according to clustering distances between the atomic partitions to generate a running list for planning animation of node changes in the dynamic graph. The running list includes elements selected from the group consisting of clusters of atomic partitions and atomic partitions. The present invention is able to plan a multi-stage animation demonstration of changes of a dynamic graph and has a improved readability and animation speed.

Abstract: A method and an apparatus for identifying sub-graphs similar to a sample sub-graph from a network, in particular for identifying similar community structures from a network, are disclosed. Specifically, when a sample sub-graph is a community structure, it usually contains a plurality of nodes densely associated with each other. The method proposes first screening the network via key nodes of community structures so as to find sub-graph candidates that are potentially similar to the sample sub-graph, then strictly comparing the sub-graph candidates with the sample sub-graph to find similar sub-graphs of the sample sub-graph.

Abstract: A method and an apparatus for animating transition among a dynamic graph series including a preceding graph and a succeeding graph which are temporally sequentially displayed. The method includes: selecting an unchanged node which is the nearest to a removed node and merging through animation the removed node with the unchanged node, thereby animating removal of the removed node; and selecting an unchanged node which is the nearest to an added node and splitting through animation the added node from the unchanged node, thereby animating addition of the added node. During the animation, the moving distances of the nodes can be shortened, and the crossing of movement paths and the crossing of graph edges can be prevented during the movement of the nodes, thereby visualizing smoothly and clearly transition among dynamic graph series.

Abstract: Visualization techniques are provided for a clustered multidimensional dataset. A data set is visualized by obtaining a clustering of a multidimensional dataset comprising a plurality of entities, wherein the entities are instances of a particular concept and wherein each entity comprises a plurality of features; and generating an icon for at least one of the entities, the icon having a plurality of regions, wherein each region corresponds to one of the features of the at least one entity, and wherein a size of each region is based on a value of the corresponding feature. Each icon can convey statistical measures. A stabilized Voronoi-based icon layout algorithm is optionally employed. Icons can be embedded in a visualization of the multidimensional dataset. A hierarchical encoding scheme can be employed to encode a data cluster into the icon, such as a hierarchy of cluster, feature type and entity.

Abstract: A multifaceted visualization technique is provided for visually exploring topics in multi-relational data. A data set is visualized by obtaining the data set comprising a plurality of entities, facets and relations, wherein the entities are instances of a particular concept, the facets are classes of entities and the relations are connections between pairs of the entities; obtaining a selection of one of the facets as a topic facet, wherein entities in the topic facet are topic entities, wherein facets in the plurality of facets other than the topic facet are keyword facets; generating a visualization comprising the topic entities rendered as nodes arranged within a central region; and generating one or more surrounding shapes around the central region, wherein each of the surrounding shapes corresponds to one of the keyword facets, wherein entities within the corresponding keyword facet of a given one of the surrounding shapes are rendered as keyword entities.

Abstract: Methods and apparatus are provided for multi-faceted visualization of rich text corpora. A data set comprising a plurality of entities, facets and relations is visualized by generating a visualization of a plurality of the facets in the data set, wherein the visualization indicates connections along the plurality of the facets in a single view using multi-faceted edges. The entities are instances of a particular concept, the facets are classes of entities and the relations are connections between pairs of the entities. A compound node comprises a representation of a primary entity, surrounded by representations of one or more secondary entities connected by one or more external relations. The internal relations can be represented as edges connecting two facet nodes from different compound nodes and a number of crossings of the edges can be reduced by adjusting a position order of facet nodes.

Abstract: The visibility of a treemap is improved by offsetting the area of a parent node relative to a bounding box containing all of its child nodes while constructing the treemap, so that a part of the bounding box lies outside the area of the parent node, and the area of each child node in the bounding box is located entirely or partially within the area of the parent node. The present invention highlights the parent-child relationships in the treemap with a cascading effect to make the structural information therein more apparent and easier to recognize.

Abstract: A layout method in a display area for multiple graph components in a dynamic network. The multiple graph components are sorted according to their importance into a first subset S1 and a second subset S2 according to the order of their importance. The first subset S1 is divided into an upper subset Cp including only the most important graph component and a lower subset Cm. The display area is divided into display portions S1? and S2? proportionally according to the importance values of the first subset S1 and the second subset S2. Display portion S1? is divided into display portions Cp? and Cm? proportionally according to the importance values of the upper subset Cp and the lower subset Cm. The first division and the second division and the corresponding division of the display area are executed iteratively until the aspect ratio of display portion Cp? is close to 1.

Abstract: A method and apparatus of animation planning for a dynamic graph is provided. A first method includes grouping changed nodes into atomic partitions according to the relationships between the changed nodes and existing nodes. The next step is clustering the atomic partitions according to clustering distances between the atomic partitions to generate a running list for planning animation of node changes in the dynamic graph. The running list includes elements selected from the group consisting of clusters of atomic partitions and atomic partitions. The present invention is able to plan a multi-stage animation demonstration of changes of a dynamic graph and has a improved readability and animation speed.

Abstract: A social network advertises to its members with engagement interfaces. An engagement interface comprises a call to action and a link to perform the action within the social network from within the engagement interface. Responsive to a user selection of the link to perform the action, the engagement interface modifies one or more objects within the social network associated with the call to action according to the selection of the link to perform the action. The engagement interface may be refreshed on the user's screen to indicate to the user that the action has been performed. An engagement interface may also be presented to a user from the social network or from an external system apart from the social network.

Abstract: Methods and apparatus are provided for intelligent exploratory visualization and analysis. A semantics-based client-server application architecture is provided that enables interactive visualization and analysis applications over the web. From the client perspective, user activities are observed and the client determines if a sequence of user activities comprises one or more predefined semantics-based user actions. Semantics-based action descriptor are then sent to the server, optionally with any related parameters, and a response is then received from the server. From the server perspective, one or more semantics-based action descriptors are received from the client with an action type selected from a predefined set of types, wherein the semantics-based action descriptors are based on a sequence of activities of a user. The server processes the semantics-based action descriptors and sends a response to the client in response to the one or more semantics-based action descriptors.

Abstract: A method and an apparatus for animating transition among a dynamic graph series including a preceding graph and a succeeding graph which are temporally sequentially displayed. The method includes: selecting an unchanged node which is the nearest to a removed node and merging through animation the removed node with the unchanged node, thereby animating removal of the removed node; and selecting an unchanged node which is the nearest to an added node and splitting through animation the added node from the unchanged node, thereby animating addition of the added node. During the animation, the moving distances of the nodes can be shortened, and the crossing of movement paths and the crossing of graph edges can be prevented during the movement of the nodes, thereby visualizing smoothly and clearly transition among dynamic graph series.

Abstract: A method and an apparatus for identifying sub-graphs similar to a sample sub-graph from a network, in particular for identifying similar community structures from a network, are disclosed. Specifically, when a sample sub-graph is a community structure, it usually contains a plurality of nodes densely associated with each other. The method proposes first screening the network via key nodes of community structures so as to find sub-graph candidates that are potentially similar to the sample sub-graph, then strictly comparing the sub-graph candidates with the sample sub-graph to find similar sub-graphs of the sample sub-graph.