Abstract: Visualization of high-dimensional data sets is disclosed, particularly the display of a network model for a data set. The network, such as a dependency or a Bayesian network, has a number of nodes having dependencies thereamong. The network can be displayed items and connections, corresponding to nodes and dependencies, respectively. Selection of a particular item in one embodiment results in the display of the local distribution associated with the node for the item. In one embodiment, only a predetermined number of the items are shown, such as only the items representing the most popular nodes. Furthermore, in one embodiment, in response to receiving a user input, a sub-set of the connections is displayed, proportional to the user input.

Abstract: A system that incorporates an interactive graphical user interface for visualizing clusters (categories) and segments (summarized clusters) of data. Specifically, the system automatically categorizes incoming case data into clusters, summarizes those clusters into segments, determines similarity measures for the segments, scores the selected segments through the similarity measures, and then forms and visually depicts hierarchical organizations of those selected clusters. The system also automatically and dynamically reduces, as necessary, a depth of the hierarchical organization, through elimination of unnecessary hierarchical levels and inter-nodal links, based on similarity measures of segments or segment groups. Attribute/value data that tends to meaningfully characterize each segment is also scored, rank ordered based on normalized scores, and then graphically displayed.

Abstract: Optimizing storage and retrieval of monitoring data. In one aspect of this disclosure, there is a system, method and computer readable medium that stores instructions for instructing a computer system, to optimize storage and retrieval of data. In this embodiment, a transfer manager component acquires the data from an archive and assigns predetermined storage values to specified parameters that form the data structure of the acquired data. A database stores the data acquired by the transfer manager component in accordance with the predetermined storage values. A middle tier component extracts the data in the database and interpolates the data in accordance with the predetermined storage values.

Abstract: The system and method of the present invention automatically extracts the top k recommendations of objects, such as topics, items, products, books, movies, food, drinks, etc., from a local probabilistic recommendation system. Unlike prior systems, the present invention accomplishes the extraction of the top k recommendations of objects without examining a probability for every object that can be recommended. Further, the system and method of the present invention is capable of being implemented using probabilistic recommendation systems based on any conventional type of probabilistic distribution or machine learning technique, including, for example, decision trees and Bayesian networks.

Abstract: Determination of a distribution of a numeric variable. In one embodiment, a data set is first input. The data set has a plurality of records. Each record has a value for each of a plurality of raw non-transactional variables. The plurality of raw non-transactional variables includes a numeric variable. It is determined whether a Gaussian or a log-Gaussian distribution better predicts the numeric variable, based on the plurality of records. This determination is then output.

Abstract: Determining the near-optimal block size for incremental-type expectation maximization (EM) algorithms is disclosed. Block size is determined based on the novel insight that the speed increase resulting from using an incremental-type EM algorithm as opposed to the standard EM algorithm is roughly the same for a given range of block sizes. Furthermore, this block size can be determined by an initial version of the EM algorithm that does not reach convergence. For a current block size, the speed increase is determined, and if the speed increase is the greatest determined so far, the current block size is set as the target block size. This process is repeated for new block sizes, until no new block sizes can be determined.

Abstract: Generation of a model for raw variables from a model for cooked variables. In one embodiment, a first data model for a plurality of cooked transactional variables is input. The cooked transactional variables have been abstracted from raw transactional variables, where the latter variables are based on a data set comprising a plurality of records, each record having a value for each raw transactional variables. A type of the first model is determined, and a second data model, for the plurality of raw transactional variables, is generated based on the first data model and the type of the first data model. The second data model is then output.

Abstract: An architecture for automated data analysis. In one embodiment, a computerized system comprising an automated problem formulation layer, a first learning engine, and a second learning engine. The automated problem formulation layer receives a data set. The data set has a plurality of records, where each record has a value for each of a plurality of raw transactional variables. The layer abstracts the raw transactional variables into cooked transactional variables. The first learning engine generates a model for the cooked transactional variables, while the second learning engine generates a model for the raw transactional variables.

Abstract: A method and a system for abstracting cooked variables from raw variables. In one embodiment, a data set that has a plurality of records is input into a system, where each record has a value for each of a plurality of raw transactional variables. These variables are organized into a hierarchy of nodes. The raw transactional variables are abstracted into a lesser number of cooked transactional variables, and the cooked transactional variables are output.

Abstract: An intelligent user assistance system is disclosed. The system is constructed using a reasoning model to determine the probability of a user's intentions, goals, or informational needs in the context of a software program. This is accomplished through analysis of information about the user's actions, the program state, and spoken words. The system monitors user interaction with the software program and applies probabilistic reasoning to sense that the user may need assistance in using a particular feature or to accomplish a specific task. The inference system accesses a thorough and updateable user profile system to continually check for competencies and changes assistance that is given based on the competencies.

Abstract: Automated methods and apparatus for synchronizing audio and text data, e.g., in the form of electronic files, representing audio and text expressions of the same work or information are described. Also described are automated methods of detecting errors and other discrepancies between the audio and text versions of the same work. A speech recognition operation is performed on the audio data initially using a speaker independent acoustic model. The recognized text in addition to audio time stamps are produced by the speech recognition operation. The recognized text is compared to the text in text data to identify correctly recognized words. The acoustic model is then retrained using the correctly recognized text and corresponding audio segments from the audio data transforming the initial acoustic model into a speaker trained acoustic model. The retrained acoustic model is then used to perform an additional speech recognition operation on the audio data.

Abstract: A general event composing and monitoring system that allows high-level events to be created from combinations of low-level events. An event specification tool allows for rapid development of a general event processor that creates high-level events from combinations of user actions. The event system, in combination with a reasoning system, is able to monitor and perform inference about several classes of events for a variety of purposes. The various classes of events include the current context, the state of key data structures in a program, general sequences of user inputs, including actions with a mouse-controlled cursor while interacting with a graphical user interface, words typed in free-text queries for assistance, visual information about users, such as gaze and gesture information, and speech information.

Abstract: Automated methods and apparatus for synchronizing audio and text data, e.g., in the form of electronic files, representing audio and text expressions of the same work or information are described. A statistical language model is generated from the text data. A speech recognition operation is then performed on the audio data using the generated language model and a speaker independent acoustic model. Silence is modeled as a word which can be recognized. The speech recognition operation produces a time indexed set of recognized words some of which may be silence. The recognized words are globally aligned with the words in the text data. Recognized periods of silence, which correspond to expected periods of silence, and are adjoined by one or more correctly recognized words are identified as points where the text and audio files should be synchronized, e.g., by the insertion of bi-directional pointers.

Abstract: A general event composing and monitoring system that allows high-level events to be created from combinations of low-level events. An event specification tool allows for rapid development of a general event processor that creates high-level events from combinations of user actions. The event system, in combination with a reasoning system, is able to monitor and perform inference about several classes of events for a variety of purposes. The various classes of events include the current context, the state of key data structures in a program, general sequences of user inputs, including actions with a mouse-controlled cursor while interacting with a graphical user interface, words typed in free-text queries for assistance, visual information about users, such as gaze and gesture information, and speech information.

Abstract: A system that provides for the graphic visualization of the categories of a collection of records. The graphic visualization is referred to as “category graph.” The system optionally displays the category graph as a “similarity graph” or a “hierarchical map.” When displaying a category graph, the system displays a graphic representation of each category. The system displays the category graph as a similarity graph or a hierarchical map in a way that visually illustrates the similarity between categories. The display of a category graph allows a data analyst to better understand the similarity and dissimilarity between categories. A similarity graph includes a node for each category and an arc connecting nodes representing categories whose similarity is above a threshold. A hierarchical map is a tree structure that includes a node for each base category along with nodes representing combinations of similar categories.

Abstract: A technique, specifically a method and apparatus that implements the method, which through a probabilistic classifier (370) and, for a given recipient, detects electronic mail (e-mail) messages, in an incoming message stream, which that recipient is likely to consider "junk". Specifically, the invention discriminates message content for that recipient, through a probabilistic classifier (e.g., a support vector machine) trained on prior content classifications. Through a resulting quantitative probability measure, i.e., an output confidence level, produced by the classifier for each message and subsequently compared against a predefined threshold, that message is classified as either, e.g., spam or legitimate mail, and, e.g., then stored in a corresponding folder (223, 227) for subsequent retrieval by and display to the recipient.

Abstract: A system and method for determining a workload placed on a target computer system during execution of a specified computer program. The system receives a set of performance measurements representing the performance of the target computer system during execution of the specified computer program. The system then identifies a plurality of workloads and for each identified workload, uses a model of the target computer system to predict a set of performance measurements that would results when a computer program that places the identified workload on the target computer system is executed. The system selects the identified workload whose set of predicted performance measurements most closely matches the received set of performance measurements as the determined workload that was place on the target computer system during execution of the specified computer program.

Abstract: An event composing and monitoring system that allows high-level events to be created from combinations of low-level events. An event specification tool, contained in the system, allows for rapidly developing a general event processor that creates high-level events from combinations of user actions. An event system, in combination with an inference system, monitors and infers, for various purposes, about several classes of events including: current program context; state of key data structures; user input sequences, including actions with a mouse-controlled cursor while interacting with a graphical user interface; words typed in free-text help queries; visual user information, such as gaze and gesture information; and user speech information.

Abstract: Information retrieval methods and apparatus which involve: 1) the generation of estimates regarding the probability that items included in search results are already known to the user and 2) the use of such knowledge probability estimates to influence the ranking of search results, are described. By discounting the ranking, or adjusting ranking values generated by a known search engine as a function of the knowledge probability estimates, the present invention reduces or eliminates the risk of locating known information near the top of a list of search results. This is advantageous since known information is generally of little interest to a user. In various embodiments the popularity of an item is used to estimate the probability that the item is already known to a user.

Abstract: An improved belief network generator is provided. A belief network is generated utilizing expert knowledge retrieved from an expert in a given field of expertise and empirical data reflecting observations made in the given field of the expert. In addition to utilizing expert knowledge and empirical data, the belief network generator provides for the use of continuous variables in the generated belief network and missing data in the empirical data.