Skip to main content
SpringerLink
Log in

Towards a Temporal Extension of Formal Concept analysis

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2001)

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

Abstract

This article presents a method for analyzing the evolution of concepts represented by concept lattices in a time stamped database, showing how the concepts that evolve with time induce a change in the concept lattice. The purpose of this work is to extend formal concept analysis to handle temporal properties and represent temporally evolving attributes.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bartel, H.-G., Bruggemann, R. 1998. Application of Formal Concept Analysis to Structure-Activity Relationships. Fresenius Journal of Analytical Chemistry (5 Jan.), vol. 361, no. 1. Springer-Verlag, Berlin, Germany, 23–28

    Google Scholar 

  2. Birkhoff, G. 1948. Lattice Theory. American Mathematical Society Colloquium Publications, Vol. XXV, Second (Revised) Edition. Providence, Rhode Island, Library of Congress Catalog Card Number 66-23707

    Google Scholar 

  3. Cole, R., Eklund, P. W. 1999. Scalability in Formal Concept Analysis. Computational Intelligence (Feb.), vol. 15, no. 1. Blackwell Publishers, USA, 11–27

    Google Scholar 

  4. Eklund, P. W., Wille, R. 1998. A Multimodal Approach to Term Extraction Using a Rhetorical Structure Theory Tagger and Formal Concept Analysis. In Proceedings of the 2nd International Conference on Multi-modal Communication, CMC/98, (Tilburg). 171–175, ISBN 90-9011386-X

    Google Scholar 

  5. Fernandez-Manjon, B., Fernandez-Valmayor, A. 1998. Building educational tools based on formal concept analysis. Education and Information Technologies (Dec.), vol. 3, no. 3-4. Kluwer Academic Publishers, Netherlands, 187–201

    Google Scholar 

  6. Frost, R. A., Chitte, S. 1999. A New Approach for Providing Natural-Language Speech Access to Large Knowledge Bases. In Proceedings of the Pacific Association of Computational Linguistics Conference, PACLING'99. University of Waterloo, Canada, August 1999, 82–89

    Google Scholar 

  7. Ganter, B., Wille, R. 1999. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag, Berlin, Heidelberg, New York. 284 pp. ISBN 3-540-62771-5

    MATH  Google Scholar 

  8. Groh, B., Strahringer, S., Wille, R. 1998. TOSCANA-Systems Based on Thesauri. Conceptual Structures: Theory, Tools and Applications. In Proceedings of the 6th International Conference on Conceptual Structures, ICCS'98, (Montpellier, France, 10-12 Aug.). Lecture Notes in Artificial Intelligence, no. 1453. Springer-Verlag, Berlin, Germany, 127-38

    Chapter  Google Scholar 

  9. Luksch, P., Wille, R. 1988. Formal Concept Analysis of Paired Comparisons. Classification and Related Methods of Data Analysis. In Proceedings of the 1st Conf. on the Intl. Federation of Classification Societies, IFCS, (Aachen, West Germany, 29 June-1 July 1987). North-Holland, Amsterdam, Netherlands, 567-75

    Google Scholar 

  10. Schmitt, I., Conrad, S. 1999. Restructuring Object-Oriented Database Schemata Using Formal Concept Analysis. Informatik Forschung und Entwicklung, vol. 14, no. 4. Springer-Verlag, Germany, 218-26

    Google Scholar 

  11. Snelting, G. 2000. Software Reengineering Based on Concept Lattices. In Proceedings of the Fourth European Conference on Software Maintenance and Reengineering (Zurich, Switzerland, 29 Feb.-3 March). IEEE Comput. Soc, Los Alamitos, CA, USA, 3–10

    Google Scholar 

  12. Stumme, G. 1999. Acquiring Expert Knowledge for the Design of Conceptual Information Systems. In Proceedings of the 11th European Workshop on knowledge Acquisition, Modeling, and Management, (Dagstuhl, 26-29 May), (submitted). Lecture Notes in Artificial Intelligence, no. 1621. Springer-Verlag, Berlin-Heidelberg, 271–286

    Google Scholar 

  13. Tawfik, A. Y., Scott, G. 2001. Temporal Matching under Uncertainty. In Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics.

    Google Scholar 

  14. Wille, R. 1982. Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts. Ordered Sets. D. Reidel Publishing Company, Dordrecht-Boston, 445–470

    Google Scholar 

  15. Willett, D., Neukirchen, C., Rottland, J., Rigoll, G. 1999. Refining Tree-Based State Clustering by Means of Formal Concept Analysis, Balanced Decision Trees and Automatically Generated Model-Sets. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP99, (Phoenix, AZ, USA, 15-19 March), vol. 2. IEEE, Piscataway, NJ, USA, 565–8

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Windsor, Windsor, Ontario, N9B 3P4, Canada

    Rabih Neouchi, Ahmed Y. Tawfik & Richard A. Frost

Authors
  1. Rabih Neouchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ahmed Y. Tawfik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Richard A. Frost
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Alberta, Edmonton, AB, Canada, T6G 2E8

    Eleni Stroulia

  2. School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, Canada, K1N 6N5

    Stan Matwin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neouchi, R., Tawfik, A.Y., Frost, R.A. (2001). Towards a Temporal Extension of Formal Concept analysis. In: Stroulia, E., Matwin, S. (eds) Advances in Artificial Intelligence. Canadian AI 2001. Lecture Notes in Computer Science(), vol 2056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45153-6_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-45153-6_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42144-3

  • Online ISBN: 978-3-540-45153-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation