Journal of Computer Science and Technology ›› 1986, Vol. 1 ›› Issue (1): 70-85.

Previous Articles    

ISOETRP Clustering Algorithm and Its Application to Tree Classifier Design

Wang Qingren   

  1. Nankai University, Tianjin
  • Received:1984-10-30 Online:1986-01-10 Published:2022-01-20

A new clustering algorithm ISOETRP has been developed. Several new objectives have. been intro-duced to make ISOETRP particularly suitable to hierarchical pattern classification. These objectives are: a)minimizing overlap-between pattern class groups, b) maximizing entropy reduction, and c) keeping bal-ance between these groups. The overall objective to be optimized is

GAIN = Entropy Reduction/(Overlap + 1).

Balance is controlled by maximizing the GAIN. An interactive version of ISOETRP has also been developed by means of an overlap table. It has been shown that ISOETRP gives much better results than other existing algorithms in optimizing the above objectives. ISOETRP has played an important role in designing many large -tree classifiers, where the tree performance was improved by optimizing GAIN value.



No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved