Skip to main content
SpringerLink
Log in

A new method for detection of clustering based on four zones Apollonius circle

  • Original Article
  • Published:
Iran Journal of Computer Science Aims and scope Submit manuscript

Abstract

In many fields of machine learning such as classifying and clustering, neighborhood construction algorithms are used to model local relationships between data samples and to build global structure from local information. In finding connection among the data points, neighborhood is undeniably useful for data processing. Therefore, a very major issue is to find a novel approach to locating neighborhood among data points. If the geometric relationships existing between the data points in the neighborhood area are accurately explored, it will be feasible to observe the behavioral rules as well as the similarities among the data. This will also help identify indirect and direct neighborhood ranges. This study aims to find neighborhood accurately by means of the Apollonius circle zones. The experimental validation against well-known k-nearest neighbor and ε-neighborhood is also an indication of the robustness of the method in real data sets.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Duda, R.: PE Hart and DG Stork, Pattern Classification. Wiley-Interscience, New York (2001)

    Google Scholar 

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

    MATH  Google Scholar 

  3. İnkaya, T., Kayalıgil, S., Özdemirel, N.E.: An adaptive neighbourhood construction algorithm based on density and connectivity. Pattern Recogn. Lett. 52, 17–24 (2015)

    Article  Google Scholar 

  4. İnkaya, T.: A density and connectivity based decision rule for pattern classification. Expert Syst. Appl. 42, 906–912 (2015)

    Article  Google Scholar 

  5. İnkaya, T.: A parameter-free similarity graph for spectral clustering. Expert Syst. Appl. 42, 9489–9498 (2015)

    Article  Google Scholar 

  6. Langerman, J.C.S.C.S.: Empty region graphs. Comput. Geom. Theory Appl. 42, 183–195 (2009)

    Article  MathSciNet  Google Scholar 

  7. Kirkpatrick DG, Radke JD (1984) A Framework for Computational Morphology, vol 13, pp 43–72

  8. Tsai, W.-P., Huang, S.-P., Shao, S.-T., Cheng, K.-T., Chang, F.-J.: A data-mining framework for exploring the multi-relation between fish species and water quality through self-organizing map. Sci. Total Environ. 8, 474–483 (2016)

    Google Scholar 

  9. Singh, K., Shakya, H.K., Biswas, B.: Clustering of people in social network based on textual similarity. Perspect. Sci. 8, 570–573 (2016)

    Article  Google Scholar 

  10. Zhou, H., Li, J., Li, J., Zhang, F., Cui, Y.A.: graph clustering method for community detection in complex networks. Phys. A 469, 551–562 (2016)

    Article  Google Scholar 

  11. Wang, M., Zuo, W., Wang, Y.: An improved density peaks-based clustering method for social circle discovery in social networks. Neurocomputing 179, 219–227 (2016)

    Article  Google Scholar 

  12. Arleo, A., Didimo, W., Liotta, G., Montecchiani, F.: Large graph visualizations using a distributed computing platform. Inf. Sci. 381, 124–141 (2016)

    Article  Google Scholar 

  13. Guo, H., Yu, Y., Skitmore, M.: Visualization technology-based construction safety management: a review. Autom. Constr. 73, 135–144 (2016)

    Article  Google Scholar 

  14. Pedrycz, W.: The design of cognitive maps: a study in synergy of granular computing and evolutionary optimization. Expert Syst. Appl. 37, 7288–7294 (2010)

    Article  Google Scholar 

  15. Mohammadi, M., Raahemi, B., Mehraban, S.A., Bigdeli, E., Akbari, A.: An enhanced noise resilient K-associated graph classifier. Expert Syst. Appl. 42, 8283–8293 (2015)

    Article  Google Scholar 

  16. Cai, Q., Gong, M., Ma, L., Ruan, S., Yuan, F., Jiao, L.: Greedy discrete particle swarm optimization for large-scale social network clustering. Inf. Sci. 316, 503–516 (2015)

    Article  Google Scholar 

  17. Gong, M., Cai, Q., Chen, X., Ma, L.: Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition. IEEE Trans. Evol. Comput. 18, 82–97 (2014)

    Article  Google Scholar 

  18. Pourbahrami, S., Khanli, L.M., Azimpour, S.: Novel and efficient data point neighborhood construction algorithm based on Apollonius circle. Expert Syst. Appl. 115, 57–67 (2019)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Engineering, University of Tabriz, Tabriz, 51666, Iran

    Shahin Pourbahrami

  2. Faculty of Mathematic, University of Farhangian, Tehran, 21666, Iran

    Sohrab Azimpour

Authors
  1. Shahin Pourbahrami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sohrab Azimpour
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shahin Pourbahrami.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pourbahrami, S., Azimpour, S. A new method for detection of clustering based on four zones Apollonius circle. Iran J Comput Sci 3, 59–64 (2020). https://doi.org/10.1007/s42044-019-00050-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s42044-019-00050-1

Keywords

Search

Navigation