Skip to main content
Top

2019 | OriginalPaper | Chapter

3. Data Mining by Evolving Agents for Clusters Discovery and Metric Learning

Authors : Alessio Martino, Mauro Giampieri, Massimiliano Luzi, Antonello Rizzi

Published in: Neural Advances in Processing Nonlinear Dynamic Signals

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper we propose a novel evolutive agent-based clustering algorithm where agents act as individuals of an evolving population, each one performing a random walk on a different subset of patterns drawn from the entire dataset. Such agents are orchestrated by means of a customised genetic algorithm and are able to perform simultaneously clustering and feature selection. Conversely to standard clustering algorithms, each agent is in charge of discovering well-formed (compact and populated) clusters and, at the same time, a suitable subset of features corresponding to the subspace where such clusters lie, following a local metric learning approach, where each cluster is characterised by its own subset of relevant features. This not only might lead to a deeper knowledge of the dataset at hand, revealing clusters that are not evident when using the whole set of features, but can also be suitable for large datasets, as each agent processes a small subset of patterns. We show the effectiveness of our algorithm on synthetic datasets, remarking some interesting future work scenarios and extensions.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
In the sense that they must be able to deal with an heterogeneous genetic code such as (3.2).
 
2
Such value is user-configurable and it is defined as a percentage of the number of survived agents.
 
3
Such value now acts more like a cluster quality measure rather than a fitness value, as we are evaluating a list of clusters rather than individuals from a genetic population.
 
4
We omit the penalty factor \(\beta \) (and, by extension, the reward factor \(\alpha \)) as they mainly drive RL-BSAS rather then describe the final clusters and/or agents.
 
Literature
1.
go back to reference Alamgir M., Von Luxburg, U.: Multi-agent random walks for local clustering on graphs. In: 2010 IEEE 10th International Conference on Data Mining (ICDM), pp. 18–27. IEEE (2010) Alamgir M., Von Luxburg, U.: Multi-agent random walks for local clustering on graphs. In: 2010 IEEE 10th International Conference on Data Mining (ICDM), pp. 18–27. IEEE (2010)
2.
go back to reference Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: ordering points to identify the clustering structure. ACM Sigmod Rec. ACM 28, 49–60 (1999)CrossRef Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: ordering points to identify the clustering structure. ACM Sigmod Rec. ACM 28, 49–60 (1999)CrossRef
3.
go back to reference Bianchi, F.M., Maiorino, E., Livi, L., Rizzi, A., Sadeghian, A.: An agent-based algorithm exploiting multiple local dissimilarities for clusters mining and knowledge discovery. Soft Comput. 5(21), 1347–1369 (2015) Bianchi, F.M., Maiorino, E., Livi, L., Rizzi, A., Sadeghian, A.: An agent-based algorithm exploiting multiple local dissimilarities for clusters mining and knowledge discovery. Soft Comput. 5(21), 1347–1369 (2015)
4.
go back to reference Bianchi, F.M., Rizzi, A., Sadeghian, A., Moiso, C.: Identifying user habits through data mining on call data records. Eng. Appl. Artif. Intel. 54, 49–61 (2016)CrossRef Bianchi, F.M., Rizzi, A., Sadeghian, A., Moiso, C.: Identifying user habits through data mining on call data records. Eng. Appl. Artif. Intel. 54, 49–61 (2016)CrossRef
5.
go back to reference Carvalho, L.F., Barbon, S., de Souza Mendes, L., Proença, M.L.: Unsupervised learning clustering and self-organized agents applied to help network management. Expert Syst. Appl. 54, 29–47 (2016)CrossRef Carvalho, L.F., Barbon, S., de Souza Mendes, L., Proença, M.L.: Unsupervised learning clustering and self-organized agents applied to help network management. Expert Syst. Appl. 54, 29–47 (2016)CrossRef
6.
go back to reference Chaimontree, S., Atkinson, K., Coenen, F.: Clustering in a multi-agent data mining environment. Agents Data Min. Interact., 103–114 (2010) Chaimontree, S., Atkinson, K., Coenen, F.: Clustering in a multi-agent data mining environment. Agents Data Min. Interact., 103–114 (2010)
7.
go back to reference Chaimontree, S., Atkinson, K., Coenen, F.: A multi-agent based approach to clustering: harnessing the power of agents. In: ADMI, pp. 16–29. Springer (2011) Chaimontree, S., Atkinson, K., Coenen, F.: A multi-agent based approach to clustering: harnessing the power of agents. In: ADMI, pp. 16–29. Springer (2011)
8.
go back to reference Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96, 226–231 (1996) Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96, 226–231 (1996)
9.
go back to reference Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989) Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
10.
go back to reference Guha, S., Rastogi, R., Shim, K.: Cure: an efficient clustering algorithm for large databases. ACM Sigmod Rec. ACM 27, 73–84 (1998)CrossRef Guha, S., Rastogi, R., Shim, K.: Cure: an efficient clustering algorithm for large databases. ACM Sigmod Rec. ACM 27, 73–84 (1998)CrossRef
11.
go back to reference Inkaya, T., Kayalıgil, S., Özdemirel, N.E.: Ant colony optimization based clustering methodology. Appl. Soft Comput. 28, 301–311 (2015)CrossRef Inkaya, T., Kayalıgil, S., Özdemirel, N.E.: Ant colony optimization based clustering methodology. Appl. Soft Comput. 28, 301–311 (2015)CrossRef
12.
go back to reference Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10, 707–710 (1966)MathSciNet Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10, 707–710 (1966)MathSciNet
14.
go back to reference MacQueen, J.: Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA 1, 281–297 (1967)MathSciNetMATH MacQueen, J.: Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA 1, 281–297 (1967)MathSciNetMATH
15.
go back to reference Martino, A., Rizzi, A., Frattale Mascioli, F.M.: Efficient approaches for solving the large-scale k-medoids problem. In: Proceedings of the 9th International Joint Conference on Computational Intelligence, IJCCI, INSTICC, vol. 1, pp. 338–347. SciTePress (2017) Martino, A., Rizzi, A., Frattale Mascioli, F.M.: Efficient approaches for solving the large-scale k-medoids problem. In: Proceedings of the 9th International Joint Conference on Computational Intelligence, IJCCI, INSTICC, vol. 1, pp. 338–347. SciTePress (2017)
17.
go back to reference Ogston, E., Overeinder, B., Van Steen, M., Brazier, F.: A method for decentralized clustering in large multi-agent systems. In: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 789–796. ACM (2003) Ogston, E., Overeinder, B., Van Steen, M., Brazier, F.: A method for decentralized clustering in large multi-agent systems. In: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 789–796. ACM (2003)
18.
go back to reference Pan, X., Chen, H.: Multi-agent evolutionary clustering algorithm based on manifold distance. In: 2012 Eighth International Conference on Computational Intelligence and Security (CIS), pp. 123–127. IEEE (2012) Pan, X., Chen, H.: Multi-agent evolutionary clustering algorithm based on manifold distance. In: 2012 Eighth International Conference on Computational Intelligence and Security (CIS), pp. 123–127. IEEE (2012)
19.
go back to reference Park, J., Oh, K.: Multi-agent systems for intelligent clustering. Proc. World Acad. Sci. Eng. Technol. 11, 97–102 (2006) Park, J., Oh, K.: Multi-agent systems for intelligent clustering. Proc. World Acad. Sci. Eng. Technol. 11, 97–102 (2006)
20.
go back to reference Rizzi, A., Del Vescovo, G., Livi, L., Frattale Mascioli, F.M.: A new granular computing approach for sequences representation and classification. In: The 2012 International Joint Conference on Neural Networks (IJCNN), pp. 1–8. IEEE (2012) Rizzi, A., Del Vescovo, G., Livi, L., Frattale Mascioli, F.M.: A new granular computing approach for sequences representation and classification. In: The 2012 International Joint Conference on Neural Networks (IJCNN), pp. 1–8. IEEE (2012)
21.
go back to reference Theodoridis, S., Koutroumbas, K.: Pattern Recognition, 4th edn. Academic Press (2008) Theodoridis, S., Koutroumbas, K.: Pattern Recognition, 4th edn. Academic Press (2008)
22.
go back to reference Zhang, T., Ramakrishnan, R., Livny, M.: Birch: an efficient data clustering method for very large databases. ACM Sigmod Rec. ACM 25, 103–114 (1996)CrossRef Zhang, T., Ramakrishnan, R., Livny, M.: Birch: an efficient data clustering method for very large databases. ACM Sigmod Rec. ACM 25, 103–114 (1996)CrossRef
Metadata
Title
Data Mining by Evolving Agents for Clusters Discovery and Metric Learning
Authors
Alessio Martino
Mauro Giampieri
Massimiliano Luzi
Antonello Rizzi
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-319-95098-3_3

Premium Partner