Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1983))

Abstract

This paper presents the decision clusters classifier (DCC) for database mining. A DCC model consists of a small set of decision clusters extracted from a tree of clusters generated by a clustering algorithm from the training data set. A decision cluster is associated to one of the classes in the data set and used to determine the class of new objects. A DCC model classifies new objects by deciding which decision clusters these objects belong to. In making classification decisions, DCC is similar to the k-nearest neighbor classification scheme but its model building process is different. In this paper, we describe an interactive approach to building DCC models by stepwise clustering the training data set and validating the clusters using data visualization techniques. Our initial results on some public benchmarking data sets have shown that DCC models outperform the some existing popular classification methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ankerst, C. Elsen, M. Ester and H.-P. Kriegel: Visual Classification: An Interactive Approach to Decision Tree Construction, in Proc. KDD’99, 5th Intl. Conf. on Knowledge Discovery and Data Mining, San Diego, 1999.

    Google Scholar 

  2. C. Blake and C. Merz: UCI Repository of machine learning databases, Department of Information and Computer Science, University of California, Irvine, CA, 1998 [http://www.ics.uci.edu/_mlearn/MLRepository.html].

  3. C. Faloulsos and K.I. Lin: FastMap A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets, in Proc. ACM SIGMOD Conf., San Jose, CA, 163–174, 1995.

    Google Scholar 

  4. Z. Huang: Extensions to the k-means algorithm for clustering large data sets with categorical values, Data Mining and Knowledge Discovery, Vol. 2, No. 3, pp. 283–304,1998.

    Article  Google Scholar 

  5. Z. Huang and T. Lin: A Visual Method of Cluster Validation with Fastmap, PAKDD2000, Japan, 2000.

    Google Scholar 

  6. A. Jain and R. Dubes: Algorithms for Clustering Data, Prentice Hall, 1988.

    Google Scholar 

  7. Y. Lin and K. Fu: Automatic Classification of Cervical Cells Using a Binary Tree Classifier, Pattern Recognition, Vol. 16, No.1, pp. 68–80, 1983.

    Google Scholar 

  8. J. Mui and K. Fu: Automated Classification of Nucleated Blood Cells Using a Binary Tree Classifier, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 2, No. 5, pp. 429–443, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, Z., Ng, M.K., Lin, T., Cheung, D. (2000). An Interactive Approach to Building Classiffication Models by Clustering and Cluster Validation. In: Leung, K.S., Chan, LW., Meng, H. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents. IDEAL 2000. Lecture Notes in Computer Science, vol 1983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44491-2_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-44491-2_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41450-6

  • Online ISBN: 978-3-540-44491-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics