Skip to main content

Self-adaptive Two-Phase Support Vector Clustering for Multi-Relational Data Mining

  • Conference paper
  • 3018 Accesses

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

Abstract

This paper proposes a novel Self-Adaptive Two-Phase Support Vector Clustering algorithm (STPSVC) to cluster multi-relational data. The algorithm produces an appreciate description of cluster contours and then extracts cluster centers information by iteratively performing classification procedure. An adaptive Kernel function is designed to find a desired width parameter for diverse dispersions. Experimental results indicate that the designed Kernel can capture multi-relational features well and STPSVC is of fine performance.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Džeroski, S.: Multi-Relational Data Mining: An Introduction. ACM SIGKDD Explorations Newsletter 5(1) (2003)

    Google Scholar 

  2. Tax, R., Duin, P.W.: Data Domain Description using Support Vectors. In: Proceedings of European Symposium on Artificial Neural Networks, Bruges, Belgium, pp. 251–256 (1999)

    Google Scholar 

  3. Cristianini, N., Shawe-Taylor, J.: An introduction to Support Vector Machines. Cambridge University Press, London (2000)

    MATH  Google Scholar 

  4. http://www.ics.uci.edu/~mlearn/MLSummary.html

  5. Girolami, M.: Mercer Kernel-Based Clustering in Feature Space. IEEE Trans. on Neural Networks 13(3), 780–784 (2002)

    Article  Google Scholar 

  6. Ng, A., Jordan, M., Weiss, Y.: On Spectral Clustering: Analysis and an Algorithm. In: Advances in Neural Information Processing Systems. MIT Press, Cambridge (2002)

    Google Scholar 

  7. Dietterich, T.G., Lathrop, R.H., Lozano-Perez, T.: Solving the Multiple Instance Problem with Axis-Parallel rectangles. Artificial Intelligence 89(1-2), 31–71 (1997)

    Article  MATH  Google Scholar 

  8. Bloedorn, E., Michalski, R.: Data Driven Constructive Induction. IEEE Intelligent Systems 13(2), 30–37 (1998)

    Article  Google Scholar 

  9. Gaertner, T., Flach, P., Kowalczyk, A., Smola, A.: Multi-instance Kernels. In: Proceedings of the 19th International Conference on Machine, pp. 179–186 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ling, P., Wang, Y., Zhou, CG. (2006). Self-adaptive Two-Phase Support Vector Clustering for Multi-Relational Data Mining. In: Ng, WK., Kitsuregawa, M., Li, J., Chang, K. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2006. Lecture Notes in Computer Science(), vol 3918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11731139_27

Download citation

  • DOI: https://doi.org/10.1007/11731139_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33206-0

  • Online ISBN: 978-3-540-33207-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics