IP Library Granted Patent US 10,248,669
Granted Patent B2
US 10,248,669 · App. 15/484,679 · Granted Apr 2, 2019

Methods and devices for customizing knowledge representation systems

Inventors: Peter Sweeney (Kitchener, CA); Ihab Francis Ilyas (Waterloo, CA)
Assignee: PRIMAL FUSION INC.
G06F17/30294G06F17/30292G06F17/30554G06N5/02G06N5/022Y04S10/54
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,248,669
App. No.
15/484,679
Granted
Apr 2, 2019
Kind
B2
Abstract

Techniques for analyzing and synthesizing complex knowledge representations (KRs) may utilize an atomic knowledge representation model including both an elemental data structure and knowledge processing rules stored as machine-readable data and/or programming instructions. One or more of the knowledge processing rules may be applied to analyze an input complex KR to deconstruct its complex concepts and/or concept relationships to elemental concepts and/or concept relationships to be included in the elemental data structure. One or more of the knowledge processing rules may be applied to synthesize an output complex KR from the stored elemental data structure in accordance with context information. Methods of populating an elemental data structure and methods of synthesizing complex KRs from the elemental data structure may depend on user models, context information, preference information, and/or preference models.

Claims (60)

1. A method comprising:

using at least one processor to perform:

providing, to a first set of one or more users, access to a first semantic network;

providing, to a second set of one or more users, access to a second semantic network, wherein at least a second subset of the second semantic network has a same topology as at least a first subset of the first semantic network; and

in response to identifying information corresponding to the second set of one or more users, modifying the second semantic network based, at least in part, on the information corresponding to the second set of one or more users by adding to the second semantic network one or more first elements not included in the first semantic network and/or removing from the second semantic network one or more second elements included in the first semantic network,

wherein each of the one or more first and second elements comprises a concept or a relationship, and

wherein the first and second semantic networks are implemented as computer-readable data structures, and wherein modifying the second semantic network is performed by one or more processors executing computer-readable instructions.

2. The method of claim 1 , wherein the modifying comprises:

using the information corresponding to the second set of one or more users to determine whether the one or more first elements are relevant to the second set of one or more users; and

in response to determining that the one or more first elements are relevant to the second set of one or more users, adding the one or more first elements to the second semantic network.

3. The method of claim 2 , wherein modifying the second semantic network further comprises:

using the information corresponding to the second set of one or more users to determine whether the one or more second elements are relevant to the second set of one or more users; and

in response to determining that the one or more second elements are not relevant to the second set of one or more users, removing the one or more second elements from the second semantic network.

4. The method of claim 1 , wherein the modifying comprises:

using the information corresponding to the second set of one or more users to determine whether the one or more first elements are associated with the second set of one or more users; and

in response to determining that the one or more first elements are associated with the second set of one or more users, adding the one or more first elements to the second semantic network.

5. The method of claim 4 , wherein the modifying further comprises:

using the information corresponding to the second set of one or more users to determine whether the one or more second elements are associated with the second set of one or more users; and

in response to determining that the one or more second elements are not associated with the second set of one or more users, removing the one or more second elements from the second semantic network.

6. The method of claim 4 , wherein using the information corresponding to the second set of one or more users to determine whether the one or more first elements are associated with the second set of one more users comprises:

estimating what portion of the second set of one or more users is associated with the one or more first elements; and

determining whether the portion of the second set of one or more users associated with the one or more first elements exceeds a threshold portion.

7. The method of claim 1 , wherein the method further comprises:

using information corresponding to a plurality of users to determine what portion of the plurality of users is associated with one or more third elements, wherein each of the one or more third elements comprises a concept or a relationship; and

in response to determining that the portion of the plurality of users associated with the one or more third elements exceeds a threshold portion, adding the one or more third elements to the first and second semantic networks.

8. The method of claim 7 , wherein the method further comprises:

in response to determining that the portion of the plurality of users associated with the one or more third elements is less than a threshold portion, removing the one or more third elements from the first and second semantic networks.

9. The method of claim 1 , further comprising:

in response to receiving a search query provided by the second set of one or more users, identifying search results matching the search query, wherein identifying the search results comprises searching the second semantic network; and

causing the search results to be presented to the second set of one or more users.

10. The method of claim 9 , wherein the information corresponding to the second set of one or more users comprises information regarding the search query provided by the second set of one or more users and/or information regarding an interaction of the second set of one or more users with the search results obtained by searching the second semantic network.

11. The method of claim 10 , wherein the interaction of the second set of one or more users with the search results comprises at least one member of the second set of one or more users selecting a subset of the search results.

12. The method of claim 9 , wherein the information corresponding to the second set of one or more users comprises at least one type of information selected from the group consisting of query information, demographic information, biographical information, employment information, familial information, preference information, interest information, financial information, geo-spatial information, browsing history information, website profile information, or social networking profile information associated with the at least one user.

13. The method of claim 10 , further comprising feeding back the information corresponding to the second set of one or more users from a search result output of a knowledge representation system to an information analysis input of the knowledge representation system.

14. The method of claim 11 , further comprising applying one or more rules to deconstruct the information corresponding to the second set of one or more users to obtain the one or more first elements.

15. The method of claim 1 , wherein the at least a first subset of the first semantic network and the at least a second subset of the second semantic network which have the same topology are implemented as a same computer-readable data structure.

16. The method of claim 1 , wherein prior to modifying the second semantic network, the first and second semantic networks are identical.

17. A knowledge representation system, comprising:

one or more processors; and

a memory unit configured to store instructions which, when executed by the one or more processors, cause the one or more processors to perform a method comprising:

providing, to a first set of one or more users, access to a first semantic network;

providing, to a second set of one or more users, access to a second semantic network, wherein at least a second subset of the second semantic network has a same topology as at least a first subset of the first semantic network; and

in response to identifying information corresponding to the second set of one or more users, modifying the second semantic network based, at least in part, on the information corresponding to the second set of one or more users by adding to the second semantic network one or more first elements not included in the first semantic network and/or removing from the second semantic network one or more second elements included in the first semantic network,

wherein each of the one or more first and second elements comprises a concept or a relationship, and

wherein the first and second semantic networks are implemented as computer-readable data structures, and wherein modifying the second semantic network is performed by one or more processors executing computer-readable instructions.

18. The knowledge representation system of claim 17 , wherein the modifying comprises:

using the information corresponding to the second set of one or more users to determine whether the one or more first elements are relevant to the second set of one or more users; and

in response to determining that the one or more first elements are relevant to the second set of one or more users, adding the one or more first element to the second semantic network.

19. The knowledge representation system of claim 17 , wherein the modifying comprises:

using the information corresponding to the second set of one or more users to determine whether the one or more first elements are associated with the second set of one or more users; and

in response to determining that the one or more first elements are associated with the second set of one or more users, adding the one or more first elements to the second semantic network.

20. The knowledge representation system of claim 17 , wherein the method further comprises:

in response to receiving a search query provided by the second set of one or more users, identifying search results matching the search query, wherein identifying the search results comprises searching the second semantic network; and

causing the search results to be presented to the second set of one or more users.

21. A non-transitory computer-readable storage medium storing processor-executable instructions which, when executed by one or more processors, cause the processors to perform a method comprising:

providing, to a first set of one or more users, access to a first semantic network;

providing, to a second set of one or more users, access to a second semantic network, wherein at least a second subset of the second semantic network has a same topology as at least a first subset of the first semantic network; and

in response to identifying information corresponding to the second set of one or more users, modifying the second semantic network based, at least in part, on the information corresponding to the second set of one or more users by adding to the second semantic network one or more first elements not included in the first semantic network and/or removing from the second semantic network one or more second elements included in the first semantic network,

wherein each of the one or more first and second elements comprises a concept or a relationship, and

wherein the first and second semantic networks are implemented as computer-readable data structures, and wherein modifying the second semantic network is performed by one or more processors executing computer-readable instructions.

Assignments (3)
RELEASE OF SECURITY INTEREST Recorded Jan 2, 2025
From: BUSINESS DEVELOPMENT BANK OF CANADA
To: PRIMAL FUSION INC.
Reel/Frame 069720/0988 →
SECURITY INTEREST Recorded Apr 24, 2023
From: PRIMAL FUSION INC.
To: BUSINESS DEVELOPMENT BANK OF CANADA
Reel/Frame 063425/0274 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 25, 2018
From: SWEENEY, PETER JOSEPH; ILYAS, IHAB FRANCIS
To: PRIMAL FUSION INC.
Reel/Frame 045634/0219 →
Continuity (24)
Continuation 15403761 · Jan 11, 2017
Continuation 14961819 · Dec 7, 2015
Continuation 13844009 · Mar 15, 2013
Continuation In Part 13609218 · Sep 10, 2012
Continuation In Part 13345637 · Jan 6, 2012
Continuation In Part 13165423 · Jun 21, 2011
Continuation In Part 13340792 · Dec 30, 2011
Continuation In Part 13609223 · Sep 10, 2012
Continuation In Part 13345637 · Jan 6, 2012
Continuation In Part 13340792 · Dec 30, 2011
Continuation In Part 13609225 · Sep 10, 2012
Continuation In Part 13345637 · Jan 6, 2012
Continuation In Part 13340792 · Dec 30, 2011
Provisional Application 61751571 · Jan 11, 2013
Provisional Application 61751594 · Jan 11, 2013
Provisional Application 61751623 · Jan 11, 2013
Provisional Application 61751659 · Jan 11, 2013
Provisional Application 61532330 · Sep 8, 2011
Provisional Application 61357266 · Jun 22, 2010
Provisional Application 61498899 · Jun 20, 2011
Provisional Application 61471964 · Apr 5, 2011
Provisional Application 61430810 · Jan 7, 2011
Provisional Application 61430836 · Jan 7, 2011
Related Publication 20170220607A1 · Aug 3, 2017
Cited By (1)
US 12,566,804