On scalability of rough set methods

DOI10.1007/978-3-642-14055-6_30MaRDI QIDQ3164009zbMATH OpenOpenAlexFDO

Authors Piotr Kwiatkowski, Sinh Hoa Nguyen, Hung Son Nguyen

Publication date 27 October 2010

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14055-6_30

zbMATH Keywords

data mininglazy learningrough setscalability

Mathematics Subject Classification ID

Data structures (68P05) Pattern recognition, speech recognition (68T10) Knowledge representation (68T30)

Recommendations

• Scalable Methods in Rough Sets
• scientific article; zbMATH DE number 1927382
• scientific article; zbMATH DE number 1931878
• Rough Sets and Current Trends in Computing
• Learning and applications based on rough set theory

Cites work

• Approximate Boolean Reasoning: Foundations and Applications in Data Mining
• scientific article; zbMATH DE number 1303631 (Why is no real title available?)
• scientific article; zbMATH DE number 1303638 (Why is no real title available?)
• scientific article; zbMATH DE number 1303640 (Why is no real title available?)
• scientific article; zbMATH DE number 1927382 (Why is no real title available?)
• scientific article; zbMATH DE number 2200689 (Why is no real title available?)

Cited in

(6)

• A fast scalable classifier tightly integrated with RDBMS
• Applications of rough sets in big data analysis: an overview
• An Improved Parallel Method for Computing Rough Set Approximations
• Scalable Methods in Rough Sets
• scientific article; zbMATH DE number 1927382 (Why is no real title available?)
• Rough Sets and Current Trends in Computing

Describes a project that uses

Uses Software

• SPRINT

This page was built for publication: On scalability of rough set methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3164009)