# US 2001/0044791 A1 · Automated adaptive classification system for bayesian knowledge networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2001/0044791 A1
- Document ID: US20010044791A1
- Status: Published application
- Kind: A1
- Application number: 09/751,934
- Filed: 2001-02-20
- Published: 2001-11-22
- Earliest claimed: 2000-04-14
- Assignees: RightNow Technologies, Inc.
- Inventors: James Neal Richter; Doug Warner; Ganesh Prabu
- Web page: https://patentgrep.com/patent/US20010044791A1

## CPC

- G06F 16/355: Creation or modification of classes or clusters
- G06F 16/951: Indexing; Web crawling techniques
- G06F 16/953: Querying, e.g. by the use of web search engines
- G06F 16/954: Navigation, e.g. using categorised browsing
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method and apparatus for use in an information retrieval system is provided, which derives related informational items that have a usage based relationship strength, and which results in an efficient and more accurate dynamic relationship association between informational items. This system comprises the steps and means for, respectively, detecting a selection of at least a first informational item and a second informational item in an information retrieval session. A relationship type is assigned based on characteristic similarities between the first informational item and the second informational item. Additionally, a relationship strength is assigned based on historical frequency of the consecutive selection of the first and second informational items and providing an access to the second informational item upon detection of the first being accessed by a user of the information retrieval system. Also, in accordance with the principles of the present invention, the extraction of textual database fields; the application of multiple text classification algorithms; the merging of the algorithm results; the encoding of the merged results as a Bayesian-type link; the use of feedback methods to weight, prune and age the relationship link serves to automate and enhance the process of classification in an information retrieval system.

## Claims

### Claim 1

A method of classifying a plurality of informational items in an information retrieval system, comprising the steps of:
detecting an access of a first informational item;
detecting an access of a second informational item;
applying an ensemble of clustering algorithms; and
creating a relationship link between said first informational item and second informational item.

### Claim 2 (depends on 1)

The method as recited in claim 1 wherein said step of detecting the second informational item includes the detecting of a plurality of informational items.

### Claim 3 (depends on 2)

The method as recited in claim 2, further comprising the step of:
determining a weighting or strength for said relationship link.

### Claim 4 (depends on 3)

The method as recited in claim 3, further comprising the step of:
applying an algorithm for data aging wherein the usage of the relationship link is monitored and used as feed back for the weighting associated with the relationship link.

### Claim 5 (depends on 4)

The method as recited in claim 4, further comprising the step of:
applying a pruning algorithm wherein external information regarding the usefulness of at least one relationship link is utilized to modify weighting/strength or existence of a recorded relationship link.

### Claim 6 (depends on 5)

The method as recited in claim 5, wherein said pruning algorithm is repeatedly applied to determine if a recorded relationship link should be ignored or placed in a list of bad links.

### Claim 7 (depends on 5)

The method as recited in claim 5, wherein said pruning algorithm makes use of a user determined feedback of the usefulness of a relationship link.

### Claim 8 (depends on 2)

The method as recited in claim 2, wherein said ensemble includes a plurality of algorithms and wherein said relationship link is weighted in direct proportion to the number of algorithms within said ensemble of algorithms that determine the existence of said relationship link.

### Claim 9 (depends on 2)

The method as recited in claim 2, wherein said relationship link is positioned in a list in direct proportion to the degree of consensus among said ensemble of algorithms.

### Claim 10 (depends on 2)

The method as recited in claim 2, wherein said ensemble includes a plurality of algorithms and wherein each algorithm within said ensemble of algorithms runs independently of all other algorithms.

### Claim 11 (depends on 2)

The method as recited in claim 2, further comprising the step of merging the outputs of said ensemble of algorithms.

### Claim 12 (depends on 2)

The method as recited in claim 2, further comprising the step of recording said relationship link in a Bayesian-type Belief Network.

### Claim 13

A Bayesian-type Belief Network wherein the traditional Baysian Belief Network components are modified, the modification comprising:
a set of random Frequently Asked Questions(FAQ) or Data;
a set of relationships between nodes;
a weight which describes the strength of relationship between each node; and
a network structure which allows cycles and other structures with no limitations.

### Claim 14

An apparatus for providing classification of informational items in an information retrieval system comprising:
means for detecting an access of informational items;
means for applying an ensemble of clustering algorithms; and
means for creating relationship links between said informational items to enhance the effectiveness of said system.

### Claim 15 (depends on 14)

The apparatus of claim 14 including:
means for aging said relationship links;
means for pruning said relationship links;
means for weighting said relationship links; and
means for arranging said relationship links in direct proportion to the outcome of said ensemble of algorithms.

### Claim 16 (depends on 15)

The apparatus of claim 15 including means for merging the resulting output of said ensemble of algorithms into a Bayesian-type Belief Network.

### Claim 17 (depends on 2)

A computer readable storage medium having stored thereon a computer program for implementing a method of classifying a plurality of information items in an information retrieval system, said computer program comprising a set of instructions for implementing the steps recited in claim 2.

### Claim 18 (depends on 17)

The computer readable storage medium according to claim 17, wherein said computer program further comprises one or more instructions for clustering the resulting output of said ensemble of algorithms into a Bayesian-type Belief Network.

### Claim 19 (depends on 17)

The computer readable storage medium according to claim 17, wherein said computer program further comprises one or more instructions for improving the usefulness of said relationship links through weighting of said relationship links.

### Claim 20 (depends on 17)

The computer readable storage medium according to claim 17, wherein said computer program further comprises one or more instructions for improving the usefulness of said relationship links through pruning of said relationship links.

### Claim 21 (depends on 17)

The computer readable storage medium according to claim 17, wherein said computer program further comprises one or more instructions for improving the usefulness of said relationship links through aging of said relationship links.

### Claim 22 (depends on 17)

The computer readable storage medium according to claim 17, wherein said computer program further comprises one or more instructions for improving the usefulness of said relationship links through weighting, pruning and aging of said relationship links.

### Claim 23

A method for retrieving help information in a system where informational items are not fixedly mapped to one another comprising the steps of:
determining an efficient path to arrive at a particular help item of interest; and
storing a context in which a help item is sought as well as the path to said help item.

### Claim 24 (depends on 23)

The method as recited in claim 23, further comprising the step of reexamining and dynamically changing said efficient path to a particular help item upon subsequent help item searches or retrieval.

### Claim 25 (depends on 23)

The method as recited in claim 23, wherein said efficient path is determined based on said context in which said help item was sought.
