Finding essential attributes in binary data?

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Given a data set, consisting of n-dimensional binary vectors of positive and negative examples, a subset S of the attributes is called a support set if the positive and negative examples can be distinguished by using only the attributes in S. In this paper we consider several selection criteria for evaluating the “separation power” of supports sets, and formulate combinatorial optimization problems for finding the “best and smallest” support sets with respect to such criteria. We provide efficient heuristics, some with a guaranteed performance rate, for the solution of these problems, analyze the distribution of small support sets in random examples, and present the results of some computational experiments with the proposed algorithms.

Original languageEnglish (US)
Title of host publicationIntelligent Data Engineering and Automated Learning - IDEAL 2000
Subtitle of host publicationData Mining, Financial Engineering, and Intelligent Agents - 2nd International Conference, Proceedings
EditorsKwong Sak Leung, Lai-Wan Chan, Helen Meng
PublisherSpringer Verlag
Pages133-138
Number of pages6
ISBN (Print)3540414509, 9783540414506
DOIs
StatePublished - Jan 1 2000
Event2nd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2000 - Shatin, N.T., Hong Kong
Duration: Dec 13 2000Dec 15 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1983
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2000
CountryHong Kong
CityShatin, N.T.
Period12/13/0012/15/00

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Finding essential attributes in binary data?'. Together they form a unique fingerprint.

  • Cite this

    Boros, E., Horiyama, T., Ibaraki, T., Makino, K., & Yagiura, M. (2000). Finding essential attributes in binary data? In K. S. Leung, L-W. Chan, & H. Meng (Eds.), Intelligent Data Engineering and Automated Learning - IDEAL 2000: Data Mining, Financial Engineering, and Intelligent Agents - 2nd International Conference, Proceedings (pp. 133-138). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1983). Springer Verlag. https://doi.org/10.1007/3-540-44491-2_20