Computing constructs by using typical testor algorithms

Manuel S. Lazo-Cortés, Jesús Ariel Carrasco-Ochoa, José Fco Martínez-Trinidad, Guillermo Sanchez-Diaz

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

1 Citation (Scopus)

Abstract

© Springer International Publishing Switzerland 2015. In their classic form, reducts as well as typical testors areminimal subsets of attributes that retain the discernibility condition. Constructs are a special type of reducts and represent a kind of generalization of the reduct concept. A construct reliably provides sufficient amount of discrimination between objects belonging to different classes as well as sufficient amount of resemblance between objects belonging to the same class. Based on the relation between constructs, reducts and typical testors this paper focuses on a practical use of this relation. Specifically, we propose a method that allows applying typical testor algorithms for computing constructs. The proposed method involves modifying the classic definition of pairwise object comparison matrix adapting it to the requirements of certain algorithms originally designed to compute typical testors. The usefulness of our method is shown through some examples.
Original languageAmerican English
Title of host publicationComputing constructs by using typical testor algorithms
Pages44-53
Number of pages38
ISBN (Electronic)9783319192635
DOIs
StatePublished - 1 Jan 2015
Externally publishedYes
EventLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duration: 1 Jan 2018 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9116
ISSN (Print)0302-9743

Conference

ConferenceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Period1/01/18 → …

Fingerprint

Reduct
Computing
Sufficient
Discrimination
Pairwise
Attribute
Subset
Requirements
Object
Class

Cite this

Lazo-Cortés, M. S., Carrasco-Ochoa, J. A., Martínez-Trinidad, J. F., & Sanchez-Diaz, G. (2015). Computing constructs by using typical testor algorithms. In Computing constructs by using typical testor algorithms (pp. 44-53). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9116). https://doi.org/10.1007/978-3-319-19264-2_5
Lazo-Cortés, Manuel S. ; Carrasco-Ochoa, Jesús Ariel ; Martínez-Trinidad, José Fco ; Sanchez-Diaz, Guillermo. / Computing constructs by using typical testor algorithms. Computing constructs by using typical testor algorithms. 2015. pp. 44-53 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e99bf11ff0a34d06b15bc77a768bc87d,
title = "Computing constructs by using typical testor algorithms",
abstract = "{\circledC} Springer International Publishing Switzerland 2015. In their classic form, reducts as well as typical testors areminimal subsets of attributes that retain the discernibility condition. Constructs are a special type of reducts and represent a kind of generalization of the reduct concept. A construct reliably provides sufficient amount of discrimination between objects belonging to different classes as well as sufficient amount of resemblance between objects belonging to the same class. Based on the relation between constructs, reducts and typical testors this paper focuses on a practical use of this relation. Specifically, we propose a method that allows applying typical testor algorithms for computing constructs. The proposed method involves modifying the classic definition of pairwise object comparison matrix adapting it to the requirements of certain algorithms originally designed to compute typical testors. The usefulness of our method is shown through some examples.",
author = "Lazo-Cort{\'e}s, {Manuel S.} and Carrasco-Ochoa, {Jes{\'u}s Ariel} and Mart{\'i}nez-Trinidad, {Jos{\'e} Fco} and Guillermo Sanchez-Diaz",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-3-319-19264-2_5",
language = "American English",
isbn = "9783319192635",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "44--53",
booktitle = "Computing constructs by using typical testor algorithms",

}

Lazo-Cortés, MS, Carrasco-Ochoa, JA, Martínez-Trinidad, JF & Sanchez-Diaz, G 2015, Computing constructs by using typical testor algorithms. in Computing constructs by using typical testor algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9116, pp. 44-53, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1/01/18. https://doi.org/10.1007/978-3-319-19264-2_5

Computing constructs by using typical testor algorithms. / Lazo-Cortés, Manuel S.; Carrasco-Ochoa, Jesús Ariel; Martínez-Trinidad, José Fco; Sanchez-Diaz, Guillermo.

Computing constructs by using typical testor algorithms. 2015. p. 44-53 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9116).

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

TY - GEN

T1 - Computing constructs by using typical testor algorithms

AU - Lazo-Cortés, Manuel S.

AU - Carrasco-Ochoa, Jesús Ariel

AU - Martínez-Trinidad, José Fco

AU - Sanchez-Diaz, Guillermo

PY - 2015/1/1

Y1 - 2015/1/1

N2 - © Springer International Publishing Switzerland 2015. In their classic form, reducts as well as typical testors areminimal subsets of attributes that retain the discernibility condition. Constructs are a special type of reducts and represent a kind of generalization of the reduct concept. A construct reliably provides sufficient amount of discrimination between objects belonging to different classes as well as sufficient amount of resemblance between objects belonging to the same class. Based on the relation between constructs, reducts and typical testors this paper focuses on a practical use of this relation. Specifically, we propose a method that allows applying typical testor algorithms for computing constructs. The proposed method involves modifying the classic definition of pairwise object comparison matrix adapting it to the requirements of certain algorithms originally designed to compute typical testors. The usefulness of our method is shown through some examples.

AB - © Springer International Publishing Switzerland 2015. In their classic form, reducts as well as typical testors areminimal subsets of attributes that retain the discernibility condition. Constructs are a special type of reducts and represent a kind of generalization of the reduct concept. A construct reliably provides sufficient amount of discrimination between objects belonging to different classes as well as sufficient amount of resemblance between objects belonging to the same class. Based on the relation between constructs, reducts and typical testors this paper focuses on a practical use of this relation. Specifically, we propose a method that allows applying typical testor algorithms for computing constructs. The proposed method involves modifying the classic definition of pairwise object comparison matrix adapting it to the requirements of certain algorithms originally designed to compute typical testors. The usefulness of our method is shown through some examples.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84937509859&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=84937509859&origin=inward

U2 - 10.1007/978-3-319-19264-2_5

DO - 10.1007/978-3-319-19264-2_5

M3 - Conference contribution

SN - 9783319192635

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 44

EP - 53

BT - Computing constructs by using typical testor algorithms

ER -

Lazo-Cortés MS, Carrasco-Ochoa JA, Martínez-Trinidad JF, Sanchez-Diaz G. Computing constructs by using typical testor algorithms. In Computing constructs by using typical testor algorithms. 2015. p. 44-53. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-19264-2_5