skip to main content
10.1145/1143997.1144004acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

A new version of the ant-miner algorithm discovering unordered rule sets

Published:08 July 2006Publication History

ABSTRACT

The Ant-Miner algorithm, first proposed by Parpinelli and colleagues, applies an ant colony optimization heuristic to the classification task of data mining to discover an ordered list of classification rules. In this paper we present a new version of the Ant-Miner algorithm, which we call Unordered Rule Set Ant-Miner, that produces an unordered set of classification rules. The proposed version was evaluated against the original Ant-Miner algorithm in six public-domain datasets and was found to produce comparable results in terms of predictive accuracy. However, the proposed version has the advantage of discovering more modular rules, i.e., rules that can be interpreted independently from other rules - unlike the rules in an ordered list, where the interpretation of a rule requires knowledge of the previous rules in the list. Hence, the proposed version facilitates the interpretation of discovered knowledge, an important point in data mining.

References

  1. M. Dorigo, A. Colorni and V. Maniezzo, "The Ant System: optimization by a colony of cooperating agents," IEEE Transactions on Systems, Man, and Cybernetics-Part B, vol. 26, no. 1, pp. 29--41, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. Liu, H. A. Abbass, B. Mckay. Classi?cation rule discovery with ant colony optimization. Proceeding of the IEEE/WIC International Conference on Intelligent Agent Technology, Beijing, China (2003), pp. 83--88. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. P. Oakes, "Ant Colony Optimisation for Stylometry: The Fedaralist Papers." International Conference on Recent Advances in Soft Computing, November 2004.Google ScholarGoogle Scholar
  4. Ziqiang Wang, Boqin Feng, Classification Rule Mining with an Improved Ant Colony Algorithm, Lecture Notes in Computer Science, Volume 3339, Jan 2004, pp. 357--367. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. S. Parpinelli, H. S. Lopes, and A. A. Freitas. Data mining with an ant colony optimization algorithm. IEEE Transactions on Evolutionary Computing 6(4), 2002, pp. 321--332. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. I. H. Witten and E. Frank. Data Mining: practical machine learning tools and techniques. 2nd Edition. Morgan Kaufmann, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. S. Parpinelli, H. S. Lopes and A. A. Freitas. An Ant Colony Algorithm for Classification Rule Discovery. In: H. A. Abbass, R. A. Sarker, C. S. Newton. (Eds.) Data Mining: a Heuristic Approach, pp. 191--208. London: Idea Group Publishing, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  9. P. Clark and R. Boswell. Rule induction with CN2: some recent improvements. Proc. European Working Session on Learning (EWSL-91), LNAI 482, pp. 151--163. Springer, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A new version of the ant-miner algorithm discovering unordered rule sets

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation
      July 2006
      2004 pages
      ISBN:1595931864
      DOI:10.1145/1143997

      Copyright © 2006 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 8 July 2006

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      GECCO '06 Paper Acceptance Rate205of446submissions,46%Overall Acceptance Rate1,669of4,410submissions,38%

      Upcoming Conference

      GECCO '24
      Genetic and Evolutionary Computation Conference
      July 14 - 18, 2024
      Melbourne , VIC , Australia

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader