Color-coded visual comparison of decision logic
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-009/44
G06N-007/02
출원번호
US-0201555
(2008-08-29)
등록번호
US-8266090
(2012-09-11)
우선권정보
IN-1847/DEL/2007 (2007-08-31)
발명자
/ 주소
Crawford, Stuart L.
Steele, Michael
Doshi, Navin
Tolmanov, Sergei
Kolipaka, Kashyap Babu Rao
Chhaparwal, Gaurav
Thorsen, Megan
Erickson, Chris
출원인 / 주소
Fair Isaac Corporation
대리인 / 주소
Mintz, Levin, Cohn, Ferris, Glovsky and Popeo, P.C.
인용정보
피인용 횟수 :
0인용 특허 :
68
초록▼
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. Th
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.
대표청구항▼
1. An article comprising a non-transitory machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising: receiving a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first se
1. An article comprising a non-transitory machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising: receiving a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first set of linked nodes arranged in a first form of decision logic, the second strategy graphically represented by a second set of linked nodes arranged in a second form of decision logic;converting the first set of linked nodes to a logically equivalent first modified set of linked nodes arranged in a third form of decision logic, the third form of decision logic being selected from a group consisting of: decision tree, a directed acyclic graph and an exception-based directed acyclic graph;converting the second set of linked nodes to a logically equivalent second modified set of linked nodes arranged in the third form of decision logic; and,simultaneously displaying a visual representation of the first modified set of linked nodes and the second modified set of linked nodes, the visual representation being color-coded to indicate the differences and similarities between the first modified set of linked nodes and the second modified set of linked nodes. 2. The article of claim 1, wherein the third form of decision logic is leveled. 3. The article of claim 2, wherein an order of levels in the third form of decision logic is configurable by a user. 4. The article of claim 2, wherein an order of levels in the third form of decision logic is selected to minimize a number of linked nodes in at least one of the first modified set of linked nodes and the second modified set of linked nodes. 5. The article of claim 1, wherein the third form of decision logic is read-once. 6. A method for implementation by one or more data processors comprising: receiving, by at least one data processor, a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first set of linked nodes arranged in a first form of decision logic, the second strategy graphically represented by a second set of linked nodes arranged in a second form of decision logic;converting, by at least one data processor, the first set of linked nodes to a logically equivalent first modified set of linked nodes arranged in a third form of decision logic, the third form of decision logic being selected from a group consisting of: decision tree, a directed acyclic graph and an exception-based directed acyclic graph;converting, by at least one data processor, the second set of linked nodes to a logically equivalent second modified set of linked nodes arranged in the third form of decision logic; and,simultaneously displaying, by at least one data processor, a visual representation of the first modified set of linked nodes and the second modified set of linked nodes, the visual representation being color-coded to indicate the differences and similarities between the first modified set of linked nodes and the second modified set of linked nodes. 7. The method of claim 6, wherein the third form of decision logic is leveled. 8. The method of claim 7, wherein an order of levels in the third form of decision logic is configurable by a user. 9. The method of claim 7, wherein an order of levels in the third form of decision logic is selected to minimize a number of linked nodes in at least one of the first modified set of linked nodes and the second modified set of linked nodes. 10. The method of claim 6, wherein the third form of decision logic is read-once. 11. A system comprising: one or more data processors;memory storing instructions, which when executed by at least one data processor, result in operations comprising: receiving a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first set of linked nodes arranged in a first form of decision logic, the second strategy graphically represented by a second set of linked nodes arranged in a second form of decision logic;converting the first set of linked nodes to a logically equivalent first modified set of linked nodes arranged in a third form of decision logic, the third form of decision logic being selected from a group consisting of: decision tree, a directed acyclic graph and an exception-based directed acyclic graph;converting the second set of linked nodes to a logically equivalent second modified set of linked nodes arranged in the third form of decision logic; and,simultaneously displaying a visual representation of the first modified set of linked nodes and the second modified set of linked nodes, the visual representation being color-coded to indicate the differences and similarities between the first modified set of linked nodes and the second modified set of linked nodes. 12. The system of claim 11, wherein the third form of decision logic is leveled. 13. The system of claim 12, wherein an order of levels in the third form of decision logic is configurable by a user. 14. The method of claim 12, wherein an order of levels in the third form of decision logic is selected to minimize a number of linked nodes in at least one of the first modified set of linked nodes and the second modified set of linked nodes. 15. The system of claim 11, wherein the third form of decision logic is read-once.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (68)
Boyle Valerie Y. (Wheaton IL) Lu Daryl C. (Freehold NJ) Sicherman George L. (Ocean NJ) Swanson Robert A. (Naperville IL), Apparatus to manipulate and examine the data structure that supports digit analysis in telecommunications call processin.
Huang Ying ; Desiraju Ramakrishna ; Begue Christophe ; Bakkalbasi Omer ; Chan Lap Mui Ann ; Bhaskaran Krishnakumar ; Federgruen Awi ; Krasinski Raymond J. ; Boey Peter, Decision support system for the management of an agile supply chain.
Turpin William M. (Santa Cruz CA) Brown Kevin L. (Scotts Valley CA) Bogrett Steven W. (Campbell CA), Development system with methods for maintaining data integrity of information stored as a data record in a database with.
Turpin William Monroe ; Brown Kevin Lane ; Bogrett Steven Ward, Graphical programming system and methods for assisting a user with creating screen objects on a screen device.
Amado Carlos Armando (444 Brickell Avenue #51-111 Miami FL 33131-2400), Method and apparatus for applying if-then-else rules to data sets in a relational data base and generating from the resu.
Strasnick Steven L. (Mountain View CA) Tesler Joel D. (Cupertino CA), Method and apparatus for displaying data within a three-dimensional information landscape.
Bereiter Thomas William ; Gan Doron, Method and system for displaying an expandable tree structure in a data processing system graphical user interface.
Kleinberg Jon Michael, Method and system for identifying authoritative information resources in an environment with content-based links between information resources.
Simoudis Evangelos (San Mateo CA) Livezey Brian K. (Menlo Park CA) Kerber Randy G. (San Jose CA), Method for generating predictive models in a computer system.
Kiernan Casey L. (Redmond WA) Jancke Gavin (Redmond WA), Method for separating a hierarchical tree control into one or more hierarchical child tree controls in a graphical user.
Ebert Justin C. ; Collins Scott H. ; Arnold John P. ; David Stephen L. ; Dwyer Susan D. ; Mills Michael D. ; Shanahan Patricia, Project organization and optimization tool and method of use thereof.
de l'Etraz Paris,ESX ; Fees James R.,BEX ; Hatcher Paul,GBX ; Bruderer Otto,CHX ; Fees Christina M.,GBX, System, method, and computer program product for providing relational patterns between entities.
Fox Frederick D. ; Pearson Douglas R. ; Caine Diane ; Kenney Andrew ; Morris Richard A.,GB2 ; Beck Steve A. ; Beck Cathy J. ; Chu Robert J., User interface for graphically displaying the impact of weather on managerial planning.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.