An Improved Memory Based Reasoning using the Fixed Partition Averaging Algorithm


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 6, pp. 1563-1570, Jun. 1999
10.3745/KIPSTE.1999.6.6.1563,   PDF Download:

Abstract

In this paper, we proposed the FPA(Fixed Partition Averaging) algorithm in order to improve the storage requirement and classification time of Memory Based Reasoning method. The proposed method enables us to use the storage more efficiently by extracting representatives out of training patterns. After partitioning the pattern space into a fixed number of equally-sized hyperrectangles, it averages patterns in each hyperrectangle to extract a representative. Also we have used the mutual information between the features and classes as weights for features to improve the classification performance.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. T. Sun, L. H. Il, Y. C. Hwa, "An Improved Memory Based Reasoning using the Fixed Partition Averaging Algorithm," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 6, pp. 1563-1570, 1999. DOI: 10.3745/KIPSTE.1999.6.6.1563.

[ACM Style]
Cheong Tae Sun, Lee Hyeong Il, and Yoon Chung Hwa. 1999. An Improved Memory Based Reasoning using the Fixed Partition Averaging Algorithm. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 6, (1999), 1563-1570. DOI: 10.3745/KIPSTE.1999.6.6.1563.