Microsoft Technology Licensing, LLC

Benjamin L Chronister

George G Robertson

Bongshin Lee

Roland Lucas Fernandez

Murali R Krishnan

Christian Olaf Abeln

Stella Yick Chan

Matthew Jay Kotler

Curtis Glenn Wong

Danyel Aharon Fisher

David Francis Gainer

Jason Joseph Weber

Ian Michael Dunmore

Alexandre Gorev

Morten Holm-Peterson

Thomas Michael Casey

Gur Kimchi

Greg D Schechter

David Benjamin Lee

Daniel Cory

Brian Scott Ruble

Brian L Welcker

Ferhan Elvanoglu

B Scott Ruble

Timothy Garry Dwyer

Morten Holm-Petersen

Lev Boris Nachmanson

Terry Lucas

Barry James Givens

Ahmed K Kamal

Kelley T Maves

Gregory D Schechter

Mikkel Ronne Jakobsen

Olga Kulyk

Kipper V Jewsbury

The claimed subject matter relates to an architecture that can support a declarative model-based approach to designing, constructing, and rendering visualizations. By complying with a declarative descriptor, components can be readily customized by way of modifications to the model&#x2014;declaratively specifying suitable features, behaviors, appearances and so forth. The descriptors that conform to the model can also facilitate connecting to various data sources and performing data transformation operations. Moreover, the descriptors that conform to the model can declaratively specify relationships based upon a scene layout. Accordingly, the architecture can further describe the scene layout and provide features based upon the layout.

Declarative approach for visualization

Technologies are described herein for ranking visualization types. In order to rank the visualization types, visualization metadata is generated for each of the visualization types and data set metadata is generated for the data set. A suitability score is then computed based upon the visualization metadata and the data set metadata through the use of data mapping rules and chart selection rules. The visualization types are then ranked according to the computed scores. A user interface may then be displayed that includes visual representations corresponding to the visualization types that are ordered according to the ranking. One of the visual representations may then be selected to apply the corresponding visualization type to the data set.

Ranking visualization types based upon fitness for visualizing a data set

Various types of data can be collected into a data set and related content and/or related concepts across the data in the data set and/or across search histories can be displayed as a visual representation. The related content/concepts can be presented as a function of incremental revealing of relationships. After reviewing the visual representation, a user can customize the data set and relationships by specifically excluding a related data segment. The visual representation can be applied across multiple searches or other obtained data. Through interaction with the visual representation, a user can drill down into common linkages of the data to more narrowly focus on a subset of the data and/or to refocus a search result and/or to provide annotations.

Using visual techniques to manipulate data

The claimed subject matter relates to an architecture that can construct a map for summarizing analyses with respect to data included in a database. In addition, the architecture can display the map in a special canvas area. Generally, the map is a hub-and-spoke-style map in which a hub is associated with an entity (e.g., a related set of records) included in a database. Likewise, the spokes are typically representative of operations (e.g., filter, join, transform) that act upon the hub/entity from which it extends. The map can aid with open-ended analysis on complex databases by recording and ordering competing hypotheses and can also further collaborative efforts with respect to analysis.

Canvas approach for analytics

A proxy component system having dispatch proxies and object proxies is disclosed. The computerized system includes an operating system supporting component interfaces. In addition, the system includes a first interface to a target component, with the first interface having an early bound method. The system further includes a second interface to a proxy component, with the second interface having a late bound method. Also included in the system is a dispatch proxy operative to invoke the early bound method of the first interface from an invocation of the late bound method of the second interface.

Providing binding options for component interfaces

Growing community of inventors

Duvall, WA, United States of America

Benjamin L Chronister