Abstract: The present invention relates to a method and apparatus for optimizing queries. The present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints.

Abstract: A mechanism for information retrieval in fully decentralized, distributed, peer-to-peer network systems. Peer profiles are aggregated and collected in real-time by each peer. Each peer uses and integrates knowledge that it collects during query-reply cycles for each future query received, thereby learning over time and making information retrieval a more intelligent and rapid process. Each peer then autonomously decides which of its peers are most likely to have an answer to a given query. A routine is provided for monitoring the messages and profiling each peer, building a local peer profile for each node exchanging messages in the peer-to-peer network based on messages passing through the node.

Abstract: The present invention relates to a method and apparatus for optimizing queries. The present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints.

Abstract: The present invention relates to a method and apparatus for optimizing queries. The present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints.

Abstract: Systems and methods of analyzing decision points in a business process are described. In one aspect, process execution data that is generated by a workflow management system during execution of one or more instances of a business process involving a set of one or more activities and a set of one or more decision points is accessed. Based upon the accessed process execution data, a predictive quantitative model including a set of one or more rules correlating context data at different stages of the business process with business process outcomes at one or more decision points in the business process is built. In another aspect, one or more rules correlating context data at different stages of the business process with business process outcomes at one or more decision points in the business process are presented to a user.

Abstract: A user can easily organize computerized document folders by associating a few sample documents in the document database with each folder. The present invention learns folder profiles based on the sample documents and moves the remaining documents into the folders accordingly. In this way, the user can construct new folders, or rearrange existing folders, or cause the computer to automatically rearrange and maintain the folders. This is particularly useful for managing a database of perhaps thousands of emails.

Abstract: A dense data-set mining system and method is provided that directly exploits all user-specified constraints including minimum support, minimum confidence, and a new constraint, known as minimum gap, which prunes any rule having conditions that do not contribute to its predictive accuracy. The method maintains efficiency even at low supports on data that is dense in the sense that many items appear with high frequency (e.g. relational data).

Abstract: Prospective customers may be selected for target making with respect to a particular product and market without the need to conduct designed marketing campaigns. A computer implemented process applies data mining techniques to databases containing records representing customer and overall market populations for the purpose of selecting market segments and prospective customers for targeted marketing.

Abstract: A computer-implemented method, apparatus, and article of manufacture that constructs graph models from logs of past, unstructured executions of the given process. The graph model so produced conforms to the dependencies and past executions present in the log. By providing graph models that capture the previous executions of the process, this technique allows easier introduction of a workflow system and evaluation and evolution of existing processes.

Abstract: A method for finding clusters of units in high-dimensional data having the steps of determining dense units in selected subspaces within a data space of the high-dimensional data, determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space, determining maximal regions covering each cluster of connected dense units, determining a minimal cover for each cluster of connected dense units, and identifying the minimal cover for each cluster of connected dense units.