Skip to main content

Neighborhood Based Clustering Method for Arbitrary Shaped Clusters

  • Conference paper
  • 3761 Accesses

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

Abstract

Discovering clusters of arbitrary shape with variable densities is an interesting challenge in many fields of science and technology. There are few clustering methods, which can detect clusters of arbitrary shape and different densities. However, these methods are very sensitive with parameter settings and are not scalable with large datasets. In this paper, we propose a clustering method, which detects clusters of arbitrary shapes, sizes and different densities. We introduce a parameter termed \(Nearest \mbox{ }Neighbor \mbox{ }Factor\mbox{ }(NNF)\) to determine relative position of an object in its neighborhood region. Based on relative position of a point, proposed method expands a cluster recursively or declares the point as outlier. Proposed method outperforms a classical method DBSCAN and recently proposed TI-k-Neighborhood-Index supported NBC method.

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. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley Interscience Publication, New York (2000)

    MATH  Google Scholar 

  2. Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31(3), 264–323 (1999)

    Article  Google Scholar 

  3. Xu, R., Wunsch, D.: Survey of Clustering Algorithms. IEEE Transactions on Neural Networks 16(3) (May 2005) 645–678

    Article  Google Scholar 

  4. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proceedings of 2nd ACM SIGKDD, pp. 226–231 (1996)

    Google Scholar 

  5. Zhou, S., Zhao, Y., Guan, J., Huang, J.Z.: A neighborhood-based clustering algorithm. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 361–371. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Kryszkiewicz, M., Lasek, P.: A neighborhood-based clustering by means of the triangle inequality. In: Fyfe, C., Tino, P., Charles, D., Garcia-Osorio, C., Yin, H. (eds.) IDEAL 2010. LNCS, vol. 6283, pp. 284–291. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Chandola, V., Banerjee, A., Kumar, V.: Anomaly detection: A survey. ACM Computing Survey 41(3) (2009)

    Google Scholar 

  8. Rand, W.M.: Objective Criteria for Evaluation of Clustering Methods. Journal of American Statistical Association 66(336), 846–850 (1971)

    Article  Google Scholar 

  9. Zhao, Y., Karypis, G.: Criterion functions for document clustering: Experiments and analysis. Technical report, University of Minnesota (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Patra, B.K., Nandi, S. (2011). Neighborhood Based Clustering Method for Arbitrary Shaped Clusters. In: Kryszkiewicz, M., Rybinski, H., Skowron, A., Raś, Z.W. (eds) Foundations of Intelligent Systems. ISMIS 2011. Lecture Notes in Computer Science(), vol 6804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21916-0_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21916-0_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21915-3

  • Online ISBN: 978-3-642-21916-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics