Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1999-02-19
2003-01-14
Breene, John (Department: 2177)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
06507841
ABSTRACT:
TECHNICAL FIELD
This invention relates to methods of and apparatus for refining descriptors, for example such as are used for retrieving data items from databases.
BACKGROUND ART
A major obstacle to the efficient retrieval of data is the way they are indexed (i.e. to select descriptors or keywords). Currently there are two common ways of indexing:
1. The use of an automatic indexing tool to extract words from text documents or recognize forms and elements in images, videos, etc. This is based on artificial intelligence (AI) techniques and has the limits that this technology offers.
2. One or more people does the indexing manually after a close analysis of the data This is usually accurate but reliant on the vocabulary of the indexer and their perception of the data (It may be very subjective for images, for instance). It is also time-consuming.
Both of these techniques provide a set of indexing keywords or descriptors which are static, and which very often belong to a vocabulary that is inconsistent and limited. However, people querying the system in effect provide possible keywords in their queries. The keywords in the queries may not be existing descriptors but they are relevant to the data. Currently this information is left unused and forgotten by the system once the user quits the system. As a result, if the indexing keywords are inappropriate, nothing can be done to improve them even if some people may provide good indexing terms as they search.
If the terminology commonly used changes over time (for example, one technical term becomes superseded by another), then it becomes necessary to redo all the indexing which is undesirable, especially as databases become bigger and bigger.
Thus there is a need to describe data so that they will be more easily searchable by the majority of the community.
DISCLOSURE OF INVENTION
According to one aspect of the invention, a method of indexing data items to enable retrieval thereof comprises: (1) storing the data items in a complete form; (2) storing association relationships between the stored data items and descriptors associated with the stored data items; (3) receiving a search request from a user for selection of stored data items, wherein the request incorporates at least one descriptor; (4) sending the user a search result including a summary form of the stored data items selected in accordance with the search request; and (5) modifying the stored association relationship between the stored data items and the stored descriptors in response to the user responding to the sent search result by requesting the complete form of a selected data item in a search result. The modification includes adding and/or removing at least one descriptor to the stored association relationship for the selected data item for which the complete form was requested.
Another aspect of the invention relates to a method of indexing data items in a central facility accessible by plural users, wherein the data items being indexed enable retrieval thereof. The method comprises: (1) storing the data items in a complete form; (2) storing association relationships between the stored data items and descriptors associated with the stored data items; (3) receiving search requests from plural users for selection of stored data items, wherein the requests incorporate at least one descriptor associated with each data item; (4) sending users search results, wherein each search result includes a summary form of the stored data items selected in accordance with the search request; and (5) modifying the stored association relationship between the stored data items and the stored descriptors in response to the user responding to the sent search result by requesting the complete form of a selected data item in a search result. The modification includes adding and/or removing the at least one descriptor to the stored association relationship for the selected data item for which the complete form was requested.
A further aspect of the invention relates to a search facility for retrieving data items in response to user requests, wherein the search facility comprises: (1) a store for (a) the data items and (b) association relationships between the stored data items and descriptors associated with the stored items; (2) a receiver for search requests from users of the search facility, wherein each search request includes a user selection of at least one of the stored data items and at least one descriptor associated with the user selected at least one stored data item; and (3) a processor coupled to the receiver for retrieving from the store the users' search results in response to the search request by the users. The retrieved search results include a summary form of the stored data items selected in accordance with the search request. The processor is arranged for modifying the stored association relationship between the stored data items and the stored descriptors in response to the user responding to the sent search result by requesting the complete form of a selected data item in a search result. The modification includes adding and/or removing the at least one descriptor to the stored association relationship for the selected data item for which the complete form was requested.
REFERENCES:
patent: 5020019 (1991-05-01), Ogawa
patent: 5168565 (1992-12-01), Morita
patent: 5493677 (1996-02-01), Balogh et al.
patent: 5535382 (1996-07-01), Ogawa
patent: 5642502 (1997-06-01), Driscoll
patent: 5696964 (1997-12-01), Cox et al.
patent: 5761496 (1998-06-01), Hattori
patent: 5781175 (1998-07-01), Hara
patent: 5787421 (1998-07-01), Nomiyama
patent: 5890152 (1999-03-01), Rapaport et al.
patent: 6006222 (1999-12-01), Culliss
patent: 6014665 (2000-01-01), Culliss
patent: 6044365 (2000-03-01), Cannon et al.
patent: 6078916 (2000-06-01), Culliss
patent: 6084595 (2000-07-01), Bach et al.
patent: 6182068 (2001-01-01), Culliss
patent: 6247009 (2001-06-01), Shiiyama et al.
patent: 2 323 946 (1998-10-01), None
Pereira et al. “A relevance feedback Model based on soft consensus Dynamic” Fuzzy Systems, 1997., Proceedings of the Sixth IEEE InternationalConference on, vol.: 3, 1997 pp. 1221-1225 vol. 3.*
Chua et al. “A concept-based Image Retrieval System ” System Sciences, 1994. vol. III: InformationSystems: Decision Support and Knowledge-Based Systems.pp. 590-598.*
Benitez et al, “Using Relevance Feedback in content-based Image Metasearch”, IEEE Internet Computing, vol.: 2 Issue: 4, Jul.-Aug. 1998 pp.: 59-69.*
Cox et al “PicHunter: Bayesian Relevance Feedback for Image Retrieval” Proceeding of ICPR 1996. pp. 361-369.*
Inoue, S. et al: “Image Filing System Capable of Quick Retrieval,” NHK Laboratories Note, No. 328, Feb. 1, 1986.
Breene John
Pham Khanh
LandOfFree
Methods of and apparatus for refining descriptors does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Methods of and apparatus for refining descriptors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods of and apparatus for refining descriptors will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3033318