Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On Scalability of Rough Set Methods

From MaRDI portal
Publication:3164009
Jump to:navigation, search

DOI10.1007/978-3-642-14055-6_30zbMath1211.68358OpenAlexW1511150001MaRDI QIDQ3164009

Sinh Hoa Nguyen, Piotr Kwiatkowski, 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

scalabilitydata miningrough setlazy learning


Mathematics Subject Classification ID

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


Related Items (1)

Applications of rough sets in big data analysis: an overview


Uses Software

  • SPRINT



Cites Work

  • Approximate Boolean Reasoning: Foundations and Applications in Data Mining
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: On Scalability of Rough Set Methods

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3164009&oldid=16419551"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 05:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki