Fuzzy orderings for fuzzy gradual dependencies: Efficient storage of concordance degrees

Fuzzy Systems(2012)

引用 0|浏览8
暂无评分
摘要
In this paper, we study the mining of gradual patterns in the presence of numeric attributes belonging to data sets. The field of gradual pattern mining have been recently proposed to extract covariations of attributes, such as: {the higher the age, the higher the salary}. This gradual pattern denoted as {size≥salary≥} means that the age of people increases together with their salary. Actually, the analysis of such correlations is very memory consuming. When managing huge databases, issue is very challenging. In this context, we focus on the use of fuzzy orderings to take this into account and we propose techniques in order to optimize the computation. These techniques are based on a matrix representation of fuzzy concordance degrees C(i; j) and the Yale Sparse Matrix Format.
更多
查看译文
关键词
data mining,fuzzy set theory,sparse matrices,Yale sparse matrix format,data sets,efficient storage,fuzzy concordance degrees,fuzzy gradual dependencies,fuzzy orderings,gradual pattern mining,matrix representation,numeric attributes,Gradual pattern mining,fuzzy gradual patterns,fuzzy orderings,sparse matrix formats
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要