• 沒有找到結果。

A parallelized indexing method for large-scale case-based reasoning

N/A
N/A
Protected

Academic year: 2022

Share "A parallelized indexing method for large-scale case-based reasoning"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: A parallelized indexing method for large-scale case-based reasoning 作者: W. C. Chen;S. S. Tseng;L. P. Chang;T.P. Hong;Mon-Fong Jian

貢獻者: Department of Information Science and Applications

(2)

關鍵詞: Case-based reasoning;Parallelized indexing;Bitwise indexing;Case retrieval;Performance

日期: 2002-08

上傳時間: 2009-11-30T08:03:20Z 出版者: Asia University

摘要: Case-based reasoning (CBR) is a problem-solving methodology

commonly seen in artificial intelligence. It can correctly take advantage of the situations and methods in former cases to find out suitable solutions for new problems. CBR must accurately retrieve similar prior cases for getting a good performance. In the past, many researchers proposed useful technologies to handle this problem. However, the performance of retrieving similar cases may be greatly influenced by the number of cases. In this paper, the performance issue of large-scale CBR is discussed and a parallelized indexing architecture is then proposed for efficiently retrieving similar cases in large-scale CBR. Several algorithms for implementing the proposed architecture are also described. Some experiments are made and the results show the efficiency of the proposed method.

參考文獻

相關文件

2 Distributed classification algorithms Kernel support vector machines Linear support vector machines Parallel tree learning.. 3 Distributed clustering

2 Distributed classification algorithms Kernel support vector machines Linear support vector machines Parallel tree learning?. 3 Distributed clustering

The multi-task learning problem comes from our biological application: Drosophila gene expression pattern analysis (funded by NSF and

The multi-task learning problem comes from our biological application: Drosophila gene expression pattern analysis (funded by NSF and

Keywords: Finite volume method; Heterostructure; Large scale polynomial eigenvalue problem; Semiconductor pyramid quantum dot;.. Schr€

100, 480, 507 training scores (values given) 2, 817, 131 test scores (values unknown) Select the 9 most recent scores for each user Divided into probe, quiz, and test sets. Probe set

• Cell coverage area: expected percentage of locations within a cell where the received power at these. locations is above a

We will quickly discuss some examples and show both types of optimization methods are useful for linear classification.. Chih-Jen Lin (National Taiwan Univ.) 16