Semantics oriented association rules

Fuzzy Systems, 2002. FUZZ-IEEE'02. Proceedings of the 2002 IEEE International Conference(2002)

引用 11|浏览1
暂无评分
摘要
It is well known that relational theory carries very little semantic. To mine deeper semantics, additional modeling is necessary. In fact, some "pure" association rules are found to exist even in randomly generated data. We consider a relational database in which every attribute value has some additional information, such as price, fuzzy degree, neighborhood, or security compartment and levels. Two types of additions are considered: one is structure added, the other is valued-added. Somewhat a surprise, the additional cost in semantics checking is found to be very well compensated by the pruning of non-semantic rules
更多
查看译文
关键词
data mining,data models,fuzzy set theory,relational databases,attribute value,fuzzy degree,neighborhood,nonsemantic rules pruning,price,pure association rules,randomly generated data,relational database,security compartment,semantics checking,semantics oriented association rules,structure added data models,valued added data model,association rule,mathematical model,information security,association rules,fuzzy systems,frequency,value added,data security
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要