Advertisement

Analyzing and Inferring Distance Metrics on the Particle Competition and Cooperation Algorithm

  • Lucas Guerreiro
  • Fabricio Breve
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10409)

Abstract

Machine Learning is an increasing area over the last few years and it is one of the highlights in Artificial Intelligence area. Nowadays, one of the most studied areas is Semi-supervised learning, mainly due to its characteristic of lower cost in labeling sample data. The most active category in this subarea is that of graph-based models. The Particle Competition and Cooperation in Networks algorithm is one of the techniques in this field, which has always used the Euclidean distance to measure the similarity between data and to build the graph. This project aims to implement the algorithm and apply other distance metrics in it, over different datasets. Thus, the results on these metrics are compared to analyze if there is such a metric that produces better results, or if different datasets require a different metric in order to obtain a better correct classification rate. We also expand this gained knowledge, proposing how to identify the best metric for the algorithm based on its initial graph structure, with no need to run the algorithm for each metric we want to evaluate.

Keywords

Artificial intelligence Semi-supervised learning Distance metrics Graphs 

Notes

Acknowledgment

The authors would like to thank the São Paulo Research Foundation - FAPESP (grant #2016/05669-4) and the National Counsel of Technological and Scientific Development - CNPq (grant #475717/2013-9) for the financial support.

References

  1. 1.
    Alpaydin, E.: Introduction to Machine Learning. MIT Press, Cambridge (2004)Google Scholar
  2. 2.
    Mitchell, T.: Machine Learning. McGraw Hill, New York (1997)Google Scholar
  3. 3.
    Chapelle, O., Schölkopf, B., Zien, A.: Semi-Supervised Learning, Adaptive Computation and Machine Learning. MIT Press, Cambridge (2006)CrossRefGoogle Scholar
  4. 4.
    Breve, F.A., Zhao, L., Quiles, M.G., Pedrycz, W., Liu, J.: Particle competition and cooperation in networks for semi-supervised learning. IEEE Trans. Knowl. Data Eng. 24, 1686–1698 (2012)CrossRefGoogle Scholar
  5. 5.
    Liu, Q., Chu, X., Xiao, J., Zhu, H.: Optmizing non-orthogonal space distance using PSO in software cost estimation. In: IEEE Computer Software Applications Conference (COMPSAC), pp. 21–26 (2014)Google Scholar
  6. 6.
    Yang, Z., Shufan, Y., Yang, X., Liqun, G.: High-dimensional statistical distance for object tracking. In: International Conference on Measuring Technology and Mechatronics Automation (ICMTMA), vol. 2, pp. 386–389 (2010)Google Scholar
  7. 7.
    Shyam, R., Singh, Y.N.: Evaluation of eigenface and fisherfaces using Bray Curtis dissimilarity metric. In: 9th International Conference on Industrial and Information Systems (ICIIS), pp. 1–6 (2014)Google Scholar
  8. 8.
    Kokare, M., Chatterji, B.N., Biswas, P.K.: Comparison of similarity metrics for texture image retrieval. In: Conference on Convergent Technologies for the Asia-Pacific Region, vol. 2, pp. 571–575 (2003)Google Scholar
  9. 9.
    Bache, K., Lichman, M.: UCI Machine Learning Repository http://archive.ics.uci.edu/ml. Irvine, CA. University of California, School of Information and Computer Science (2013)

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.São Paulo State University (UNESP)Rio ClaroBrazil

Personalised recommendations