We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 1 Issue 1
January  1986
Turn off MathJax
Article Contents
Abstract
Related Articles
Wang Qingren. ISOETRP Clustering Algorithm and Its Application to Tree Classifier Design[J]. Journal of Computer Science and Technology, 1986, 1(1): 70-85.
Citation: Wang Qingren. ISOETRP Clustering Algorithm and Its Application to Tree Classifier Design[J]. Journal of Computer Science and Technology, 1986, 1(1): 70-85.
shu

ISOETRP Clustering Algorithm and Its Application to Tree Classifier Design

  • Nankai University, Tianjin

More Information
  • Received Date: October 29, 1984
  • Published Date: January 09, 1986
    Abstract
  • 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.



    • FullText(HTML)
    • References (0)
    • Relative Articles

  • Related Articles

    [1]Loris Nanni, Alessandra Lumini. Cluster-Based Nearest-Neighbour Classifier and Its Application on the Lightning Classification[J]. Journal of Computer Science and Technology, 2008, 23(4): 573-581.
    [2]MA Jun, YANG Bo, MA Shaohan. A Practical Algorithm for the Minimum Rectilinear Steiner Tree[J]. Journal of Computer Science and Technology, 2000, 15(1): 96-99.
    [3]LUAN Shangmin, LI wei. An Incremental Approach toAutomatic Algorithm Design[J]. Journal of Computer Science and Technology, 1999, 14(4): 314-319.
    [4]Huang Wenqi, Li Wei. A Hopeful CNF-SAT─Algorithm Its High Efficiency, Industrial Application and Limitation[J]. Journal of Computer Science and Technology, 1998, 13(1): 9-12.
    [5]Sun Jiachang, Chi Xuebin, Cao Jianwen, Zhang Linbo. Parallel Algorithm Design on Some Distributed Systems[J]. Journal of Computer Science and Technology, 1997, 12(2): 97-104.
    [6]Ye Shiwei, Shi Zhongzhi. A Necessary Condition about the Optimum Partition on a Finite Set of Samples and Its Application to Clustering Analysis[J]. Journal of Computer Science and Technology, 1995, 10(6): 545-556.
    [7]Xiang Dong, Wei Daozheng. GLOBAL: A Design for Random Testability Algorithm[J]. Journal of Computer Science and Technology, 1994, 9(2): 182-192.
    [8]Xu Meirui, Liu Xiaolin. A VLSI Algorithm for Calculating the Tree to Tree Distance[J]. Journal of Computer Science and Technology, 1993, 8(1): 68-76.
    [9]Huang Wenqi, Wang Gangqiang. A Basic Algorithm for Computer-Aided Design of Material Arrangement[J]. Journal of Computer Science and Technology, 1992, 7(1): 56-61.
    [10]Lu Qi, Zhang Fubo, Qian Jiahua. Program Slicing:Its Improved Algorithm and Application in Verification[J]. Journal of Computer Science and Technology, 1988, 3(1): 29-39.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (15) PDF downloads (14) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    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

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return