TY - GEN
T1 - Mining approximative descriptions of sets using rough sets
AU - Simovici, Dan A.
AU - Mimaroglu, Selim
PY - 2009
Y1 - 2009
N2 - Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from in data set, a problem of interest for biologists that need to find succinct descriptions of families of taxonomic units. Our algorithm is based on an anti-monotonicity of borders of object set and makes use of an approach that is, in a certain sense, a dual of the Apriori algorithm used in identifying frequent item sets.
AB - Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from in data set, a problem of interest for biologists that need to find succinct descriptions of families of taxonomic units. Our algorithm is based on an anti-monotonicity of borders of object set and makes use of an approach that is, in a certain sense, a dual of the Apriori algorithm used in identifying frequent item sets.
UR - https://www.scopus.com/pages/publications/70349409434
UR - https://www.scopus.com/pages/publications/70349409434#tab=citedBy
U2 - 10.1109/ISMVL.2009.18
DO - 10.1109/ISMVL.2009.18
M3 - Conference contribution
AN - SCOPUS:70349409434
SN - 9780769536071
T3 - Proceedings of The International Symposium on Multiple-Valued Logic
SP - 66
EP - 71
BT - Proceedings - 39th International Symposium on Multiple-Valued Logic, ISMVL 2009
T2 - 39th International Symposium on Multiple-Valued Logic, ISMVL 2009
Y2 - 21 May 2009 through 23 May 2009
ER -