| Patent application number | Description | Published |
|---|
| 20080215411 | METHOD AND SYSTEM FOR PREDICTING RESOURCE REQUIREMENTS FOR SERVICE ENGAGEMENTS - A method and system for predicting resource requirements of a current service engagement by modeling records of past service engagements to create and classify templates of service resource usage. This is done by clustering past engagements into groups having similar time series requirements for service resources. A service resource template for the current service engagement is generated from a classified template by using characteristics of the current service engagement to select a group of which the current service engagement is a likely member. The corresponding template is then customized to fit the characteristics of the current service engagement. The invention may be implemented using Hidden Markov Models. An aspect of the invention is use of dynamic time warping to quantify dissimilarity between engagement sequences prior to fitting Hidden Markov Models. Another aspect of the invention is removal of outliers from the clustered groups. | 09-04-2008 |
| 20080219519 | Method and Apparatus for Rolling Enrollment for Signature Verification - Improved techniques are disclosed for adapting signature verification systems to natural signature variations. For example, a technique for adapting a signature verification system to variations in a signature of a user includes the following steps/operations. One or more signature samples are obtained from the user. The one or more obtained signature samples are submitted by the user as part of a regular authentication procedure associated with the signature verification system. A reference set of signature samples for the user is updated through selection of one or more signature samples from the obtained signature samples, such that the updated reference set is usable by the signature verification system for verifying subsequent signature samples attributed to the user. The selection of the one or more signature samples used to update the reference set is conditioned on a false rejection rate of the user when at least one obtained signature sample of the user is authenticated and on an identification check when no obtained signature sample is authenticated. | 09-11-2008 |
| 20080252499 | METHOD AND SYSTEM FOR THE COMPRESSION OF PROBABILITY TABLES - The present invention relates to a method, computer program product and system for the compression of a probability table and the reconstruction of one or more probability elements using the compressed data and method. After determining a probability table that is to be compressed, the probability table is compressed using a first probability table compression method, wherein the probability table compression method creates a first compressed probability table. The first compressed probability table contains a plurality of probability elements. Further, the probability table is compressed using a second probability table compression method, wherein the probability table compression method creates a second compressed probability table. The second compressed probability table containing a plurality of probability elements. A first probability element reconstructed using the first compressed probability table is thereafter merged with a second probability element reconstructed using the second compressed probability table in order to produce a merged probability element. | 10-16-2008 |
| 20090006173 | METHOD AND APPARATUS FOR IDENTIFYING AND USING HISTORICAL WORK PATTERNS TO BUILD/USE HIGH-PERFORMANCE PROJECT TEAMS SUBJECT TO CONSTRAINTS - A method for identifying and using historical work patterns to build high-performance project teams, in one aspect, may comprise identifying historical data associated with one or more past projects, determining from said historical data, one or more patterns in team member attributes that are correlated with at least one of an individual determined to be successful and a project determined to be successful, and generating one or more staffing plans based on said determined patterns. A system and program storage device for performing finctionalities of the method are also provided. | 01-01-2009 |
| 20090182771 | METHOD AND APPARATUS FOR INFORMATION BOOSTING IN RELATED BUT DISCONNECTED DATABASES - Method and apparatus for information boosting in related but disconnected databases, in one aspect, may comprise identifying disconnected data sources comprising data that are related or dependent on one another, determining one or more relationships and dependencies among the disconnected data, and refining the data sources based on one or more relationships and dependencies. | 07-16-2009 |
| 20100145961 | System and method for adaptive categorization for use with dynamic taxonomies - A system, method and computer program product provides a solution to a class of categorization problems using a semi-supervised clustering approach, the method employing performing a Soft Seeded k-means algorithm, which makes effective use of the side information provided by seeds with a wide range of confidence levels, even when they do not provide complete coverage of the pre-defined categories. The semi-supervised clustering is achieved through the introductions of a seed re-assignment penalty measure and model selection measure. | 06-10-2010 |
| 20110231336 | FORECASTING PRODUCT/SERVICE REALIZATION PROFILES - Past realization profiles can be used to predict future realization profiles using a similarity rubric that emphasizes relationships between the past realization profiles. That similarity rubric might involve techniques including manifold characterization of past realization profiles; predictive modeling; and/or matrix factorization. Realization profiles might be related to business projects and track features such as ongoing resource expenditure, revenues realized, or percentage project completion. Realization profiles might relate to other applications such as effectiveness of medical treatment. | 09-22-2011 |
| 20120030020 | COLLABORATIVE FILTERING ON SPARE DATASETS WITH MATRIX FACTORIZATIONS - A system, method and computer program product automatically present at least one product to at least one client for at least one possible purchase. The system applies a matrix factorization on a binary matrix X representing which clients purchased which products. The system optimizes zero-valued elements in the matrix X that correspond to unknown client-product affinities. The system constructs based on the optimization, a prediction matrix {circumflex over (X)} whose each element value represents a likelihood that a corresponding client purchases a corresponding product. The system identifies at least one client-product pair with the highest value in the matrix {circumflex over (X)}. The system recommends at least one product to at least one client according to the client-product pair with the highest value. | 02-02-2012 |
