The development of hashing indexing technique in case retrieval
Case-based reasoning (CBR) considers previous experience in form of cases to overcome new problems. It requires many solved cases in case base in order to produce a quality decision. Since today, database technology has allowed CBR to use a huge case storage therefore the case retrieval process also...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference Paper |
| Language: | en_US |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://ddms.usim.edu.my/handle/123456789/9253 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Case-based reasoning (CBR) considers previous experience in form of cases to overcome new problems. It requires many solved cases in case base in order to produce a quality decision. Since today, database technology has allowed CBR to use a huge case storage therefore the case retrieval process also reflects the final decision in CBR. Traditionally, sequential indexing method has been applied to search for possible cases in case base. This technique is worked fast when the number of cases is small but it consumes more time to retrieve when the number of data grows in case base. To overcome the weakness, this study researches the nonsequential indexing called hashing as an alternative to mine large cases and faster the retrieval time in CBR. Hashing indexing searches a record by determines the index using only an entry's search key without traveling to all records. This paper presents the review of a literature and early stages of the integration hashing indexing method in CBR. The concept of hashing indexing in case retrieving process, the model development, and the preliminary algorithm testing result will be discussed in this paper. © 2010 IEEE. |
|---|