Fair Isaac Corporation

Yahoo! Inc.

Navin Doshi

Kashyap Babu Rao Kolipaka

Stuart L Crawford

Gaurav Chhaparwal

Sergei Tolmanov

Michael Steele

Megan Thorsen

Prasun Kumar

Xing Zhao

Chris Erickson

Shouvick Mukherjee

Richard Schiffman

Shailesh Bhat

Subramanya Sharma

Mekin Maheshwari

Anoop Jain

A tree structure of plurality of information records arranged is recursively grown by splitting at least a portion of the records and by generating at least one predictive model. Related apparatus, systems, methods and computer program products are also described.

Automating growth and evaluation of segmentation trees

A system and method for drawing curved edges in graphs is disclosed. The system and method implement a heuristic algorithm to draw curved edges in graphs using Bezier curves. The algorithm assumes that every pair of nodes has a unique edge between them. It also assumes that the graph is 'leveled,' which means the nodes can be grouped such that all the nodes in a group are laid out at the same y location in a vertical layout. Any generic graph can be converted to a leveled graph, so the techniques described in the algorithm are applicable to any graph.

Techniques for drawing curved edges in graphs

Techniques for visualization of decision logic are provided. In one aspect, the techniques can be implemented by providing a control within a graphical user interface to a user. The control can display a plurality of graphical user interface elements corresponding to linked nodes within a hierarchical structure. An input identifying a selected graphical user interface element within the control can be generated by a user. A selected node within the hierarchical structure can be identified based on the selected graphical user interface element. In response to a request from a user, modifying an appearance of a subset of the linked nodes within the hierarchical structure based on a desired visualization criteria, the linked nodes within the hierarchical structure and the selected node.

Visualization of decision logic

A request to compare strategies is received. The first strategy can be graphically represented by a first set of linked nodes arranged in a first form of decision logic. The second strategy can be graphically represented by a second set of linked nodes arranged in a second form of decision logic. The first set of linked nodes can be converted to a first modified set of linked nodes arranged in a third form of decision logic. The second set of linked nodes can be converted to a second modified set of linked nodes arranged in the third form of decision logic. A color-coded visual representation of the first modified set of linked nodes and the second modified set of linked nodes can be provided to a user. Related apparatus, techniques, and articles are also described.

Color-coded visual comparison of decision logic

A system and method for drawing directed acyclic graphs is disclosed. In particular, an algorithm, as implemented in a method and system, to aesthetically layout directed acyclic graphs is presented. The algorithm includes methods to reduce the number of edge crossings and increase the number of straight edges in such drawings. The algorithm keeps short and straight edges wherever possible and gives preference to vertical edges. It also provides an edge-crossing reduction heuristic to refine the layout obtained after standard median heuristic layout, and further provides a method to focus on important paths in the graph through layout.

Algorithm for drawing directed acyclic graphs

Techniques are described for logically comparing strategies. In one aspect the strategies can be compared by receiving a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first set of linked nodes, the second strategy graphically represented by a second set of linked nodes, each set of linked nodes linking a root node to at least one action node; identifying a subset of linked nodes from at least one of the first set of linked nodes and the second set of linked nodes based on an equivalence of a first subset of the first set of linked nodes to a second subset of the second set of linked nodes; and, providing a visual depiction of the identified subset of the linked nodes to a user, the visual depiction corresponding to the equivalence of the first subset to the second subset.

Decision logic comparison and review

A mobile domain platform for subscribers (e.g. businesses, institutions, advertising agencies, partners, providers, individuals, and enterprises) to offer a text message based campaign to new or potential customers (users). A subscriber can create a mobile domain by selecting and registering at least one available keyword with a mobile domain platform for the subsequent processing of text messages sent to the platform which include one or more of the registered keywords. Also, the subscriber can register one or more keywords as a root for a mobile domain such that subsequent text messages sent to the mobile domain platform that include additional alphanumeric strings of text (root keyword plus one or more combinations of other predetermined keywords) can be automatically processed to enable one or more different actions. A mobile domain keyword is generally composed of one or more alphanumeric characters, and can be any one of a word, phrase, abbreviation, or character.

Platform for managing mobile domains and keyword-activated applications

The invention comprises an article and method for transforming a complex or large decision tree having multiple variables; multiple values for each variable; and, multiple outcomes for each combination of variables and their associated values, into a compact, efficient graphical representation to provided enhanced ease of use and interaction by a human user. More particularly, the invention comprises a computationally efficient method for transforming an input decision tree into an optimal compact representation by computing a particular ordering of variables in the decision tree that first leads to a Directed Acyclic Graph, or 'DAG,' with a minimum number of nodes. The method then converts the DAG into an exception-based DAG, or 'EDAG,' with exactly one exception, having an optimal, minimum number of nodes with increased comprehensibility for a user.

Growing community of inventors

Bengaluru, India

Navin Doshi