Skip to main content

Ant Based Clustering of Time Series Discrete Data – A Rough Set Approach

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7076))

Abstract

This paper focuses on clustering of time series discrete data. In time series data, each instance represents a different time step and the attributes give values associated with that time. In the presented approach, we consider discrete data, i.e., the set of values appearing in a time series is finite. For ant-based clustering, we use the algorithm based on the versions proposed by J. Deneubourg, E. Lumer and B. Faieta. As a similarity measure, the so-called consistency measure defined in terms of multistage decision transition systems is proposed. A decision on raising or dropping a given episode by the ant is made on the basis of a degree of consistency of that episode with the knowledge extracted from the neighboring episodes.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Boryczka, U.: Finding groups in data: Cluster analysis with ants. Applied Soft Computing 9(1), 61–70 (2009)

    Article  Google Scholar 

  2. Cios, K., Pedrycz, W., Swiniarski, R.W., Kurgan, L.: Data mining. A knowledge discovery approach. Springer, New York (2007)

    MATH  Google Scholar 

  3. Das, S., Abraham, A., Konar, A.: Metaheuristic Clustering. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  4. Deneubourg, J., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., Chrétien, L.: The dynamics of collective sorting: Robot-like ants and ant-like robots. In: Proceedings of the First International Conference on Simulation of Adaptive Behaviour: From Animals to Animats, vol. 1, pp. 356–365. MIT Press, Cambridge (1991)

    Google Scholar 

  5. Gilner, B.: A comparative study of ant clustering algorithms (2007)

    Google Scholar 

  6. Grzymała-Busse, J.W.: Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B.z., Świniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 78–95. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Handl, J., Knowles, J., Dorigo, M.: Ant-based clustering and topographic mapping. Artificial Life 12(1), 35–62 (2006)

    Article  Google Scholar 

  8. Handl, J., Meyer, B.: Ant-based and swarm-based clustering. Swarm Intelligence 1, 95–113 (2007)

    Article  Google Scholar 

  9. Lumer, E., Faieta, B.: Diversity and adaptation in populations of clustering ants. In: Proceedings of the Third International Conference on Simulation of Adaptive Behaviour: From Animals to Animats, vol. 3, pp. 501–508. MIT Press, Cambridge (1994)

    Google Scholar 

  10. Mitra, S., Banka, H., Pedrycz, W.: Rough-fuzzy collaborative clustering. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 36, 795–805 (2006)

    Article  Google Scholar 

  11. Mitra, S., Pedrycz, W., Barman, B.: Shadowed c-means: Integrating fuzzy and rough clustering. Pattern Recognition 43, 1282–1291 (2010)

    Article  MATH  Google Scholar 

  12. Pancerz, K.: Extensions of dynamic information systems in state prediction problems: the first study. In: Magdalena, L., Ojeda-Aciego, M., Verdegay, L. (eds.) Proceedings of the 12th International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems (IPMU 2008), Malaga, Spain, pp. 101–108 (2008)

    Google Scholar 

  13. Pancerz, K.: Extensions of Multistage Decision Transition Systems: The Rough Set Perspective. In: Cyran, K.A., Kozielski, S., Peters, J.F., Stańczyk, U., Wakulicz-Deja, A. (eds.) Man-Machine Interactions. AISC, vol. 59, pp. 209–216. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  15. Suraj, Z.: The Synthesis Problem of Concurrent Systems Specified by Dynamic Information Systems. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 2. Applications, Case Studies and Software Systems, pp. 418–448. Physica-Verlag, Heidelberg (1998)

    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

Pancerz, K., Lewicki, A., Tadeusiewicz, R. (2011). Ant Based Clustering of Time Series Discrete Data – A Rough Set Approach. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27172-4_76

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27172-4_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27171-7

  • Online ISBN: 978-3-642-27172-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics