A New Memory-Based Reasoning Algorithm using the Recursive Partition Averaging 


Vol. 6,  No. 7, pp. 1849-1857, Jul.  1999
10.3745/KIPSTE.1999.6.7.1849


PDF
  Abstract

We proposed the RPA (Recursive Partition Averaging) method in order to improve the storage requirement and classification rate of the Memory Based Reasoning. This algorithm recursively partitions the pattern space until each hyperrectangle contains only those patterns of the same class, then it computes the average values of 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. The proposed algorithm used 30~90% of memory space that is needed in the k-NN (k-Nearest Neighbors) classifier, and showed a comparable classification performance to the k-NN. Also, by reducing the number of stored patterns, it showed an excellent result in terms of classification time when we compare it to the k-NN.

  Statistics
  Cite this article

[IEEE Style]

C. T. Sun, L. H. Il, Y. C. Hwa, K. K. Sik, "A New Memory-Based Reasoning Algorithm using the Recursive Partition Averaging," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 7, pp. 1849-1857, 1999. DOI: 10.3745/KIPSTE.1999.6.7.1849.

[ACM Style]

Cheong Tae Sun, Lee Hyeong Il, Yoon Chung Hwa, and Kang Kyung Sik. 1999. A New Memory-Based Reasoning Algorithm using the Recursive Partition Averaging. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 7, (1999), 1849-1857. DOI: 10.3745/KIPSTE.1999.6.7.1849.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals