Skip to main content

Affection Factor Optimization in Data Field Clustering

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4426))

Included in the following conference series:

Abstract

Although Data Field Clustering method has a lot of advantages, clustering result depends severely on affection factor that is selected in Data Field function. The purpose of the paper is to find an optimum affection factor that may not only reflect nature characteristic of clustering data sample, but also reduce influence caused by sample deviation to minimum. In this paper, an affection interval concept is defined at first. Then an optimum objective function for reducing influence of sample deviation is constructed and an approximate solution is given of optimum affection factor. In the end, a standard data set offered in the MATLAB is used to test the availability of the optimum affection factor, the result is satisfactory.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Deyi, L., Haijun, M., Xuemei, S.: Membership clouds and membership cloud generators. Computer. Research and Development (1995)

    Google Scholar 

  2. Wang, S.-L.: Data Field and Cloud Model Based Spatial Data Mining and Knowledge Discovery. Ph.D. Thesis. Wuhan University, Wuhan, China (2002)

    Google Scholar 

  3. Gan, W.-y., Li, D.-y., Wang, J.-m.: An Hierarchical Clustering Method Based on Data Field. ACTA ELECTRONICA SINICA 34(2) (2006)

    Google Scholar 

  4. Xu, R., Wunsch II., D.: Survey of Clustering Algorithms. IEEE Transactions on Neural Networks 16(3) (2005)

    Google Scholar 

  5. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  6. Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, New York (1990)

    Google Scholar 

  7. Zaki, M.J., Ramakrishnan, R., Livny, M.: BIRCH: An Efficient Data Clustering Method for Very Large Databases. In: Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data, Montreal, Canada, ACM, New York (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zhi-Hua Zhou Hang Li Qiang Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Yang, H., Liu, J., Li, Z. (2007). Affection Factor Optimization in Data Field Clustering. In: Zhou, ZH., Li, H., Yang, Q. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2007. Lecture Notes in Computer Science(), vol 4426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71701-0_115

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71701-0_115

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71700-3

  • Online ISBN: 978-3-540-71701-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics