Two families of classification algorithms

Pawel Delimata; Mikhail Moshkov; Andrzej Skowron; Zbigniew Suraj

doi:10.1007/978-3-540-72530-5_35

Two families of classification algorithms

Pawel Delimata^*, Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

13 Scopus citations

Abstract

In the paper, two families of lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on ordinary and inhibitory rules, but the direct generation of rules is not required. Instead of this, the considered algorithms extract efficiently for a new object some information on the set of rules which is next used by a decision-making procedure.

Original language	English (US)
Title of host publication	Rough Sets, Fuzzy Sets, Data Mining and Granular Computing - 11th International Conference, RSFDGrC 2007, Proceedings
Publisher	Springer Verlag
Pages	297-304
Number of pages	8
ISBN (Print)	9783540725299
DOIs	https://doi.org/10.1007/978-3-540-72530-5_35
State	Published - 2007
Externally published	Yes
Event	11th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computer, RSFDGrC 2007 - Toronto, Canada Duration: May 14 2007 → May 17 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4482 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	11th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computer, RSFDGrC 2007
Country/Territory	Canada
City	Toronto
Period	05/14/07 → 05/17/07

Keywords

Decision tables
Information systems
Rough sets
Rules

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-72530-5_35

Cite this

Delimata, P., Moshkov, M., Skowron, A., & Suraj, Z. (2007). Two families of classification algorithms. In Rough Sets, Fuzzy Sets, Data Mining and Granular Computing - 11th International Conference, RSFDGrC 2007, Proceedings (pp. 297-304). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4482 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-540-72530-5_35

Delimata, Pawel ; Moshkov, Mikhail ; Skowron, Andrzej et al. / Two families of classification algorithms. Rough Sets, Fuzzy Sets, Data Mining and Granular Computing - 11th International Conference, RSFDGrC 2007, Proceedings. Springer Verlag, 2007. pp. 297-304 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{32ac9f160bc24e0481bdf9339287bc8a,

title = "Two families of classification algorithms",

abstract = "In the paper, two families of lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on ordinary and inhibitory rules, but the direct generation of rules is not required. Instead of this, the considered algorithms extract efficiently for a new object some information on the set of rules which is next used by a decision-making procedure.",

keywords = "Decision tables, Information systems, Rough sets, Rules",

author = "Pawel Delimata and Mikhail Moshkov and Andrzej Skowron and Zbigniew Suraj",

year = "2007",

doi = "10.1007/978-3-540-72530-5_35",

language = "English (US)",

isbn = "9783540725299",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "297--304",

booktitle = "Rough Sets, Fuzzy Sets, Data Mining and Granular Computing - 11th International Conference, RSFDGrC 2007, Proceedings",

address = "Germany",

note = "11th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computer, RSFDGrC 2007 ; Conference date: 14-05-2007 Through 17-05-2007",

}

Delimata, P, Moshkov, M, Skowron, A & Suraj, Z 2007, Two families of classification algorithms. in Rough Sets, Fuzzy Sets, Data Mining and Granular Computing - 11th International Conference, RSFDGrC 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4482 LNAI, Springer Verlag, pp. 297-304, 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computer, RSFDGrC 2007, Toronto, Canada, 05/14/07. https://doi.org/10.1007/978-3-540-72530-5_35

Two families of classification algorithms. / Delimata, Pawel; Moshkov, Mikhail; Skowron, Andrzej et al.
Rough Sets, Fuzzy Sets, Data Mining and Granular Computing - 11th International Conference, RSFDGrC 2007, Proceedings. Springer Verlag, 2007. p. 297-304 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4482 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Two families of classification algorithms

AU - Delimata, Pawel

AU - Moshkov, Mikhail

AU - Skowron, Andrzej

AU - Suraj, Zbigniew

PY - 2007

Y1 - 2007

N2 - In the paper, two families of lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on ordinary and inhibitory rules, but the direct generation of rules is not required. Instead of this, the considered algorithms extract efficiently for a new object some information on the set of rules which is next used by a decision-making procedure.

AB - In the paper, two families of lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on ordinary and inhibitory rules, but the direct generation of rules is not required. Instead of this, the considered algorithms extract efficiently for a new object some information on the set of rules which is next used by a decision-making procedure.

KW - Decision tables

KW - Information systems

KW - Rough sets

KW - Rules

UR - http://www.scopus.com/inward/record.url?scp=38049057846&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-72530-5_35

DO - 10.1007/978-3-540-72530-5_35

M3 - Conference contribution

AN - SCOPUS:38049057846

SN - 9783540725299

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

SP - 297

EP - 304

BT - Rough Sets, Fuzzy Sets, Data Mining and Granular Computing - 11th International Conference, RSFDGrC 2007, Proceedings

PB - Springer Verlag

T2 - 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computer, RSFDGrC 2007

Y2 - 14 May 2007 through 17 May 2007

ER -

Delimata P, Moshkov M, Skowron A, Suraj Z. Two families of classification algorithms. In Rough Sets, Fuzzy Sets, Data Mining and Granular Computing - 11th International Conference, RSFDGrC 2007, Proceedings. Springer Verlag. 2007. p. 297-304. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-72530-5_35

Two families of classification algorithms

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this