Mining Approximative Descriptions of Sets Using Rough Sets

被引：0

作者：

Simovici, Dan A. ^{[1
]}

Mimaroglu, Selim ^{[1
]}

机构：

[1] Univ Massachusetts, Dept Comp Sci, Boston, MA 02125 USA

来源：

ISMVL: 2009 39TH IEEE INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC | 2009年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：66 / 71

页数：6

共 7 条

[1] DUNTSCH I, 2000, ROUGH SETS ANAL ROAD
[2] Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness
[3] Komorowski J., 1999, Rough Fuzzy Hybridization: A New Trend in Decision Making, P3
[4] Lin TY., 1997, Rough Sets and Data Mining, DOI [10.1007/978- 1- 4613- 1461-5., DOI 10.1007/978-1-4613-1461-5, 10.1007/978-1-4613-1461-5]
[5] NGUYEN SH, 1998, ROUGH SETS KNOWLEDGE, V2, P55
[6] Pawlak Z., 1991, Rough Sets: Theoretical Aspects of Reasoning About Data, V9, DOI [10.1007/978-94-011-3534-4, DOI 10.1007/978-94-011-3534-4]
[7] Simovici DA, 2008, ADV INFORM KNOWL PRO, P3, DOI 10.1007/978-1-84800-201-2_1

← 1 →