# US 2006/0155687 A1 · Portable database search agent processing system

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

- Number: US 2006/0155687 A1
- Document ID: US20060155687A1
- Status: Published application
- Kind: A1
- Application number: 11/036,428
- Filed: 2005-01-13
- Published: 2006-07-13
- Earliest claimed: 2005-01-13
- Assignees: Bridgewell Inc.
- Inventors: Peilin Chou
- Web page: https://patentgrep.com/patent/US20060155687A1

## CPC

- G06F 16/337: {Profile generation, learning or modification}
- G06F 16/951: Indexing; Web crawling techniques
- G06F 16/9535: Search customisation based on user profiles and personalisation
- G06F 16/9538: Presentation of query results
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A portable database search agent processing system, comprising: a search agent memory to store a plurality of database search agents, wherein each database search agent is recorded with a group of search parameters, each search parameter comprising at least one search index and its corresponding weight value; a database search engine to search in a database for data files complying with search conditions including said search parameters of a database search agent in said search agent memory; a data file memory to store data files searched by said database search engine; a training module to display data files searched by said database search engine and to accept evaluations to respective searched data files provided by user; wherein said evaluation includes judgment on whether a searched data file is a desired data file; said training module being able to generate a modifying database search agent according to content of any said searched data file and user's evaluation thereto, wherein said modifying database search agent comprises a group of search parameters, each search parameter comprising at least one search index and its weight value; a modification module to modify content of database search agent in said database search agent memory according to content of said modifying database search agent; and a user interface to allow user to operate at least said database search agent memory, said search engine, said training module and said modification module.

## Claims

### Claim 1

A portable database search agent processing system, comprising:
a search agent memory to store a plurality of database search agents, wherein each database search agent is recorded with a group of search parameters, each search parameter comprising at least one search index and its corresponding weight value;
a database search engine to search in a database for data files complying with search conditions including said search parameters of a database search agent in said search agent memory;
a data file memory to store data files searched by said database search engine;
a training module to display data files searched by said database search engine and to accept evaluations to respective searched data files provided by user; wherein said evaluation includes judgment on whether a searched data file is a desired data file;
said training module being able to generate a modifying database search agent according to content of any said searched data file and user's evaluation thereto, wherein said modifying database search agent comprises a group of search parameters, each search parameter comprising at least one search index and its weight value;
a modification module to modify content of database search agent in said database search agent memory according to content of said modifying database search agent; and
a user interface to allow user to operate at least said database search agent memory, said search engine, said training module and said modification module.

### Claim 2 (depends on 1)

The portable database search agent processing system according to claim 1, wherein said database search agent is as:
Si=(xi1, wi1), (xi2, wi2), . . . , (xin, win)
wherein Si represents the ith search agent in said database search agent memory, x is its search index and w is weight of said search index.

### Claim 3 (depends on 2)

The portable database search agent processing system according to claim 2, wherein data files to be searched are text files and x represents a keyword.

### Claim 4 (depends on 1)

The portable database search agent processing system according to claim 1, wherein said search engine is able to obtain data files from said database, to compare content of said obtained data files with search indices of said database search agent, to identify information corresponding to said search indices in said data files and to calculate Similarity value as follows:
Similarity=Σxjwj, ∀xjε(A)
wherein A represents data files being searched, (A) represents a cell of data files A; xj represents indices contained in said database search agent and wj is its weight value; and
said search engine is able to compare said Similarity value with a threshold value and to select data files with Similarity values equal to or greater than said threshold value as searched data files.

### Claim 5 (depends on 1)

The portable database search agent processing system according to claim 1, wherein data files as evaluated as “not desired” are used to generate search indices with negative weight values.

### Claim 6 (depends on 1)

The portable database search agent processing system according to claim 1, wherein said modification module combines said modifying database search agent St={(xtk, Wtk)} and said database search agent Si={(xik, wik)} to obtain a database search agent tester Ss={(xsk, wsk)}, as follows:
xsk=xi, wsk=wik+wtk, ∀xi=xt
xsk=xi, wsk=wi, ∀xi∉{xt}
xsk=xt, wsk=wt, ∀xiε∉{xi}and
k ε N;
wherein xk is an index and wk is its weight.

### Claim 7 (depends on 6)

The portable database search agent processing system according to claim 6, wherein said modification module combines said modifying search agent and said database search agent after having adjusted weight values of said modifying search agent with an adjustment factor.

### Claim 8 (depends on 6)

The portable database search agent processing system according to claim 6, wherein said modification module combines said modifying search agent and said database search agent after having adjusted weight values of said modifying search agent and said database search agent.

### Claim 9

Method for modification of a portable database search agent, comprising the following steps:
obtaining a first database search agent recorded with a group of search parameters, each search parameter comprising at least one search index and its corresponding weight value;
searching in particular database using search conditions including said group of search parameters as to obtain data files complying with said search conditions;
selecting a number of data files in said searched data files to be evaluated;
accepting evaluations from user, which evaluation including judgment on whether a data file is desirable;
establishing second database search agent descriptive of content of said evaluated data files according to said user evaluations and content of said evaluated data files;
combining said first database search agent and said second database search agent to obtain a third database search agent, wherein weight values of same search indices are summed;
searching in same or different database using said third database search agent to obtain a plurality of data files;
selecting particular number of data files from said obtained data files for evaluation;
accepting evaluations from user which evaluations include judgment on whether particular data files are desirable;
calculating ratio of “desired” data files in said selected data files as correctness;
if said correctness is less than a threshold value, modifying weight values of said second database search agent according to said user evaluations and combining said modified second database search agent with said first database search agent to obtain a fourth database search agent;
search in dame or different database using said fourth database search agent and repeating said evaluation and correctness calculation steps until said correctness is equal to or greater than said threshold value; and
if said correctness is equal to or greater than said threshold value, outputting said modified database search agent.

### Claim 10 (depends on 9)

The method according to claim 9, wherein said database search agent is as:
Si=(xi1, wi1), (xi2, wi2), . . . , (xin, win)
wherein Si represents the ith search agent in said database search agent memory, x is its search index and w is weight of said search index.

### Claim 11 (depends on 9)

The method according to claim 9, wherein data files to be searched are text files and x represents a keyword.

### Claim 12 (depends on 9)

The method according to claim 9, wherein search of data files comprises selecting data files with Similarity values greater than a threshold value and wherein said Similarity value is calculated as follows:
Similarity=Σxjwj, ∀xjε(A)
wherein A represents data files being searched, (A) represents a cell of data files A; xj represents indices contained in said database search agent and wj is its weight value.

### Claim 13 (depends on 9)

The method according to claim 9, wherein data files as evaluated as “not desired” are used to generate search indices with negative weight values.

### Claim 14 (depends on 9)

The method according to claim 9, wherein combination of a database search agent St={(xtk, wtk)} and another database search agent Si={(xik, wik)} to obtain a further other database search agent Ss={(xsk, wsk)} comprising modifying their indices and weight values as follows:
xsk=xi, wsk=wik+wtk, ∀xi=xt
xsk=xi, wsk=wi, ∀xi∉{xt}
xsk=xt, wsk=wt, ∀xiε∉{xi}and
k ε N.
wherein xk is an index and wk is its weight.

### Claim 15 (depends on 14)

The method according to claim 14, wherein said one search agent and said another database search agent are combined after said another database search agent is adjusted by timing its weight values with an adjustment factor.

### Claim 16 (depends on 14)

The method according to claim 14, wherein said one search agent and said another database search agent are combined after both database search agents are adjusted by timing their respective weight values with respective adjustment factors.
