Skip to main content
SpringerLink
Log in

Determining concepts by group membership

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

One contribution of this paper is an efficient algorithm for deciding membership in a subgroupH of an Abelian groupG whenG andH are in a special form. Our approach is particularly fast because calculations are postponed until needed, and because some decisions can be made based on the existence of certain objects without actually calculating them. This mathematical problem arises naturally in machine learning, and is particularly relevant to concept modeling. We use genetic algorithms as a nontrivial example of how concept formation may correspond to subgroup formation and to illustrate that analysis may reveal abstract concepts determined by group membership which are not initially apparent. This example forms another contribution of this paper; genetic search has not previously been framed within an algebraic context.

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

Similar content being viewed by others

References

  1. Battle, D., Vose, M.D.: Isomorphisms of genetic algorithms. Workshop on the foundations of Genetic Algorithms & Classifier Systems. Indiana: Bloomington July 1990

    Google Scholar 

  2. Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Toronto: Addison-Wesley 1989

    Google Scholar 

  3. Holland, J.H.: Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press 1975

    Google Scholar 

  4. Lang, S.: Algebra, p. 46. Reading MA: Addison Wesley 1971

    Google Scholar 

  5. R. Laue, J.N., Schoenwalder, U.: Algorithms for Soluble Groups and the SOGOS System. In: Computational Group Theory, Proc. of a LMS Symposium, Durham 1982, pp. 105–135. Atkinson, M. (ed). New York: Academic Press 1984

    Google Scholar 

  6. Liepins, G.E., Vose, M.D.: Representational issues in genetic optimization. J. Exp. Theoret. Artificial Intelligence 2(2), 4–30 (1990)

    Google Scholar 

  7. Vose, M.D.: Generalizing the notion of schema in genetic algorithms. Artificial Intelligence (in press)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Tennessee, 107 Ayres Hall, 37996, Knoxville, TN, USA

    Michael D. Vose

Authors
  1. Michael D. Vose
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by the National Science Foundation (IRI-8917545)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vose, M.D. Determining concepts by group membership. AAECC 2, 139–146 (1991). https://doi.org/10.1007/BF01810573

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01810573

Keywords

Search

Navigation