Association Rules in Semantically Rich Relations: Granular Computing Approach

Authors:
Tsau Young Lin;Eric Louie
Affiliations:
-;-
Venue:
Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence
Year:
2001

Citing 6
Cited 2

Neighborhood systems and relational databases

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Data Mining and Machine Oriented Modeling: A Granular Computing Approach

Applied Intelligence
Finding Association Rules Using Fast Bit Computation: Machine-Oriented Modeling

ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Granular Computing on Binary Relations

TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Data Mining: Granular Computing Approach

PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
Finding unexpected patterns in data

Data mining, rough sets and granular computing

Database Mining on Derived Attributes

TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Value Added Association Rules

PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

In "real world" databases, attribute domains are more than Cantor sets; the additional semantics defined, in this paper, is assumed to be carried by a binary relation. Association rules in such databases are investigated. In this paper, we show that the cost of checkingthe additional semantics is rather small. Some experiments are reported.