Knowledge-based e-catalog procurement system and method

• US 8,249,885 B2
• Filed: 08/08/2002
• Issued: 08/21/2012
• Est. Priority Date: 08/08/2001
• Status: Expired due to Fees

• Current Assignee: Berkowitz, Gary Charles, Brian Michael Roe, Dmitry Serebrennikov, Wurtz, Charles Christopher
• Original Assignee: Berkowitz, Gary Charles, Brian Michael Roe, Dmitry Serebrennikov, Wurtz, Charles Christopher
• Inventors: Berkowitz, Gary Charles, Serebrennikov, Dmitry, Roe, Brian Michael, Wurtz, Charles Christopher
• Primary Examiner(s): SHEIKH, ASFAND M
• Application Number:
  US10/215,109
• Publication Number:
  US 20030061122A1
• Time in Patent Office: 3,666 Days
• Field of Search: 705/27
• US Class Current: 705/1.1
• CPC Class Codes: G06F 16/954 Navigation, e.g. using categorised browsing
• CPC Class Codes: G06Q 30/06 Buying, selling or leasing transactions
• CPC Class Codes: G06Q 30/0609 Buyer or seller confidence or verification
• CPC Class Codes: G06Q 30/0613 Third-party assisted
• CPC Class Codes: G06Q 30/0625 Directed, with specific intent or strategy
• CPC Class Codes: G06Q 30/0633 Lists, e.g. purchase orders, compilation or processing

Abstract

A flexible, intelligent electronic procurement method and system that emulates and learns from the adaptive behavior of a user trying to find a product in an electronic catalog. In contrast to existing methods and systems, the invention allows for searching heterogeneous catalogs in virtually any format, and does not require pre-defined hierarchies, nor the pre-loading of vendor catalog contents, nor the scrubbing of vendor data. It does not impose fixed structures on the user, it does not require the user to start ‘from scratch’ when looking for a new item, and it does not force the user to think like someone else. Instead, the invention allows the user to choose his own way to navigate catalogs of items, and then, by remembering successful search scenarios, and storing that knowledge in a dynamic, growing database (or ‘forest’) of collected search paths, or ‘find-trees’, the invention grows and improves, that is, it evolves organically over time. As the collection of find-trees can be accessed by other users, the utility of the invention increases over time once implemented in a given environment. Further, the invention is able to do this in a time- and space-efficient manner (that is, without the forest growing too tangled, dense or large) not only because of its method and architecture, but also through the use of autonomous background processes that continually prune and update the tree structures for optimum storage and navigation.

Claims

1. A computer-implemented method for locating information in a collection of one or more electronic data stores, including:

constructing by a processor a find-tree, which includes a tree composed of nodes and branches, having a root node, and some number of intermediate and terminal or leaf nodes, wherein each node denotes a single term used in a search, that is, in an attempt to locate information in said collection of one or more electronic data stores, and each branch denotes a connection between two nodes, such that each path in said find-tree represents a sequence of terms used in said search, and said find-tree represents one or more paths taken in said search, including alternative paths to the same information, partial or incomplete paths, and paths that lead to different information, so that said find-tree depicts one or more sequences of terms, including the intermediate steps, in which each sequence comprises a search path employed in finding, or attempting to find, information in said collection of electronic data stores;

retrieving and navigating an existing said find-tree or any previous tree to locate desired information in said electronic data stores; and

changing, augmenting or extending said find-tree at any point in the process.

2. The method of claim 1, whereby said find-trees include partial search paths, and complete search paths of varying lengths that terminate in nodes representing information, and are stored in a computer system.

3. The method of claim 2, whereby said stored find-trees are collected in shared data stores representing a master tree space that contains find-trees and groups of find-trees associated by criteria that define the relation among find-trees in the group, and enables at least one of storage and retrieval of the evolving connections between related found information, wherein said collection of electronic data stores include said shared data stores.

4. The method of claim 3, wherein the method further includes, for each said find-tree in said master tree space:

removing branches;

repairing broken connections, whereby leaf nodes that no longer correspond to found information are either removed or associated with other information;

merging branches and trees that were created taking the same path to the same information, or that represent synonymous search terms, or both.

5. The method of claim 1, wherein the method further includes presenting a set of suggested search terms, wherein such terms are culled from said collection of electronic data stores being searched, including said find trees, and a set of candidate terms is constructed based upon one or more of:

the characteristics of nodes in said find-trees that a term may be associated with, their relative proximity to other search terms, and the number of occurrences of said candidate terms, in said electronic data stores being searched.

6. The method of claim 5, wherein the presenting of said suggested search terms includes:

receiving an initial query (search-term expression) composed of search terms linked by operators including one or more of AND, OR and NOT;

expanding the initial query expression with one or more of;

synonyms, acronyms and antonyms drawn from an evolving master dictionary, and filtered by context-dependent relevance;

executing the said expanded query against at least one of said master tree space and said electronic data-stores.

7. The method of claim 5, wherein the presenting of said suggested search terms includes building said set of candidate terms by filtering retrieved information by a configurable relevance-threshold, determined by frequency of occurrence of search terms in the retrieved information.

8. The method of claim 5, wherein the presenting of said suggested search terms further includes:

filtering said set of candidate terms to remove duplicates and kill-list entries;

filtering said set of candidate terms by excluding terms with an average minimum proximity to search terms greater than a configurable threshold.

9. The method of claim 5, wherein the presenting of said suggested search terms further includes augmenting said set of candidate terms based upon the characteristics of nodes in said find-trees that a term may be associated with.

10. The method of claim 1, whereby information from said collection of electronic data stores is at least one of acquired, maintained or updated by interacting with said collection of electronic data stores, and storing retrieved information in a separate data cache, wherein said collection of electronic data stores includes said separate data cache.

11. The method of claim 10, whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by:

exploring said collection of electronic data stores for selected information;

storing retrieved information in said separate data cache.

12. The method of claim 10, whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by:

accessing information in said collection of electronic data stores about similar information previously available in said separate data cache;

accessing information in said collection of electronic data stores, to check for any changes from information previously available in said separate data cache.

13. The method of claim 10, whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by:

accessing information in said collection of electronic data stores about similar information previously available in said master tree space;

accessing information in said collection of electronic data stores, to check for any changes from information previously available in said master tree space.

14. The method of claim 10, whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by synchronizing information in said separate data cache with new or changed information.

15. The method of claim 10, whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by synchronizing information in said master tree space with new or changed information.

16. A system for locating information in a collection of one or more electronic data stores, the system comprising:

a first storage device for storing information retrieved from said electronic data stores,

and for storing a plurality of previously submitted find-trees;

a processor connected to the first storage device, with the processor configured for;

constructing a find-tree, which includes a tree composed of nodes and branches, having a root node, and some number of intermediate and terminal or leaf nodes, wherein each node denotes a single term used in a search, that is, in an attempt to locate information in said collection of one or more electronic data stores, and each branch denotes a connection between two nodes, such that each path in said find-tree represents a sequence of terms used in said search, and said find-tree represents one or more paths taken in said search, including alternative paths to the same information, partial or incomplete paths, and paths that lead to different information, so that said find-tree depicts one or more sequences of terms, including the intermediate steps, in which each sequence comprises a search path employed in finding, or attempting to find, information in said collection of electronic data stores;

retrieving and navigating an existing said find-tree or any previous tree to locate desired information in said electronic data stores; and

changing, augmenting or extending said find-tree at any point in the process.

17. The system of claim 16, wherein the processor is configured for:

storing in a computer system said find-trees, including partial search paths, and complete search paths of varying lengths that terminate in nodes representing information.

18. The system of claim 17, wherein the processor is configured for:

collecting said stored find-trees in shared data stores representing a master tree space that contains find-trees and groups of find-trees associated by criteria that define the relation among find-trees in the group, and enables at least one of storage and retrieval of the evolving connections between related found information, wherein said collection of electronic data stores include said shared data stores.

19. The system of claim 18, wherein the processor is configured whereby the operations of the processor further include, for each said find-tree in said master tree space:

removing branches;

repairing broken connections, whereby leaf nodes that no longer correspond to found information are either removed or associated with other information;

merging branches and trees that were created taking the same path to the same information, or that represent synonymous search terms, or both.

20. The system of claim 16, wherein the processor is configured for:

presenting a set of said suggested search terms, wherein such terms are culled from said collection of electronic data stores being searched, including said find trees, and a set of candidate terms is constructed based upon one or more of;

the characteristics of nodes in said find-trees that a term may be associated with, their relative proximity to other search terms, and the number of occurrences of said candidate terms, in said electronic data stores being searched.

21. The system of claim 20, wherein the processor is further configured for:

receiving an initial query (search-term expression) composed of search terms linked by operators including one or more of AND, OR and NOT;

expanding the initial query expression with one or more of;

synonyms, acronyms and antonyms drawn from an evolving master dictionary, and filtered by context-dependent relevance;

executing the said expanded query against at least one of said master tree space and said electronic data-stores.

22. The system of claim 20, wherein the processor is configured whereby:

the presenting of said suggested search terms includes building said set of candidate terms by filtering retrieved information by a configurable relevance-threshold, determined by frequency of occurrence of search terms in the retrieved information.

23. The system of claim 20, wherein the processor is configured whereby the presenting of said suggested search terms further includes:

filtering said set of candidate terms to remove duplicates and kill-list entries;

filtering said set of candidate terms by excluding terms with an average minimum proximity to search terms greater than a configurable threshold.

24. The system of claim 20, wherein the processor is configured whereby the presenting of said suggested search terms further includes augmenting said set of candidate terms based upon the characteristics of nodes in said find-trees that a term may be associated with.

25. The system of claim 16, wherein the processor is configured whereby information from said collection of electronic data stores is at least one of acquired, maintained or updated by interacting with said collection of electronic data stores, and storing retrieved information in a separate data cache, wherein said collection of electronic data stores includes said separate data cache.

26. The system of claim 25, wherein the processor is configured whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by:

exploring said collection of electronic data stores for selected information;

storing retrieved information in said separate data cache.

27. The system of claim 25, wherein the processor is configured whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by:

accessing information in said collection of electronic data stores about similar information previously available in said separate data cache;

accessing information in said collection of electronic data stores, to check for any changes from information previously available in said separate data cache.

28. The system of claim 25, wherein the processor is configured whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by:

accessing information in said collection of electronic data stores about similar information previously available in said master tree space;

accessing information in said collection of electronic data stores, to check for any changes from information previously available in said master tree space.

29. The system of claim 25, wherein the processor is configured whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by synchronizing information in said separate data cache with new or changed information.

30. The system of claim 25, wherein the processor is configured whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by synchronizing information in said master tree space with new or changed information.

31. A program product apparatus for locating information in a collection of one or more electronic data stores, said apparatus comprising:

a computer useable memory with computer program logic stored therein, to enable the locating of information in said electronic data stores;

a first storage device for storing information retrieved from said electronic data stores, and for storing a plurality of previously submitted find-trees;

a processor connected to the first storage device, with the processor configured to enable said apparatus to;

construct a find-tree, which includes a tree composed of nodes and branches, having a root node, and some number of intermediate and terminal or leaf nodes, wherein each node denotes a single term used in a search, that is, in an attempt to locate information in said collection of one or more electronic data stores, and each branch denotes a connection between two nodes, such that each path in said find-tree represents a sequence of terms used in said search, and said find-tree represents one or more paths taken in said search, including alternative paths to the same information, partial or incomplete paths, and paths that lead to different information, so that said find-tree depicts one or more sequences of terms, including the intermediate steps, in which each sequence comprises a search path employed in finding, or attempting to find, information in said collection of electronic data stores;

retrieving and navigating an existing said find-tree or any previous tree to locate desired information in said electronic data stores; and

changing, augmenting or extending said find-tree at any point in the process.

32. The apparatus of claim 31, whereby said find-trees include partial search paths, and complete search paths of varying lengths that terminate in nodes representing information, and are stored in said apparatus.

33. The apparatus of claim 32, whereby said stored find-trees are collected in shared data stores representing a master tree space that contains find-trees, and groups of find-trees associated by criteria that define the relation among find-trees in the group, and enables at least one of storage and retrieval of the evolving connections between related found information, wherein said collection of electronic data stores include said shared data stores.

34. The apparatus of claim 33, wherein the operation of the apparatus further includes, for each said find-tree in said master tree space:

removing branches;

repairing broken connections, whereby leaf nodes that no longer correspond to found information are either removed or associated with other information;

merging branches and trees that were created taking the same path to the same information, or that represent synonymous search terms, or both.

35. The apparatus of claim 31, whereby performing the method further includes:

presenting a set of said suggested search terms, wherein such terms are culled from said collection of electronic data stores being searched, including said find trees, and a set of candidate terms is constructed based upon one or more of;

the characteristics of nodes in said find-trees that a term may be associated with, their relative proximity to other search terms, and the number of occurrences of said candidate terms, in said electronic data stores being searched.

36. The apparatus of claim 35, wherein the presenting of said suggested search terms includes:

receiving an initial query (search-term expression) composed of search terms linked by operators including one or more of AND, OR and NOT;

expanding the initial query expression with one or more of;

synonyms, acronyms and antonyms drawn from an evolving master dictionary, and filtered by context-dependent relevance;

executing the said expanded query against at least one of said master tree space and said electronic data-stores.

37. The apparatus of claim 35, wherein the presenting of said suggested search terms includes building said set of candidate terms by filtering retrieved information by a configurable relevance-threshold, determined by frequency of occurrence of search terms in the retrieved information.

38. The apparatus of claim 35, wherein the presenting of said suggested search terms further includes:

filtering said set of candidate terms to remove duplicates and kill-list entries;

filtering said set of candidate terms by excluding terms with an average minimum proximity to search terms greater than a configurable threshold.

39. The apparatus of claim 35, wherein the presenting of said suggested search terms further includes augmenting a set of said candidate terms based upon the characteristics of nodes in said find-trees that a term may be associated with.

40. The apparatus of claim 31, whereby information from said collection of electronic data stores is at least one of acquired, maintained or updated by interacting with said collection of electronic data stores, and storing retrieved information in a separate data cache, wherein said collection of electronic data stores includes said separate data cache.

41. The apparatus of claim 40, whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by:

exploring said collection of electronic data stores for selected information;

storing retrieved information in said separate data cache.

42. The apparatus of claim 40, whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated ted by:

accessing information in said collection of electronic data stores about similar information previously available in said separate data cache;

accessing information in said collection of electronic data stores, to check for any changes from information previously available in said separate data cache.

43. The apparatus of claim 40, whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by:

accessing information in said collection of electronic data stores about similar information previously available in said master tree space;

accessing information in said collection of electronic data stores, to check for any changes from information previously available in said master tree space.

44. The apparatus of claim 40, whereby information from said collection of electronic data stores is further at least one of acquired, maintained or updated by synchronizing information in said separate data cache with new or changed information.

45. The apparatus of claim 40, whereby information from said collection of electronic data stores is further acquired at least one of acquired, maintained or updated synchronizing information in said master tree space with new or changed information.